A faster–than relation for asynchronous processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2154, Issue , 2001, Pages 262-276

  Lüttgen, Gerald ^a   Vogler, Walter ^b  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

^b UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSERVATIVE EXTENSIONS; PREORDERS; PROCESS ALGEBRAS; SEMANTIC THEORIES; TIME BOUND;

SEMANTICS;

EID: 84944052206     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_18     Document Type: Conference Paper

References (22)

1. L. Aceto and D. Murphy. Timing and causality in process algebra. Acta Inform., 33(4):317–350, 1996.
2. S. Arun-Kumar and M. Hennessy. An efficiency preorder for processes. Acta Inform., 29(8):737–760, 1992.
3. S. Arun-Kumar and V. Natarajan. Conformance: A precongruence close to bisimilarity. In STRICT’95, Workshops in Comp., pp. 55–68. Springer-Verlag, 1995.
4. J.C.M. Baeten and C.A. Middelburg. Process Algebra with Timing: Real Time and Discrete Time, ch. 10. In Bergstra et al. [5], 2001.
5. J.A. Bergstra, A. Ponse, and S.A. Smolka, eds. Handbookof Process Algebra. Elsevier Science, 2001.
6. E. Bihler and W. Vogler. Efficiency of token-passing MUTEX-solutions. In ICATPN’98, vol. 1420 of LNCS, pp. 185–204. Springer-Verlag, 1998.
7. R. Cleaveland and A. Zwarico. A theory of testing for real time. In LICS’91, pp. 110–119. IEEE Computer Society Press, 1991.
8. F. Corradini, R. Gorrieri, and M. Roccetti. Performance preorder and competitive equivalence. Acta Inform., 34(11):805–835, 1997.
9. R. DeNicola and M.C.B. Hennessy. Testing equivalences for processes. TCS, 34:83–133, 1983.
10. R. Gorrieri, M. Roccetti, and E. Stancampiano. A theory of processes with durational actions. TCS, 140(1):73–94, 1995.
11. M. Hennessy and T. Regan. A process algebra for timed systems. Inform. and Comp., 117:221–239, 1995.
12. L. Jenner and W. Vogler. Comparing the efficiency of asynchronous systems. In ARTS’99, vol. 1601 of LNCS, pp. 172–191. Springer-Verlag, 1999.
13. L. Jenner and W. Vogler. Fast asynchronous systems in dense time. TCS, 254:379–422, 2001.
14. G. Luttgen and W. Vogler. A faster-than relation for asynchronous processes. Techn. Rep. 2001-2, ICASE, NASA Langley Research Center, USA, 2001.
15. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
16. F. Moller and C. Tofts. A temporal calculus of communicating systems. In CONCUR’90, vol. 458 of LNCS, pp. 401–415. Springer-Verlag, 1990.
17. F. Moller and C. Tofts. Relating processes with respect to speed. In CONCUR’91, vol. 527 of LNCS, pp. 424–438. Springer-Verlag, 1991.
18. V. Natarajan and R. Cleaveland. An algebraic theory of process efficiency. In LICS’96, pp. 63–72. IEEE Computer Society Press, 1996.
19. S. Schneider. An operational semantics for timed CSP. Inform. and Comp., 116(2):193–213, 1995.
20. W. Vogler. Faster asynchronous systems. In CONCUR’95, vol. 962 of LNCS, pp. 299–312. Springer-Verlag, 1995.
21. W. Vogler. Efficiency of asynchronous systems and read arcs in Petri nets. In ICALP’97, vol. 1256 of LNCS, pp. 538–548. Springer-Verlag, 1997.
22. W. Vogler and L. Jenner. Axiomatizing a fragment of PAFAS. ENTCS, 39, 2000