Abstract
As part of an effort to give a “truly concurrent” semantics to process algebra, we propose a framework of refinements of the failures model for CSP with concurrency, conflict and causality relations on traces. These relations are defined by induction over syntax of CSP processes. We study in detail two new semantics: the possible concurrency (where two traces are said to be concurrent if they may be observations of the same concurrent run) and the possible conflict (two traces are said to be in conflict if they may be observations of two different runs). The guaranteed concurrency is obtained from the possible conflict semantics. Although the expansion law is necessarily weakened to an inequality, we show that most of the CSP laws are preserved, the exception being the idempotency of choice for the possible conflict refinement. Finally, we show that our semantics is well-founded by demonstrating a strong connection with the existing event structures semantics for CSP. The latter results show that, in a certain sense, concurrency distinctions can be made at the level of syntax, without resorting to reasoning about event occurrences.
This research was started when the author was Visiting Academic at the Department of Computing, Imperial College supported by the Nuffield Science Foundation grant (SCI/124/528/G).
Supported by SERC grant GR/F72475.
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
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.
J.C.M. Baeten and J.A. Bergstra. Non interleaving process algebra. In CONCUR 93, volume 715 of Lecture Notes in Computer Science, pages 308–323. Springer- Verlag, 1993.
Bard Bloom and Marta Z. Kwiatkowska. Trade-offs in true concurrency: Pom-sets and Mazurkiewicz traces. In S. Brookes, M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Mathematical Foundations of Programming Semantics, volume 598 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
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.
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, Oxford University, 1983.
P. Degano and U. Montanari. Concurrent histories: A basis for observing distributed systems. Journal of Computer and System Sciences, 34: 422–461, 1987.
M. Hennessy. Concurrent testing of processes. Technical Report 11/91, University of Sussex, 1991.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985.
P.W. Hoogers, H. Kleijn, and P.S. Thiagarajan. A trace semantics for petri nets. In ICA LP’92, volume 623 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
Marta Z. Kwiatkowska and Iain C.C. Phillips. Concurrency and conflict in CSP. In G.L. Burn, S.J. Gay, and M.D. Ryan, editors, Theory and Formal Methods 1993: Proceedings of the First Imperial College, Department of Computing, Workshop on Theory and Formal Methods, Workshops in Computer Science, pages 209–225. Springer-Verlag, 1993.
R. Loogen and U. Goltz. Modelling nondeterministic concurrent processes with event structures. Fundamenta Informaticae, XIV: 39–74, 1991.
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. Nielsen, G. Winskel, and G. Plotkin. Petri nets, event structures and domains. Theoretical Computer Science, 13: 85–108, 1981.
M.W. Shields. Deterministic asynchronous automata. In Formal Methods in Programming. North Holland, 1985.
D. Taubner and W. Vogler. The step failures semantics. In STACS’87, volume 247 of Lecture Notes in Computer Science, pages 348–359. Springer-Verlag, 1987.
F. Vaandrager. A simple definition for parallel composition of prime event structures. Technical Report CS-R8903, CWI, 1989.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 British Computer Society
About this paper
Cite this paper
Kwiatkowska, M., Phillips, I. (1995). Possible and Guaranteed Concurrency in CSP. In: Desel, J. (eds) Structures in Concurrency Theory. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3078-9_15
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3078-9_15
Publisher Name: Springer, London
Print ISBN: 978-3-540-19982-3
Online ISBN: 978-1-4471-3078-9
eBook Packages: Springer Book Archive