Axiomatizing a fragment of PAFAS

Electronic Notes in Theoretical Computer Science

Volumn 39, Issue 3, 2000, Pages 306-321

  Vogler, Walter ^a   Jenner, Lars ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PARALLEL PROCESSING SYSTEMS; THEOREM PROVING;

ASYNCHRONOUS SYSTEMS; AXIOMATIZATION; PARALLEL COMPOSITION; PROCESS ALGEBRA;

COMPUTER SYSTEMS;

EID: 2942556256     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82510-1     Document Type: Conference Paper

References (5)

1. de Nicola R., Hennessy M.C.B. Testing equivalence for processes. Theoret. Comput. Sci. 34:1984;83-133
2. Hennessy M., Regan T. A process algebra for timed systems. Information and Computation. 117:1995;221-239
3. Jenner L., Vogler W. Comparing the efficiency of asynchronous systems. Katoen J.-P. "AMAST Workshop on Real-Time and Probabilistic Systems", Lect. Notes Comp. Sci. 1601:1999;172-191 Springer. Full version as Techn. Rep 1998-3 on http://www.informatik.uni-augsburg.de/skripts/techreports.
4. Jenner L., Vogler W. Fast asynchronous systems in dense time. Meyer auf der Heide F., Monien B. "Automata, Languages and Programming ICALP'96", Lect. Notes Comp. Sci. 1099:1996;75-86 Springer. To appear in Theoret. Comput. Sci.
5. Lynch N. "Distributed Algorithms" 1996;Morgan Kaufmann Publishers, San Francisco