Advertisement

Event structures, causal trees, and refinements

  • Philippe Darondeau
  • Pierpaolo Degano
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 452)

Keywords

Event Structure Computation Tree Refinement Scheme Causal Tree Path Label 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AH.
    Aceto L. and Hennessy M. Towards Action Refinement in Process Algebras proc. LICS'89 (138–145) 1989Google Scholar
  2. Bo.
    Boudol G. Computations of Distributed Systems, part I: Flow Event Structures and Flow Nets, INRIA-RR (to appear) 1990Google Scholar
  3. BCa.
    Boudol G. and Castellani I. Concurrency and Atomicity. TCS 59 (1–60) 1989Google Scholar
  4. BCb.
    Boudol G. and Castellani I. Permutation of Transitions: an Event Structure Semantics for CCS and SCCS. LNCS 354 (411–427) 1988Google Scholar
  5. CZ.
    Castellani I. and Zhang G.Q. Parallel Product of Event Structures. INRIA-RR 1078, 1989Google Scholar
  6. DD.
    Darondeau P. and Degano P. Causal Trees. LNCS 372 (234–248) 1989Google Scholar
  7. DDMa.
    Degano P., De Nicola R., and Montanari U. On the Consistency of Truly Concurrent Operational and Denotational Semantics, proc. LICS'88, 1988Google Scholar
  8. DDMb.
    Degano P., De Nicola R., and Montanari U. Partial Ordering Descriptions of Nondeterministic Concurrent Processes. LNCS 354 (438–466) 1988Google Scholar
  9. GGa.
    van Glabbeek R. and Goltz U. Refinement of Actions-in Causality Based Models Arbeitpapier der GMD 428, 1990Google Scholar
  10. GGb.
    van Glabbeek R. and Goltz U. Equivalence Notions for Concurrent Systems and Refinement of Actions. LNCS 379 (237–248) 1989Google Scholar
  11. GGc.
    van Glabbeek R. and Goltz U. Equivalence Notions and Refinement of Actions for Flow Event Structures. Manuscript, Munchen and Sankt Augustin, 1990Google Scholar
  12. LG.
    Loogen R. and Goltz U. Modelling Nondeterministic Concurrent Processes with Event Structures, to appear in Fundamenta Informaticae, 1990Google Scholar
  13. Mi.
    Milner R. A Calculus of Communicating Systems. LNCS 92, 1980Google Scholar
  14. NPW.
    Nielsen M., Plotkin G., and Winskel G. Petri Nets, Event Structures and Domains, part I. TCS 13 (85–108) 1981Google Scholar
  15. TRH.
    Trakhtenbrot B., Rabinovitch A., and Hirschfeld J. Discerning Causality in the Behaviour of Automata. TR 104/88, Tel Aviv University, 1988Google Scholar
  16. Vaa.
    Vaandrager F. An Explicit Representation of Equivalence Classes of the History Preserving Bisimulation. Manuscript, CWI-Amsterdam, 1989Google Scholar
  17. Vab.
    Vaandrager F. SOS and Partial Order Semantics. Talk given at a Workshop on Concurrency and Compositionality in San Miniato, 1990Google Scholar
  18. Wia.
    Winskel G. An Introduction to Event Structures. LNCS 354 (364–397) 1988Google Scholar
  19. Wib.
    Winskel G. Event Structure Semantics for CCS and Related Languages LNCS 140 (561–576) 1982Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Philippe Darondeau
    • 1
  • Pierpaolo Degano
    • 2
  1. 1.IRISA Campus de BeaulieuRennesFrance
  2. 2.Dipartimento di InformaticaPisaItaly

Personalised recommendations