Skip to main content
SpringerLink
Log in

Causal trees interleaving + causality

  • Conference paper
  • First Online:
Semantics of Systems of Concurrent Processes (LITP 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 469))

Included in the following conference series:

Abstract

Causal Trees are a variant of Milner's Synchronization Trees with enriched action labels which supply indication of the observable causes of observable actions, thus providing us with an interleaving description of concurrent systems which faithfully expresses causality. This model borrows from the interleaving models most of their mathematical simplicity and enhances their descriptive power. Actually, Labelled Event Structures can be easily translated to Causal Trees, maintaining all the causal structure the former express. Moreover, various notions of equivalences are defined on Causal Trees, among which those based on causal strong and weak bisimulation, and axiomatized. Also, history preserving bisimulation on Labelled Event Structures coincides with causal strong bisimulation, and a notion of weak history preserving bisimulation is induced by causal weak bisimulation.

Partially supported by ESPRIT Basic Research Action no 3011 CEDISYS

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Austry, D. and Boudol, G. Algébre de Processus et Synchronization, Theoret. Compt. Sci. 30, 1 (1984), 91–131.

    Google Scholar 

  2. Boudol, G. and Castellani, I. Concurrency and Atomicity, Theoret. Comput. Sci. 59, 1–2 (1988), 25–84.

    Google Scholar 

  3. Brookes, S.D., Hoare C.A.R. and Roscoe A.D. A Theory of Communicating Sequential Processes, Journal of A.C.M., 31, 3 (1984), 560–599.

    Google Scholar 

  4. Bergstra, J.A. and Klop, J.W. Process Algebra for SynchronousCommunication, Info. and Control 61 (1984) 109–137.

    Google Scholar 

  5. Bergstra, J.A. and Klop, J.W. Process Theory Based on Bisimulation Semantics, in: [REX89], pp. 50–122.

    Google Scholar 

  6. Castellani, I. Bisimulation and Abstraction Homomorphisms, J.C.S.S., 34 (1987)

    Google Scholar 

  7. Castellani, I. and Hennessy, M. Distributed Bisimulations, J. of A.C.M., 36, 4 (1989) 887–911.

    Google Scholar 

  8. Darondeau, Ph. and Degano, P. Causal Trees, Proc. 16th ICALP (G. Ausiello, M. Dezani-Ciancaglini and S. Ronchi Della Rocca Eds), Stresa, 11–15 July 1989, Springer-Verlag L.N.C.S. (1989) pp. 234–248.

    Google Scholar 

  9. Darondeau, Ph. and Degano, P. About semantic action refinement, Fundamenta Informaticae, to appear.

    Google Scholar 

  10. Darondeau, Ph. and Degano, P. Causal Trees, Event Structures and Refinement, to appear in Proc. 15th Symp. on Math. Foundations of Computer Science, Banskà Bystrica (CS) 1990.

    Google Scholar 

  11. Darondeau, Ph. and Gamatié, B. Modelling Infinitary Behaviours of Communicating Systems, INRIA-Rennes, Research Report 749 (1987).

    Google Scholar 

  12. Degano, P., De Nicola, R. and Montanari, U. Observational Equivalences for Concurrency Models, in Formal Description of Programming Concepts III (M. Wirsing ed.), North-Holland (1987), pp. 105–132.

    Google Scholar 

  13. Degano, P., De Nicola, R. and Montanari, U. A Distributed Operational Semantics for CCS based on Condition/Events Systems, Acta Informatica 26 (1988), 59–91.

    Google Scholar 

  14. Degano, P. De Nicola, R. and Montanari, U. Partial Ordering Semantics for CCS, Internal Report 88-3, Dipartimento di Informatica, Università di Pisa (1988), to appear in Theo. Comp. Sci.

    Google Scholar 

  15. Degano, P., De Nicola, R. and Montanari, U. On the Consistency of Truly Concurrent Operational and Denotational Semantics, Proc. LICS '88, Edinburgh (1988).

    Google Scholar 

  16. Degano, P., De Nicola, R. and Montanari, U. Partial Ordering Description of Nondeterministic Concurrent Systems, in [REX88], pp. 438–466.

    Google Scholar 

  17. Degano, P. and Montanari, U. Concurrent Histories: A Basis for Observing Distributed Systems, J.C.S.S., 34 (1987) 442–461.

    Google Scholar 

  18. van Glabbeek, R. and Goltz, U. Equivalence Notions for Concurrent Systems and Refinement of Actions, Proc. MFCS 89 (A. Kreczmar and G. Mirkowska Eds), Springer LNCS (1989) pp. 237–248.

    Google Scholar 

  19. van Glabbeek, R. and Weijland, W.P. Branching Time and Abstraction in Bisimulation Semantics, Proc. IFIP Congress '89, (1989).

    Google Scholar 

  20. Hennessy, M. and Milner, R. Algebraic Laws for Nondeterminism and Concurrency, Journal of A.C.M., 32 (1985), 137–161.

    Google Scholar 

  21. Kiehn, A. Distributed Bisimulation for Finite CCS, Proc. 2 nd Workshop on Concurrency and Compositionality, S. Miniato, 1990, pp. 45–47.

    Google Scholar 

  22. Mazurkiewicz, A. Concurrent Program Schemas and their Interpretation, Proc. Aarhus Workshop on Verification of Parallel Programs (1977).

    Google Scholar 

  23. Milner, R. A Calculus of Communicating Systems, Springer-Verlag L.N.C.S. 92 (1980).

    Google Scholar 

  24. Milner, R. Notes on a Calculus for Communicating Systems, in: Control Flow and Data Flow: Concepts of Distributed Programming M. Broy (Ed.), NATO ASI Series F: Vol. 14, (Springer-Verlag, Heidelberg, 1984), 205–228.

    Google Scholar 

  25. Montanari, U. and Simonelli, C. On Distinguishing between Concurrency and Nondeterminism, Proc. Ecole de Printemps on Concurrency and Petri Nets, Colleville sur mer (1980).

    Google Scholar 

  26. Montanari, U. and Sassone, V. Dynamic Bisimulation, Università di Pisa, Dipartimento di Informatica, Technical Report TR 13/90, 1990.

    Google Scholar 

  27. Nielesn, M., Plotkin, G. and Winskel, G. Petri Nets, Event Structures and Domains, Part 1, Theoret. Comput. Sci. 13 (1981) 85–108.

    Google Scholar 

  28. Nivat, M. Behaviours of Processes and Synchronized Systems of Processes, in: Theoretical Foundations of Programming Methodology Dordrecht Reidel (1982), pp. 473–550.

    Google Scholar 

  29. Olderog, E.R. Operational Petri Net Semantics for CCSP, in: Advances in Petri Nets 1987, Springer-Verlag L.N.C.S. 266 (1987), pp. 196–223.

    Google Scholar 

  30. Petri, C.A. Concurency, in: Net Theory and Applications, Springer-Verlag L.N.C.S. 84 (1980), pp. 1–19.

    Google Scholar 

  31. Pratt V.R. Modelling Concurrency with Partial Orders, International Journal of Parallel Programming 15 (1986) 33–71.

    Google Scholar 

  32. Plotkin, G. A Structural Approach to Operational Semantics, DAIMI Report FN-19, Department of Computer Science, Aarhus (1981).

    Google Scholar 

  33. Proc. REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (J. de Bakker, W. de Roever, and G. Rozenberg Eds), 1988, Springer-Verlag L.N.C.S. 354 (1989).

    Google Scholar 

  34. Trakhtenbrot, B. and Rabinovich, A. Nets of Processes, Fundamenta Informaticae XI (1988), 357–404.

    Google Scholar 

  35. Vaandrager, F. An Explicit Representation of Equivalence Classes of the History Preserving Bisimulation, Unpublished Manuscript, June 1989.

    Google Scholar 

  36. Winkowski, J. Behaviours of Concurrent Systems, Theor. Comp. Sci. 12 (1980) 39–60.

    Google Scholar 

  37. Winskel, G. Events in Computations, Ph.D. Thesis, University of Edinburgh, CST-10-80 (1980).

    Google Scholar 

  38. Winskel, G. Petri Nets, Algebras, Morphisms and Compositionality, Info. and Co., 72, (1987), 197–238.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA Campus Universitaire de Beaulieu, F-35042, Rennes, France

    Philippe Darondeau

  2. Dipartimento di Informatica, Corso Italia, 40, I-56100, Pisa, Italy

    Pierpaolo Degano

Authors
  1. Philippe Darondeau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierpaolo Degano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Irène Guessarian

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Darondeau, P., Degano, P. (1990). Causal trees interleaving + causality. In: Guessarian, I. (eds) Semantics of Systems of Concurrent Processes. LITP 1990. Lecture Notes in Computer Science, vol 469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53479-2_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-53479-2_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53479-2

  • Online ISBN: 978-3-540-46897-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation