Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1989: Automata, Languages and Programming pp 234–248Cite as

Causal trees

  • Conference paper
  • First Online:

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

Abstract

The intent of the paper is to reconcile two antagonist views on bisimulation semantics for concurrency: the interleaving approach and the approach by partial orders. The so-called causal trees are a variant of Milner's synchronisation trees with enriched action labels which supply indication of the observable causes of observable actions. Concerning CCS, we construct an algebra of causal trees with two byproducts: a complete axiomatization of weak causal bisimulation between finite terms and a fully abstract model of recursive programs.

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

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 Synchronisation, Theoret. Comput. Sci. 30,1 (1984) 91–131.

    Article  Google Scholar 

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

    Article  Google Scholar 

  3. Boudol,G. and Castellani,I. Permutation of Transitions: an Event Structure Semantics for CCS and SCCS, to appear in [REX88]

    Google Scholar 

  4. 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 

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

    Article  Google Scholar 

  6. Broy, M. and Steicher, T. Views of Distributed Systems, Proc. Advanced School on Math. Models for the Semantics of Parallelism, Springer-Verlag L.N.C.S. 280 (1987) 114–143

    Google Scholar 

  7. Castellani,I. and Hennessy,M. Distributed Bisimulations, Research Report 5/87, Computer Science Department, University of Sussex (1987)

    Google Scholar 

  8. Darondeau, Ph. Processus non séquentiels et leurs observations en univers non centralisé, Proc. Int. Symp. on Programming, Springer-Verlag L.N.C.S. 83 (1980) 92–107

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  11. Degano,P., De Nicola,R. and Montanari,U. A Distributed Operational Semantics for CCS based on Condition/Events Systems, Nota interna B4-21, IEI (1987). To appear in Acta Informatica

    Google Scholar 

  12. Degano,P., De Nicola,R. and Montanari,U. Partial Ordering Semantics for CCS, Internal Report 88-3, Dipartimento di Informatica, Univ. Pisa (1988)

    Google Scholar 

  13. Degano,P., De Nicola,R. and Montanari,U. Partial Ordering Description of Nondeterministic Concurrent Systems, to appear in [REX88]

    Google Scholar 

  14. Degano,P., De Nicola,R. and Montanari,U. On the Consistency of Truly Concurrent Operational and Denotational Semantics, Proc. LICS'88.

    Google Scholar 

  15. Degano, P., Gorrieri,R. and Marchetti,S. An Exercise in Concurrency: A CSP Process as a Condition/Event System, Proc. 8th European Workshop on Applications and Theory of Petri Nets, Zaragoza (1987)

    Google Scholar 

  16. Degano, P. and Montanari, U. A Model of Distributed Systems based on Graph Rewriting, Journal of A.C.M., 34 (1987) 411–449

    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 Vaandrager, F. Petri Net Models for Algebraic Models of Concurrency, Proc. PARLE Conf., Springer-Verlag L.N.C.S. 259 (1987) 224–242

    Google Scholar 

  19. Hennessy,M. An Algebraic Theory of Processes, MIT-Press (1988)

    Google Scholar 

  20. Lamport, L. Time, Clocks and the Ordering of Events in a Distributed System, Comm. of A.C.M., 12 (1978) 558–564

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  23. Milner, R. Lectures on a Calculus for Communicating Systems, NATO ASI Series, Vol. F14, Springer-Verlag (1985) 205–228

    Google Scholar 

  24. 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 

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  28. Petri, C.A. Concurrency, in Net Theory and Applications, Springer-Verlag L.N.C.S. 84 (1980) 1–19

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  31. Reisig,W. Petri Nets: an Introduction, EATCS Monographs on Theoretical Computer Science, Springer-Verlag (1985)

    Google Scholar 

  32. Proc. REX School/Workshop on Linear Time, Branching Time and Partial Orders in Logic and Models for Concurrency, Springer-Verlag L.N.C.S., to appear

    Google Scholar 

  33. Winkowski, J. Behaviours of Concurrent Systems, Theoret. Comput. Sci. 12 (1980) 39–60

    Article  Google Scholar 

  34. Winskel,G. Events in Computation, Ph.D. Thesis, Univ. of Edinburgh, CST-10-80 (1980)

    Google Scholar 

  35. Winskel, G. Event Structures, in Advances in Petri Nets 1987, Springer-Verlag L.N.C.S. 266 (1987) 196–223

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Campus de Beaulieu, Université de Rennes IRISA, F35042, Rennes Cedex

    Ph. Darondeau

  2. Dipartimento di Informatica, Universita di Pisa, Corso Italia, 40, I56100, Pisa

    P. Degano

Authors
  1. Ph. Darondeau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Degano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Mariangiola Dezani-Ciancaglini Simonetta Ronchi Della Rocca

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Darondeau, P., Degano, P. (1989). Causal trees. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035764

Download citation

  • DOI: https://doi.org/10.1007/BFb0035764

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51371-1

  • Online ISBN: 978-3-540-46201-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation