Comparing the worst-case efficiency of asynchronous systems with pafas

Acta Informatica

Volumn 38, Issue 11-12, 2002, Pages 735-792

  Corradini, Flavio ^a   Vogler, Walter ^b   Jenner, Lars ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

ASYNCHRONOUS CONCURRENT; ASYNCHRONOUS SYSTEM; PRECONGRUENCE; PROCESS ALGEBRAS; TEMPORAL SYSTEMS; TEST ENVIRONMENT; TIMED TESTING; WORST-CASE EFFICIENCY;

EFFICIENCY;

EID: 0042347329     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/s00236-002-0094-3     Document Type: Article

References (39)

1. Aceto L, Murphy D (1996) On the ill–timed but well–caused. Acta Informatica 33: 317–350
2. Alur R, Dill D (1994) A theory of timed automata. Theoret Comput Sci 126: 183–235
3. Arun-Kumar S, Hennessy M (1992) An efficiency preorder for processes. Acta Informatica 29: 737–760
4. Arun-Kumar S, Natarajan V (1995) Conformance: a precongruence close to bisimilarity. In: Desel J (ed) Structures in Concurrency Theory, Worksh. in Computing, pp 55–68. Berlin Heidelberg New York: Springer
5. Baeten J, Bergstra J (1991) Real time process algebra. Formal Aspects of Computing 3: 142–188
6. Bihler E (1998) Effizienzvergleich bei verteilten Systemen – eine Theorie und ein Werkzeug. Diplomarbeit an der Uni. Augsburg
7. Bihler E, Vogler W (1998) Efficiency of token-passing MUTEX-solutions – some experiments. In: Desel et al (eds) Applications and Theory of Petri Nets 1998, Lect Notes Comp Sci Vol 1420, pp 185–204. Berlin Heidelberg New YXork: Springer
8. Boreale M, De Nicola R, Pugliese R (2001) Divergence in testing and readiness semantics. Theoret Comput Sci 266: 237–248
9. Cleaveland R, Zwarico A (1991) A theory of testing for real-time. In: Proc. 6th Symp. on Logic in Computer Science, pp 110–119. IEEE Computer Society Press
10. Corradini F (1998) On the coarsest congruence within global-clock-bounded equivalence. Theoret Comput Sci 198: 225–237
11. Corradini F, Di Berardini MR, Vogler W (2001) PAFAS at work: comparing the worstcase efficiency of three buffer implementations. In: Yu YT, Chen TY (eds) 2nd AsiaPacific Conference on Quality Software APAQS 2001, IEEE, pp 231–240
12. Corradini F, Gorrieri R, Roccetti M (1997) Performance preorder and competitive equivalence. Acta Informatica 34: 805–835
13. Corradini F, Pistore M (2001) Closed interval process algebra versus open interval process algebra. Acta Informatica 37: 467–509
14. Corradini F, Vogler W, Jenner L (2000) Comparing the worst-case efficiency of asynchronous systems with PAFAS. Internal Report 31-2000, University of L’Aquila Available from: http://w3.dm.univaq.it/∼flavio
15. De Nicola R, Hennessy MCB (1984) Testing equivalence for processes. Theoret Comput Sci 34: 83–133
16. Gorrieri R, Roccetti M, Stancampiano E (1995) A theory of processes with durational actions. Theoret Comput Sci 140: 73–294
17. Hennessy M, Regan T (1995) A process algebra for timed systems. Inform Comput 117: 221–239
18. Jenner L (1996) Modular construction of fast asynchronous systems. Technical Report 1996-2, Inst f Informatik, Univ Augsburg, http://www.Informatik.UniAugsburg.DE/skripts/techreports/
19. Jenner L, Vogler W (1999) Comparing the efficiency of asynchronous systems. In: Katoen J-P (ed) AMAST Workshop on Real-Time and Probabilistic Systems, Lect Notes Comp Sci Vol 1601, pp 172–191. Berlin Heidelberg New York: Springer Revised full version as [14]
20. Jenner L, Vogler W (2001) Fast asynchronous systems in dense time. Theoret Comput Sci 254: 379–422
21. Lüttgen G, Vogler W (2001) A faster-than relation for asynchronous processes. In: Larsen K, Nielsen M (eds) CONCUR 01, Lect Notes Comp Sci vol 2154, pp 262–276. Berlin Heidelberg New York: Springer
22. Lynch N (1996) Distributed Algorithms. San Francisco: Morgan Kaufmann Publishers
23. Merlin P, Farber DJ (1976) Recoverability of communication protocols. IEEE Trans. Commun COM-24: 1036–1043
24. Milner R (1989) Communication and Concurrency. Englewood Cliffs, NJ: Prentice Hall
25. Moller F (2000) Private communication
26. Moller F, Tofts C (1990) A temporal calculus of communicating systems. In: CONCUR ’90, Lect Notes Comp Sci vol 458, pp 401–415. Berlin Heidelberg New York: Springer
27. Moller F, Tofts C (1991) Relating processes with respect to speed. In: Baeten J, Groote J (eds) CONCUR ’91, Lect Notes Comp Sci vol 527, pp 424–438. Berlin Heidelberg New York: Springer
28. Natarajan V, Cleaveland R (1996) An algebraic theory of process efficiency. In: 11th Ann. Symp. Logic in Computer Science (LICS ’96), IEEE, pp 63–72
29. Natarajan V, Cleaveland R (1996) Predictability of real-time systems: A processalgebraic approach. In: 11th IEEE Real-Time Systems Symp (RTSS ’96), IEEE
30. Nicollin X, Sifakis J, Yovine S (1993) From ATP to timed graphs and hybrid systems. Acta Informatica 30: 181–202
31. Popova L (1991) On time Petri nets. J Inform Process Cybern EIK 27: 227–244
32. Reed GM, Roscoe AW (1999) The timed failures-stability model for CSP. Theoret Comput Sci 211: 85–127
33. Reed GM, Roscoe AW (1987) Metric spaces as models for real-time concurrency. In: Mathematical Foundations of Programming Language Semantics, Lect Notes Comp Sci vol 298, pp 331–343. Berlin Heidelberg New York: Springer
34. Schneider S (1995) An operational semantics for timed CSP. Inform Comput 116(2): 193–213
35. Vogler W (1995) Timed testing of concurrent systems. Inform Comput 121: 149–171
36. Vogler W (2002) Efficiency of asynchronous systems, read arcs, and the mutex-problem. Theoret Comput Sci 275: 589–631
37. Vogler W (1995) Faster asynchronous systems. In: Lee I, Smolka S (eds), CONCUR 95, Lect Notes Comp Sci vol 962, pp 299–312. Berlin Heidelberg New york: Springer 1995 Full version as Report Nr. 317, Inst. f. Mathematik, Univ. Augsburg,
38. Vogler W, Jenner L (2000) Axiomatizing a fragment of PAFAS. Electr Notes Theoret Comput Sci 39
39. Wang Yi (1990) Real-time behaviour of asynchronous agents. In: CONCUR ’90, Lect Notes Comp Sci vol 458, pp 502–520. Berlin Heidelberg New York: Springer