Abstract
As part of an effort to give a “truly concurrent” semantics to process algebra, we refine the failures with divergence model for CSP by adding conflict information. We show that most of the CSP laws are preserved, the exception being the expansion law and the idempotency of choice.
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
Samson Abramsky. Causal semantics in process algebra. Draft, 1989.
Luca Aceto and Uffe Engberg. Failure semantics for a simple process language with refinement. In Foundations of Software Technology and Theoretical Computer Science, pages 89-108. Springer-Verlag, 1991.
S. Blarney. The soundness and completeness of axioms for CSP processes. In G.M. Reed, A.W. Roscoe, and R.F. Wachter, editors, Topology and Category Theory in Computer Science, pages 29-56. Oxford University Press, 1991.
Gerard Boudol and Ilaria Castellani. Permutation of transitions: an event structure semantics for CCS and SCCS. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency,volume 354 of Lecture Notes in Computer Science,pages 411-427. Springer-Verlag, 1989.
Gerard Boudol and Ilaria Castellani. Three equivalent semantics for CCS. In Semantics of Systems for Concurrent Processes, volume 469 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31 (3): 560 - 599, 1984.
S. D. Brookes and A. W. Roscoe. An improved failures model for communicating processes. In Seminar on Concurrency, volume 197 of Lecture Notes in Computer Science, pages 281-305. Springer-Verlag, 1985.
Stephen Brookes. A Model for Communicating Sequential Processes. PhD thesis 1983
P. Degano and U. Montanari. Concurrent histories: A basis for observing distributed systems. Journal of Computer and System Sciences, 34: 422 - 461, 1987.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985.
Marta Z. Kwiatkowska. On the domain of traces and sequential composition. In S. Abramsky and T.S.E. Maibaum, editors TAPSOFT 91 volume 493 of Lecture Notes in Computer Science,pages 42-56. Springer-Verlag, 1991.
R. Loogen and U. Goltz. A non-interleaving semantics model for nondeterministic concurrent processes. Technical Report 87-15, RWTH Aachen, 1987.
Antoni Mazurkiewicz. Basic notions of trace theory. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 25-34. Springer-Verlag, 1989.
M. Mukund and M. Nielsen. CCS, locations and asynchronous transition systems. In R. Shyamasundar, editor, Foundations of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
M.W. Shields. Deterministic asynchronous automata. In Formal Methods in Programming. North Holland, 1985.
Glynn Winskel. Event structure semantics for CCS and related languages. In Automata, Languages and Programming, volume 140 of Lecture Notes in Computer Science, pages 561-567. Springer-Verlag, 1982.
Glynn Winskel. Event structures. In Advances in Petri Nets, volume 255 of Lecture Notes in Computer Science, pages 325-392. Springer-Verlag, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 British Computer Society
About this paper
Cite this paper
Kwiatkowska, M., Phillips, I. (1993). Concurrency and Conflict in CSP. In: Burn, G., Gay, S., Ryan, M. (eds) Theory and Formal Methods 1993. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3503-6_16
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3503-6_16
Publisher Name: Springer, London
Print ISBN: 978-3-540-19842-0
Online ISBN: 978-1-4471-3503-6
eBook Packages: Springer Book Archive