On Performance Congruences for Process Algebras

Information and Computation

Volumn 145, Issue 2, 1998, Pages 191-230

  Corradini, Flavio ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000992073     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2726     Document Type: Article

References (41)

1. Aceto, L., and Murphy, D. (1993), On the ill-timed but well-caused, in "Proceedings of CONCUR'93" (E. Best, Ed.), Lecture Notes in Computer Science, Vol. 715, pp. 97-111, Springer-Verlag, Berlin.
2. Aceto, L., and Murphy, D. (1996), Timing and causality in process algebra, Acta Informatica 33 (4), 317-350.
3. Boreale, M. (1996), Symbolic bisimulation for timed processes, in "Proceedings of AMAST'96," Lecture Notes in Computer Science, Vol. 1101, pp. 321-335, Springer-Verlag, Berlin.
4. Baeten, J., and Bergstra, J. (1991), Real time process algebra, Formal Aspects of Computing 3 (2), 142-188.
5. Boudol, G., Castellani, I., Hennessy, M., Kiehn, A. (1993), A theory of processes with localities, Formal Aspects of Computing 6 (2), 165-200.
6. Cleaveland, R., and Natarajan, V. (1996), An algebraic theory of process efficiency, in "Proceedings of LICS'96," pp. 63-72.
7. Cleaveland, R., and Natarajan, V. (1996), Predictability of real-time systems: A process-algebraic approach, in "Proceedings of Real-Time Systems Symposium," IEEE Computer Soc. Press, Los Alamitos, NM.
8. Cleaveland, R., and Zwarico, A. (1991), A theory of testing for real-time, in "Proceedings of LICS'96," pp. 110-119.
9. Corradini, F. (1995), Compositionality for processes with durational actions, in "Proceedings of ICTCS'95," pp. 279-294, World Scientific, Singapore. [Also, Technical Report SI\RR-95/16, University "La Sapienza" of Rome, 1995.]
10. Corradini, F. (1995), Compositionality for processes with durational actions, in "Proceedings of ICTCS'95," pp. 279-294, World Scientific, Singapore. [Also, Technical Report SI\RR-95/16, University "La Sapienza" of Rome, 1995.]
11. Corradini, F. (1996), On performance congruences for process algebras, Technical Report 106/96, Department of Pure and Applied Mathematics, University of L'Aquila.
12. Corradini, F., Ferrari, G., and Pistore, M. (1997), Eager, busy-waiting and lazy actions in timed computation, in "Proceedings of Express'97," Electronic Notes of Theoretical Computer Science, pp. 113-132.
13. Corradini, F., Gorrieri, R., and Roccetti, M. (1995), Performance preorder: Ordering processes with respect to speed, in "Proceedings of MFCS'95," Lecture Notes in Computer Science, Vol. 969, pp. 444-453, Springer-Verlag, Berlin.
14. Corradini, F., Gorrieri, R., and Roccetti, M. (1997), Performance preorder and competitive equivalence, Acta Informatica 34 (11), 805-835.
15. Corradini, F., and Pistore, M. (1996), Specification and verification of timed lazy systems, in "Proceedings of MFCS'96," Lecture Notes in Computer Science, Vol. 1113, pp. 279-290, Springer-Verlag, Berlin.
16. Corradini, F., and Pistore, M. (1996), Specification and verification of timed systems, Technical Report 107/96, Department of Pure and Applied Mathematics, University of L'Aquila.
17. Darondeau, Ph., and Degano, P. (1989), Causal trees, in "Automata, Languages and Programming," Lecture Notes in Computer Science, Vol. 372, Springer-Verlag, Berlin.
18. Degano, P., De Nicola, R., and Montanari, M. (1987), Observational equivalences for concurrency models, in "Formal Description of Programming Concepts III," pp. 105-132, North Holland, Berlin.
19. De Nicola, R., and Hennessy, M. (1984), Testing equivalences for processes, Theoret. Comput. Sci. 34, 83-133.
20. Ferrari, G.-L., and Montanari, U. (1995), Dynamic matrices and the cost analysis of concurrent programs, in "Proceedings of AMAST'95," Lecture Notes in Computer Science, Vol. 936, pp. 307-321, Springer-Verlag, Berlin.
21. Gorrieri, R., and Roccetti, M. (1993), Toward performance evaluation in process algebras, in "Proceedings of AMAST'93," Workshop in Computing Series, pp. 289-296, Springer-Verlag, Berlin.
22. Gorrieri, R., Roccetti, M., and Stancampiano, E. (1995), A theory of processes with durational actions, Theoret. Comput. Sci. 140 (1), 73-94.
23. van Glabbeek, R. J., and Vaandrager, F. (1987), Petri net models for algebraic theories of concurrency, in "Proceedings of PARLE II," Lecture Notes in Computer Science, Vol. 259, pp. 224-242, Springer-Verlag, Berlin.
24. Hennessy, M. (1988), "An Algebraic Theory of Processes," MIT Series in Computing, MIT Press.
25. Hennessy, M., and Lin, H. (1995), Symbolic bisimulations, Theoret. Comput. Sci. 138, 353-389.
26. Hennessy, M., and Regan, T. (1995), A temporal process algebras, Inform. and Comput. 117, 221-239.
27. Klusener, A. S. (1991), Completeness in real time process algebra, in "Proceedings of CONCUR'91," Lecture Notes in Computer Science, Vol. 527, pp. 376-392, Springer-Verlag, Berlin.
28. Arun-Kumar, S., and Hennessy, M. (1992), An efficiency preorder for processes, Acta Informatica 29, 737-760.
29. Milner, R. (1989), "Communication and Concurrency," International Series on Computer Science, Prentice-Hall, New Jersey.
30. Milner, R., and Sangiorgi, D. (1992), Barbed bisimulations, in "Proceedings of ICALP'92," Lecture Notes in Computer Science, Vol. 623, Springer-Verlag, Berlin.
31. Murphy, D. (1992), Intervals and actions in a timed process algebras, in "Proceedings of MFPS'92." [Also Technical Report Arbeitspapiere der GMD 680, Gesellschaft für Matematik und Dataverarbeitung, St. Augustin, 1992.]
32. Murphy, D. (1992), Intervals and actions in a timed process algebras, in "Proceedings of MFPS'92." [Also Technical Report Arbeitspapiere der GMD 680, Gesellschaft für Matematik und Dataverarbeitung, St. Augustin, 1992.]
33. Moller, F., and Tofts, C. (1990), A temporal calculus of communicating systems, in "Proceedings of CONCUR'90," Lecture Notes in Computer Science, Vol. 459, pp. 401-415, Springer-Verlag, Berlin.
34. Moller, F., and Tofts, C. (1991), Relating processes with respect to speed, in "Proceedings of CONCUR'91," Lecture Notes in Computer Science, Vol. 527, pp. 424-438, Springer-Verlag, Berlin.
35. Montanari, U., and Yankelevich, D. (1992), Partial order localities, in "Proceedings of ICALP'92" (W. Kuich, Ed.), Lecture Notes in Computer Science, Vol. 623, pp. 617-628, Springer-Verlag, Berlin.
36. Nielsen, M., and Thagarajan, P. S. (1984), Degrees of nondeterminism and concurrency, in "Proceedings of 4th Conf. on Found. of Soft. Tech. and Theoretical Computer Science," Lecture Notes in Computer Science, Vol. 181, pp. 89-117, Springer-Verlag, Berlin.
37. Paige, R., and Tarjan, R. (1987), Three partitioning refinement algorithms, SIAM J. Comput. 16.
38. Reed, G. M., and Roscoe, A. W. (1987), Metric spaces as models for real-time concurrency, in "Proceedings of the Third Workshop on the Mathematical Foundations of Programming Languages Semantics," Lecture Notes in Computer Science, Vol. 298, pp. 331-343, Springer-Verlag, Berlin.
39. Reed, G. M., and Roscoe, A. W. (1988), A timed model for communicating sequential processes, Theoret. Comput. Sci. 58, 249-261.
40. Vogler, W. (1995), Timed testing of concurrent systems, Inform. and Comput. 121 (2), 149-171.
41. Wang, Y. (1990), Real time behaviour of asynchronous agents, in "Proceedings of CONCUR'90," Lecture Notes in Computer Science, Vol. 458, pp. 502-520, Springer-Verlag, Berlin.