The algebra of communicating processes with empty process

Theoretical Computer Science

Volumn 177, Issue 2, 1997, Pages 287-328

  Vrancken, J L M ^a  

^a Adviesdienst Verkeer en Vervoer   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMMUNICATION; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; NETWORK PROTOCOLS;

COMMUNICATING PROCESSES;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0347307535     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00250-2     Document Type: Article

References (13)

1. J.C.M. Baeten, J.A. Bergstra, Global renaming operators in concrete process algebra, Inform. and Comput. 78(3) (1988) 205-245.
2. J.C.M. Baeten, J.A. Bergstra, J.W. Klop, Syntax and defining equations for an interrupt mechanism in process algebra, Fund. Inform. IX(2) (1986) 127-168.
3. J.C.M. Baeten, J.A. Bergstra, J.W. Klop, On the consistency of Koomen's fair abstraction rule, Theoret. Comput. Sci. 51(1/2) (1987) 129-176.
4. J.C.M. Baeten, R.J. van Glabbeek, Merge and termination in process algebra, in: K.V. Nori (Ed.), Proc. 7th Conf. on Foundations of Software Technology and Theoretical Computer Science, Pune, India, Lecture Notes in Computer Science, vol. 287, pp. 153-172. Springer, Berlin, 1987.
5. J.A. Bergstra, J.W. Klop, Process algebra for synchronous communication, Inform. and Control 60(1/3) (1984) 109-137.
6. J.A. Bergstra, J.W. Klop, Algebra of communicating processes with abstraction, Theoret. Comput. Sci. 37(1) (1985) 77-121.
7. J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, vol. 18. Cambridge University Press, Cambridge, 1990.
8. S.D. Brookes, C.A.R. Hoare, A.W. Roscoe, A theory of communicating sequential processes, J. ACM 31(3) (1984) 560-599.
9. J.F. Groote, Specification and verification of real time systems in ACP, Report CS-R9015, CWI, Amsterdam, 1990. An extended abstract appeared in: L. Logrippo, R.L. Probert, H. Ural (Eds.), Protocol Specification, Testing and Verification, X, Ottawa, Canada, 1990, pp. 261-274.
10. J.F. Groote, A. Ponse, Process algebra with guards: combining Hoare logic and process algebra, Formal Aspects Comput. 6(2) (1994) 115-164.
11. C.P.J. Koymans, J.L.M. Vrancken, Extending process algebra with the empty process ε, Logic Group Preprint Series Nr. 1, CIF, State University of Utrecht, 1985.
12. R. Milner, Communication and Concurrency, Prentice-Hall International, Englewood Cliffs, NJ, 1989.
13. F.W. Vaandrager, Verification of two communication protocols by means of process algebra, Report CS-R8608, CWI, Amsterdam, 1986.