Abstract
We introduce a new kind of causality between events of a distributed system that takes the nature of the events into account. More precisely, we distinguish between read (receive) and write (send) operations, yielding a relation called read-write causality. We clarify the intuition of our causality relation through examples, and we compare it with classical models of causality. Also, we show that it is better suited than the classical relations for debugging of formal specifications.
Work partially supported by ESPRIT Basic Research Action n. 8130-LOMAPS
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Boudol and I. Castellani. A non-interleaving semantics for CCS based on proved transitions. Foundamenta Informaticae, XI(4):433–452, 1988.
G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. In Proceedings of CONCUR'92, LNCS 630, pages 108–122, 1992.
Ph. Darondeau and P. Degano. Causal trees. In Proceedings of ICALP'89, LNCS 372, pages 234–248. Springer-Verlag, 1989.
P. Degano, R. De Nicola, and U. Montanari. A partial ordering semantics for CCS. Theoretical Computer Science, 75:223–262, 1990.
P. Degano, R. De Nicola, and U. Montanari. Universal axioms for bisimulation. Theoretical Computer Science, 114:63–91, 1993.
P. Degano and C. Priami. Proved trees. In Proceedings of ICALP'92, LNCS 623, pages 629–640. Springer-Verlag, 1992.
P. Degano and C. Priami. Relating models of concurrency. Submitted to Formal Aspects of Computing., 1993.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of ACM, 32:137–161, 1985.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
P. Inverardi, C. Priami, and D. Yankelevich. Automatizing parametric reasoning on distributed concurrent systems. Formal Aspects of Computing, 1993. To appear.
A. Kiehn. Local and global causes. Technical report, TUM 342/23/91, 1991.
R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (I and II). Information and Computation, 100(1):1–77, 1992.
U. Montanari and D. Yankelevich. A parametric approach to localities. In Proceedings of ICALP'92, LNCS 623, pages 617–628. Springer-Verlag, 1992.
D. Park. Concurrency and automata on infinite sequences. In Proceedings of GI, LNCS 104, pages 167–183. Springer-Verlag, 1981.
G. Plotkin. An operational semantics for CSP. In Formal Description of Programming Concepts II, IFIP. North-Holland, 1983.
V. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, 15:33–71, 1986.
A. Rabinovich and B. Trakhtenbrot. Nets of processes. Fundamenta Informaticae, XI(4):357–404, 1988.
B. Thomsen. Calculi for Higher Order Communicating Systems. PhD thesis, Imperial College — University of London, 1990.
G. Winskel. Event structures for CCS and related languages. In Proceedings of ICALP'82, LNCS 140, pages 561–576. Springer-Verlag, 1982.
D. Yankelevich. Parametric Views of Process Description Languages. PhD thesis, Università di Pisa, TD 23/93, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Priami, C., Yankelevich, D. (1994). Read-write causality. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_103
Download citation
DOI: https://doi.org/10.1007/3-540-58338-6_103
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58338-7
Online ISBN: 978-3-540-48663-3
eBook Packages: Springer Book Archive