Skip to main content

Event structures, causal trees, and refinements

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aceto L. and Hennessy M. Towards Action Refinement in Process Algebras proc. LICS'89 (138–145) 1989

    Google Scholar 

  2. Boudol G. Computations of Distributed Systems, part I: Flow Event Structures and Flow Nets, INRIA-RR (to appear) 1990

    Google Scholar 

  3. Boudol G. and Castellani I. Concurrency and Atomicity. TCS 59 (1–60) 1989

    Google Scholar 

  4. Boudol G. and Castellani I. Permutation of Transitions: an Event Structure Semantics for CCS and SCCS. LNCS 354 (411–427) 1988

    Google Scholar 

  5. Castellani I. and Zhang G.Q. Parallel Product of Event Structures. INRIA-RR 1078, 1989

    Google Scholar 

  6. Darondeau P. and Degano P. Causal Trees. LNCS 372 (234–248) 1989

    Google Scholar 

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

    Google Scholar 

  8. Degano P., De Nicola R., and Montanari U. Partial Ordering Descriptions of Nondeterministic Concurrent Processes. LNCS 354 (438–466) 1988

    Google Scholar 

  9. van Glabbeek R. and Goltz U. Refinement of Actions-in Causality Based Models Arbeitpapier der GMD 428, 1990

    Google Scholar 

  10. van Glabbeek R. and Goltz U. Equivalence Notions for Concurrent Systems and Refinement of Actions. LNCS 379 (237–248) 1989

    Google Scholar 

  11. van Glabbeek R. and Goltz U. Equivalence Notions and Refinement of Actions for Flow Event Structures. Manuscript, Munchen and Sankt Augustin, 1990

    Google Scholar 

  12. Loogen R. and Goltz U. Modelling Nondeterministic Concurrent Processes with Event Structures, to appear in Fundamenta Informaticae, 1990

    Google Scholar 

  13. Milner R. A Calculus of Communicating Systems. LNCS 92, 1980

    Google Scholar 

  14. Nielsen M., Plotkin G., and Winskel G. Petri Nets, Event Structures and Domains, part I. TCS 13 (85–108) 1981

    Google Scholar 

  15. Trakhtenbrot B., Rabinovitch A., and Hirschfeld J. Discerning Causality in the Behaviour of Automata. TR 104/88, Tel Aviv University, 1988

    Google Scholar 

  16. Vaandrager F. An Explicit Representation of Equivalence Classes of the History Preserving Bisimulation. Manuscript, CWI-Amsterdam, 1989

    Google Scholar 

  17. Vaandrager F. SOS and Partial Order Semantics. Talk given at a Workshop on Concurrency and Compositionality in San Miniato, 1990

    Google Scholar 

  18. Winskel G. An Introduction to Event Structures. LNCS 354 (364–397) 1988

    Google Scholar 

  19. Winskel G. Event Structure Semantics for CCS and Related Languages LNCS 140 (561–576) 1982

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Darondeau, P., Degano, P. (1990). Event structures, causal trees, and refinements. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029614

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics