Abstract
In automata theory, a process is modeled as an automaton. In Chaps. 6 and 7, we studied automata models for simple input/output systems with some extensions. In particular we discussed interaction of systems modeled by automata in Chap. 7. We modeled compositions of simple input/output systems as well as composition of reactive systems. In the latter instance, the composition is based on communication between automata, abstracted as “shared transitions”. The meaning of composed systems is understood from the behavior that can be observed. It is known to algebraists (Milner in A calculus for communicating systems, Lecture notes in computer science, vol 92. Springer, Berlin, 1980) that “the principle of compositionality of meaning requires an algebraic framework.” An algebra that allows equational reasoning about automata is the algebra of regular expressions. This is true for extended finite state machine models in which the semantics of concurrency includes all transitions, including synchronous communications whenever they occur.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Baeten JCM (2003) Over 30 years of process algebra: past, present, and future. In: Accto L, Ésik Z, Fokkink W, Ingólfsdóttir A (eds) Process algebra: open problems and future directions. BRICS notes series, vol NS-03-3, pp 7–12
Bergstra JA, Klop JW (1982) Fixed point semantics in process algebra. Technical report IW 208, Mathematical Center, Amsterdam
Bergstra JA, Klop JW (1984) Process algebra for synchronous communication. Inf Control 60(1):109–137
Bergstra JA, Klop JW (1985) Algebra of communicating processes with abstraction. Theor Comput Sci 37:77–121
Hewitt C, Baker H Jr. (1977) Actors and continuous functionals. MIT/LCS/TR-194
Hoare CAR (1978) Communicating sequential processes. Commun ACM 21(8):666–677
Hoare CAR (1985) Communicating sequential processes. Prentice-Hall, New York
Milner R (1980) A calculus for communicating systems. Lecture notes in computer science, vol 92. Springer, Berlin
Milner R (1989) Communication and concurrency. Prentice-Hall, New York
Milner R (1999) Communicating and mobile systems, the Pi-Calculus. Springer, Berlin
Petri CA (1962) Kommunikation mit automaten. PhD Thesis, Institut fuer Instrumentelle Mathematik, Bonn
Petri CA (1980) Introduction to general net theory. In: Brauer W (ed) Proc advanced course on general net theory, processes, systems. Lecture notes in computer science, vol 84. Springer, Berlin, pp 1–20
Walker D (1987) Introduction to a Calculus of communicating systems. Technical report ECS-LFCS-87-22, Department of Computer Science, University of Edinburgh, Edinburgh
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Alagar, V.S., Periyasamy, K. (2011). Calculus of Communicating Systems. In: Specification of Software Systems. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-277-3_15
Download citation
DOI: https://doi.org/10.1007/978-0-85729-277-3_15
Publisher Name: Springer, London
Print ISBN: 978-0-85729-276-6
Online ISBN: 978-0-85729-277-3
eBook Packages: Computer ScienceComputer Science (R0)