Skip to main content
SpringerLink
Log in

Observation Trees

(Extended Abstract)

  • Conference paper
NAPAW 92

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Synopsis

Four ways of structuring experiments over transition systems as observation trees are introduced. The nodes of the trees are labelled by the observations of the corresponding computations. The trees are compared via bisimulations and it is shown that various observational equivalences proposed in the literature can be recast in a general experimental setting. This permits assessing the different equivalences and putting forward criteria for choosing among them. It also throws light on the different assumptions made on observations by the different equivalences and permits a deeper understanding of the differences between, e.g., pomset and history preserving bisimulation, two well studied equivalences for true concurrency.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Aceto,L. History Preserving, Causal and Mixed-Ordering Equivalence over Stable Event Structures, To appear in Fundamenta Informaticae.

    Google Scholar 

  3. Boudol,G. and Castellani,I. On the Semantics of Concurrency: Partial Orders and Transition Systems, Theoret. Comput. Sci., 59, 1,2, (North Holland, 1988 ), 25–84.

    Article  MathSciNet  MATH  Google Scholar 

  4. Boudol, G., Castellani, I., Hennessy, M., Kiehn, A., A Theory of Processes with Localities, CONCUR’92 (W. R. Cleaveland, ed.), LNCS 630, Springer-Verlag, 1992, pp. 108–122.

    Google Scholar 

  5. Broy,M. Process Semantics of Communicating Concurrent Programs. Internal Report Universität Passau, MIP - 8602, 1986.

    Google Scholar 

  6. Darondeau,Ph. and Degano,P. Causal Trees, ICALP ‘89 (Ausiello,G. et al., eds) LNCS 372, Springer-Verlag, 1989, pp. 234–248.

    MathSciNet  Google Scholar 

  7. Degano,P., De Nicola,R. and Montanari,U. Partial ordering derivations for CCS, Proc. 5th Int. Conf. Fundamentals of Computation Theory, Cottbus (DDR), 1985. Lecture Notes in Computer Science, Vol. 199, Springer, Berlin, pp. 520–533.

    Article  Google Scholar 

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

    Article  Google Scholar 

  9. Degano, P., De Nicola, R. e Montanari, U. A distributed operational semantics for CCS based on C/E systems, Acta Informatica, 26 (1988), 59–91.

    Article  MathSciNet  MATH  Google Scholar 

  10. Degano,P., De Nicola,R. and Montanari,U. Partial Ordering Description of Nondeterministic Concurrent Systems, in Linear Time, Branching Time and Partial Orderd in Logic and Models for Concurrency, LNCS 354, Springer-Verlag, (J. De Bakker et al, eds.) 1989, 438–466.

    Google Scholar 

  11. Degano,P., De Nicola,R. and Montanari,U. A Partial Ordering Semantics for CCS, Theoret. Comput. Sci., 75, (1990), 223–262.

    MATH  Google Scholar 

  12. DDM92]Degano,P., De Nicola,R. and Montanari,U. Universal Axioms for Bisimulations, Technical Report TR-9/92, Dipartimento di Informatica, Università di Pisa. Theoret. Comput. Sci.,to appear.

    Google Scholar 

  13. Degano,P. and Priami,C. Proved Trees, ICALP ‘82 (W. Kuich eds) LNCS 623, Springer-Verlag, 1992, pp. 629–640.

    Google Scholar 

  14. Ferrari,G.L., Montanari,U. and Mowbray,M. On Causality Observed Incrementally, Finally, Proc. CAAP’91, LNCS 430, Springer-Verlag, 1991.

    Google Scholar 

  15. Ferrari G. L., Montanan, U. and Mowbray, M. Causal Streams: Tracing Causality in Distributed Systems (Extended Abstract), January 1991, submitted for publication.

    Google Scholar 

  16. van Glabbeek,R. Goltz,U. Equivalence Notions for Concurrent Systems and Refinement of Actions. Proc. MFCS ‘89, LNCS 379, Springer-Verlag, 1989.

    Google Scholar 

  17. van Glabbeek,R. and Vaandrager,F.W. Petri Net Models for Algebraic Theories of Concurrency. Proc. PARLE (J.W. de Bakker, et al., eds.) LNCS 259, Springer-Verlag, 1987, pp. 224–242.

    Google Scholar 

  18. Hennessy,M. and Milner,R. Algebraic Laws for Nondeterminism and Concurrency, Journal of ACM, 32 (1985), pp. 137–161.

    Article  MathSciNet  MATH  Google Scholar 

  19. Kiehn,A. Local and Global Causes, Rep. Tech. Univ. Munchen 342/23/91 A, 1991.

    Google Scholar 

  20. M1180] Milner,R. A Calculus of Communicating Systems. LNCS 92, Springer-Verlag, 1980.

    Google Scholar 

  21. Milner,R. Calculi for Synchrony and Asynchrony, Theoret. Comput. Sci., 25, (1983), 267–310.

    Article  MathSciNet  MATH  Google Scholar 

  22. Milner,R. Communication and Concurrency. Prentice Hall International, London 1989.

    Google Scholar 

  23. Manca,V., Salibra,A. and Scollo,G. Equational Type Logic, Theoret. Comput. Sci., 77, (1990), 131–159.

    Article  MathSciNet  MATH  Google Scholar 

  24. Montanari,U. and Yankelevich,D. A Parametric Approach to Localities, ICALP ‘82 (W. Kuich, ed.) LNCS 623, (Springer-Verlag, 1992 ), pp. 617–628.

    Google Scholar 

  25. Park,D. Concurrency and Automata on Infinite Sequences, in Proc. GI, LNCS 104, Springer-Verlag, 1981, pp. 167–183.

    Google Scholar 

  26. Rabinovich,A. and Trakhtenbrot,B. Nets of Processes, Fundamenta Informaticae 11 (4) 1988, North Holland, 357–404.

    Google Scholar 

  27. Winskel,G. Event Structures, in Advances in Petri Nets 1987, (G. Rozenberg, ed.) LNCS 266, Springer-Verlag, 1987, pp. 196–223.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Università di Parma, Italy

    Pierpaolo Degano

  2. Dipartimento di Informatica, Università di Pisa, Italy

    Pierpaolo Degano

  3. Dipartimento di Scienze dell’Informazione, Università di Roma “La Sapienza”, Italy

    Rocco De Nicola

  4. Dipartimento di Informatica, Università di Pisa, Italy

    Ugo Montanari

Authors
  1. Pierpaolo Degano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rocco De Nicola
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ugo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, 333 Whitmore Laboratory, The Pennsylvania State University, 16802, University Park, PA, USA

    S. Purushothaman PhD

  2. Department of Computer Science, The Johns Hopkins University, 21218, Baltimore, MD, USA

    Amy Zwarico

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Degano, P., De Nicola, R., Montanari, U. (1993). Observation Trees. In: Purushothaman, S., Zwarico, A. (eds) NAPAW 92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3217-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3217-2_7

  • Publisher Name: Springer, London

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

  • Online ISBN: 978-1-4471-3217-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation