Abstract
Process algebra studies systems that act and react continuously with their environment. It models them by transition graphs, whose nodes represent their states, and whose edges are labelled with the names of events by which they interact with their environment. A trace of the behaviour of a process is recorded as a sequence of observable events in which the process engages. Refinement is defined as the inclusion of all traces of a more refined process in those of the process that it refines. A simulation is a relation that compares states as well as events; by definition, two processes that start in states related by a simulation, and which then engage in the same event, will end in states also related by the same simulation. A bisimulation is defined as a symmetric simulation, and similarity is defined as the weakest of all simulations. In classical automata theory, the transition graphs are deterministic: from a given node, there is at most one edge with a given label; as a result, trace refinement and similarity coincide in meaning.
Research over many years has produced a wide variety of process algebras, distinguished by the manner in which they compare processes, usually by some form of simulation or by some form of refinement. This paper aims to unify the study of process algebras, by maintaining the identity between similarity and trace refinement, even for non-deterministic systems. Obviously, this unifying approach is entirely dependent on prior exploration of the diversity of theories that apply to the unbounded diversity of the real world. The aim of unification is to inspire and co-ordinate the exploration of yet further diversity; in no way does it detract from the value of such exploration.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abdallah, A. E., Jones, C. B., and Sanders, J. W., editors (2005). Twenty-five Years of Communicating Sequential Processes, Lecture Notes in Computer Science. Springer-Verlag.
Bergstra, J. and Klop, J. W. (1985). Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77–121.
Brookes, S. D. (1983). On the relationship of CCS and CSP. In Proceedings of the 10th Colloquium on Automata, Languages and Programming, volume 154 of Lecture Notes in Computer Science, pages 83–96. Springer-Verlag.
Gardiner, P. (2003). Power simulation and its relation to Traces and Failures Refinement. Theoretical Computer Science, 309(1):157–176.
Milner, R. (1989). Communication and concurrency. Prentice Hall.
Milner, R. and Sangiorgi, D. (1992). Barbed bisimulation. In Kuich, W., editor, Proceeding of the 19th International Colloquium on Automata, Languages and Programming (ICALP’92), volume 623 of Lecture Notes in Computer Science, pages 685–695. Springer-Verlag.
1981]_Park, D. (1981). Concurrency and automata on infinite sequences. In Deussen, P., editor, Proceedings of 5th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167–183. Springer-Verlag.
Phillips, I. (1987). Refusal testing. Theoretical Computer Science, 50(3):241–284.
Plotkin, G. D. (1981). A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University.
Roscoe, A. W. (1998). The theory and practice of concurrency. Prentice Hall.
van Glabbeek, R. (1997). Notes on the methodology of CCS and CSP. Theoretical Computer Science, 177(2):329–349.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer
About this paper
Cite this paper
Hoare, T. (2005). Process Algebra: A Unifying Approach. In: Broy, M., Grünbauer, J., Harel, D., Hoare, T. (eds) Engineering Theories of Software Intensive Systems. NATO Science Series, vol 195. Springer, Dordrecht. https://doi.org/10.1007/1-4020-3532-2_9
Download citation
DOI: https://doi.org/10.1007/1-4020-3532-2_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-3530-2
Online ISBN: 978-1-4020-3532-6
eBook Packages: Computer ScienceComputer Science (R0)