Bisimulation on speed: Worst-case efficiency

Information and Computation

Volumn 191, Issue 2, 2004, Pages 105-144

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

^a UNIVERSITY OF YORK   (United Kingdom)

^b UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

Asynchronous systems; Bisimulation; Faster than relation; Process algebra; Worst case timing behavior

Indexed keywords

ALGEBRA; ALGORITHMS; AUTOMATA THEORY; COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; SEMANTICS; SET THEORY; THEOREM PROVING;

ASYNCHRONOUS SYSTEMS; BISIMULATION; FASTER-THAN RELATION; PROCESS ALGEBRA; WORST-CASE TIMING BEHAVIOR;

CONCURRENT ENGINEERING;

EID: 2942586900     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2002.08.001     Document Type: Article

References (48)

1. L. Aceto, W. Fokkink, C. Verhoef, Structural operational semantics, in: Bergstra et al. [11], Chapter 3, pp. 197-292.
2. L. Aceto, A.S.A. Jeffrey, A complete axiomatization of timed bisimulations for a class of timed regular behaviours, TCS 152 (2) (1995) 251-268.
3. L. Aceto, D. Murphy, Timing and causality in process algebra, Acta Inform. 33 (4) (1996) 317-350.
4. R. Alur, D. Dill, A theory of timed automata, TCS 126 (2) (1994) 183-235.
5. S. Arun-Kumar, M.C.B. Hennessy, An efficiency preorder for processes, Acta Inform. 29 (8) (1992) 737-760.
6. S. Arun-Kumar, V. Natarajan, Conformance: a precongruence close to bisimilarity, in: STRICT '95, Workshops in Comp., Springer-Verlag, 1995, pp. 55-68.
7. E. Badouel, P. Darondeau, On guarded recursion, TCS 82 (2) (1991) 403-408.
8. J.C.M. Baeten, J.A. Bergstra, Real time process algebra, Form. Asp. Comp. 3 (2) (1991) 142-188.
9. J.C.M. Baeten, C.A. Middelburg, Process algebra with timing: real time and discrete time, in: Bergstra et al. [11], Chapter 10, pp. 627-684.
10. J.C.M. Baeten, W.P. Weijland, Process algebra, in: Cambridge Tracts in Theoretical Computer Science, vol. 18, Cambridge University Press, Cambridge, 1990.
11. J.A. Bergstra, A. Ponse, S.A. Smolka (Eds.), Handbook of Process Algebra, Elsevier, Amsterdam, 2001.
12. G. Berry, G. Gonthier, The ESTEREL synchronous programming language: design, semantics, implementation, Sci. Comput. Programming 19 (2) (1992) 87-152.
13. E. Bihler, W. Vogler, Efficiency of token-passing MUTEX-solutions, in: ICATPN '98, LNCS, vol. 1420, Springer-Verlag, Berlin, 1998, pp. 185-204.
14. M. Bravetti, R. Gorrieri, A complete axiomatization for observational congruence of prioritized finite-state behaviors, in: ICALP 2000, LNCS, vol. 1853, Springer-Verlag, Berlin, 2000, pp. 744-755.
15. R. Cleaveland, G. Lüttgen, M. Mendler, An algebraic theory of multiple clocks, in: CONCUR '97, LNCS, vol. 1243, Springer-Verlag, Berlin, 1997, pp. 166-180.
16. R. Cleaveland, S. Sims, The NCSU Concurrency Workbench, in: CAV '96, LNCS, vol. 1102, Springer-Verlag, Berlin, 1996, pp. 394-397.
17. R. Cleaveland, A. Zwarico, A theory of testing for real time, in: LICS '91, IEEE Computer Society Press, Silver Spring, MD, 1991, pp. 110-119.
18. F. Corradini, M. Di Berardini, W. Vogler, PAFAS at work: comparing the worst-case efficiency of three buffer implementations, in: APAQS 2001, CSP, 2001, pp. 231-240.
19. F. Corradini, R. Gorrieri, M. Roccetti, Performance preorder and competitive equivalence, Acta Inform. 34 (11) (1997) 805-835.
20. F. Corradini, M. Pistore, Closed interval process algebra versus open interval process algebra, Acta Inform. 37 (7) (2001) 467-509.
21. R. De Nicola, M.C.B. Hennessy, Testing equivalences for processes, TCS 34 (1-2) (1984) 83-133.
22. R. Gorrieri, M. Roccetti, E. Stancampiano, A theory of processes with durational actions, TCS 140 (1) (1995) 73-94.
23. M.C.B. Hennessy, Algebraic Theory of Processes, MIT Press, Cambridge, MA, 1988.
24. M.C.B. Hennessy, T. Regan, A process algebra for timed systems, Inform. Comput. 117 (2) (1995) 221-239.
25. H. Hermanns, M. Lohrey, Priority and maximal progress are completely axiomatisable, in: CONCUR '98, LNCS, vol. 1466, Springer-Verlag, Berlin, 1998, pp. 237-252.
26. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs, NJ, 1985.
27. L. Jenner, W. Vogler, Comparing the efficiency of asynchronous systems, in: ARTS '99, LNCS, vol. 1601, Springer-Verlag, Berlin, 1999, pp. 172-191.
28. L. Jenner, W. Vogler, Fast asynchronous systems in dense time, TCS 254 (1-2) (2001) 379-422.
29. N. Lynch, Distributed Algorithms, Morgan Kaufmann, Los Altos, CA, 1996.
30. R. Milner, An algebraic definition of simulation between programs, in: IJCAI '71, William Kaufmann, 1971, pp. 481-489.
31. R. Milner, Calculi for synchrony and asynchrony, TCS 25 (3) (1983) 267-310.
32. R. Milner, A complete inference system for a class of regular behaviours, J. Comput. System Sci. 28 (1984) 439-466.
33. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
34. F. Moller, Private communication, 2000.
35. F. Moller, C. Tofts, A temporal calculus of communicating systems, in: CONCUR '90, LNCS, vol. 458, Springer-Verlag, Berlin, 1990, pp. 401-415.
36. F. Moller, C. Tofts, Relating processes with respect to speed, in: CONCUR '91, LNCS, vol. 527, Springer-Verlag, Berlin, 1991, pp. 424-438.
37. F. Moller, C. Tofts, Behavioural abstraction in TCCS, in: ICALP '92, LNCS, vol. 623, Springer-Verlag, Berlin, 1992, pp. 559-570.
38. V. Natarajan, R. Cleaveland, An algebraic theory of process efficiency, in: LICS '96, IEEE Computer Society Press, Silver Spring, MD, 1996, pp. 63-72.
39. X. Nicollin, J. Sifakis, The algebra of timed processes, ATP: theory and application, Inform. Comput. 114 (1994) 131-178.
40. D.M.R. Park, Concurrency and automata on infinite sequences, in: Fifth G.I. Conference on Theoretical Computer Science, LNCS, vol. 104, Springer-Verlag, Berlin, 1981, pp. 167-183.
41. G.M. Reed, A.W. Roscoe, The timed failures-stability model for CSP, TCS 211 (1/2) (1999) 85-127.
42. D. Sangiorgi, R. Milner, The problem of 'weak bisimulation up to', in: CONCUR '92, LNCS, vol. 630, Springer-Verlag, Berlin, 1992, pp. 32-46.
43. S. Schneider, An operational semantics for timed CSP, Inform. Comput. 116 (2) (1995) 193-213.
44. C. Verhoef, A congruence theorem for structured operational semantics with predicates and negative premises, Nordic J. Comput. 2 (2) (1995) 274-302.
45. W. Vogler, Faster asynchronous systems, Inform. Comput. 184 (2) (2003) 311-342.
46. W. Vogler, Efficiency of asynchronous systems, read arcs, and the MUTEX-problem, TCS 275 (1-2) (2002) 589-631.
47. W. Vogler, L. Jenner, Axiomatizing a fragment of PAFAS, ENTCS 39 (3) (2000).
48. W. Yi, CCS + time=An interleaving model for real time systems, in: ICALP '91, LNCS, vol. 510, Springer-Verlag, Berlin, 1991, pp. 217-228.