Bisimulations for a calculus of broadcasting systems

Theoretical Computer Science

Volumn 200, Issue 1-2, 1998, Pages 225-260

  Hennessy, M ^a   Rathke, J ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

Barbed equivalence; Bisimulation; Broadcasting; Proof systems; Verification

Indexed keywords

EID: 0347662181     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00261-2     Document Type: Article

References (19)

1. R. Amadio, I. Castellani, D. Sangiorgi, On bisimulations for the asynchronous π-calculus, in: U. Montanari, V. Sassone (Eds.), Proc. CONCUR 96, Pisa, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 147-162.
2. J.F. Groote, A. Ponse, The syntax and semantics of μCRL, Report CS-R9076, CWI, Amsterdam, 1990.
3. M. Hennessy, A proof system for communicating processes with value-passing, J. Formal Aspects Comput. Sci. 3 (1991) 346-366.
4. M. Hennessy, A. Ingólfsdóttir, Communicating processes with value-passing and assignment, J. Formal Aspects Comput. Sci. 5 (1993) 432-466.
5. M. Hennessy, H. Lin, Proof systems for message-passing process algebras, in: E. Best (Ed.), Proc. CONCUR 93, Hildesheim, Lecture Notes in Computer Science, vol. 715, Springer, Berlin, 1993, pp. 202-216.
6. M. Hennessy, H. Lin, Symbolic bisimulations, Theoret. Comput. Sci. 138 (1995) 353-389.
7. M. Hennessy, G.D. Plotkin, A term model for CCS, in: P. Dembiński (Ed.), 9th Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 88, Springer, Berlin, 1980, pp. 261-274.
8. M. Hennessy, J. Rathke, Strong bisimulations for a calculus of broadcasting systems, Computer Science Report 1/95, University of Sussex, 1995.
9. M. Hennessy, J. Rathke, Weak bisimulations for a calculus of broadcasting systems, Computer Science Report 3/95, University of Sussex, 1995.
10. I. Lee, S. Smolka (Eds.), Proc. CONCUR 95, Philadelphia, Lecture Notes in Computer Science, vol. 962, Springer, Berlin, 1995.
11. H. Lin, A verification tool for value-passing processes, in: Proc. 13th Internat. Symp. on Protocol Specification, Testing and Verification, IFIP Transactions, North-Holland, Amsterdam, 1993.
12. R. Milner, Communication and Concurrency, Prentice-Hall International, Englewood Cliffs, NJ, 1989.
13. R. Milner, D. Sangiorgi, Barbed bisimulation, in: W. Kuich (Ed.), Proc. 19th ICALP, Vienna, Lecture Notes in Computer Science, vol. 623, Springer, Berlin, 1992.
14. P. Paczkowski, Verifying CBS processes using symbolic semantics, in: Proc. 7th Nordic Workshop on Programming Theory, Report 86, Programming Methodology Group, Göteborgs University and Chalmers University of Technology, 1995, pp. 310-323.
15. K.V.S. Prasad, A calculus of broadcast systems, in: TAPSOFT 91, vol. 1: CAAP, Springer, Berlin, 1991.
16. K.V.S. Prasad, A calculus of value broadcasts. Tech. Rep. Dept. of Computer Science, Chalmers, 1992.
17. K.V.S. Prasad, Programming with broadcasts, in: E. Best (Ed.), Proc. CONCUR 93, Hildesheim, Lecture Notes in Computer Science, vol 715, Springer, Berlin, 1993.
18. D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D. Thesis, University of Edinburgh, 1993.
19. M. Weichert, A forked calculus of broadcasting systems, Licentiate Thesis, Chalmers, 1995.