Abstract
In this paper we introduce causal automata, a formalism for reasoning about reactive systems. In contrast to other formalisms in common use, causal automata permit complex causal relationships to be specified in a straightforward manner while having at the same time a simple and intuitive operational behaviour. Our main result, which follows on from earlier work in [4,5], uses causal automata to give a characterisation of Milner’s notion of confluence.
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
Preview
Unable to display preview. Download preview PDF.
References
Aceto L, De Nicola R, Fantechi A. Testing Equivalences for Event Structures. In: Proceedings Advanced School, Rome. Springer LNCS 280.
Boudol G, Castellani I. Permutation of Transitions: an Event Structure Semantics for CCS. INRIA Research Report No 798. February 1988.
Degano P, De Nicola R, Montanari U. Partial Orderings Descriptions and Observations of Nondeterministic Concurrent Processes. In: Proceedings REX Workshop. Springer LNCS 354, 1989.
Gunawardena J. Purely Parallel Processes. Technical Memo HPL-ISC-TM89–002, Hewlett-Packard Laboratories, Information Systems Centre, March 1989.
Gunawardena J. Deducing Causal Relationships in CCS. In: Veni Madhavan CE (ed). Foundations of Software Technology and Theoretical Computer Science. Proceedings, 1989. Springer LNCS 405, 1989. Also Technical Memo HPL-ISC-TM-89–077, Hewlett-Packard Laboratories, Information Systems Centre, May 1989.
Gunawardena J. Boolean Algebras for Concurrency. In preparation. Expanded version of a talk given at the 2nd Workshop on Concurrency and Compositionality, San Miniato, Italy, 28 February - 3 March, 1990.
Harel D, Pnueli A. On the Development of Reactive Systems. In: Apt KR (ed). Logics and Models of Concurrent Systems. Springer, 1985.
Hoare CAR. Communicating Sequential Processes. International Series in Computer Science. Prentice-Hall, 1985.
Johnstone PT. Notes on Logic and Set Theory. Cambridge Mathematical Textbooks. Cambridge Univeristy Press, 1987.
Milner R. A Calculus of Communicating Systems. Springer LNCS 92, 1980.
Milner R. Communication and Concurrency. International Series in Computer Science. Prentice-Hall, 1989.
Nielsen M, Plotkin G, Winskel G. Petri Nets, Event Structures and Domains. Theoretical Computer Science, 1981; 13: 85–108.
Olderog E-R, Goltz U, van Glabbeek R (eds). Combining Compositionality and Concurrency. GMD Report 320, Gesellschaft Für Mathematik und Datenverarbeitung, Bonn. June 1988.
Rem M. Trace Theory and Systolic Computations. In: de Bakker J.W, Nijman A.J, Treleaven PC (eds). PARLE, Parallel Architectures and Languages Europe. Proceedings, Volume I. Springer LNCS 258, 1987.
Vaandrager FW. Determinism -’ (Event structure isomorphism = Step sequence equivalence). CWI Report CS-R8839. Amsterdam, October 1988.
Winskel G. Event Structures. In: Brauer W, Reisig W, Rozenberg G (eds). Advances in Petri Nets. Springer LNCS 255.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gunawardena, J. (1990). Causal Automata I: Confluence ≡ {AND, OR} Causality. In: Semantics for Concurrency. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3860-0_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3860-0_9
Publisher Name: Springer, London
Print ISBN: 978-3-540-19625-9
Online ISBN: 978-1-4471-3860-0
eBook Packages: Springer Book Archive