Testing equivalences for event structures

  • Luca Aceto
  • Rocco De Nicola
  • Alessandro Fantechi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 280)


A flexible abstraction mechanism for models of concurrency, which allows systems which “look the same” to be considered equivalent, is proposed. Using three classes of atomic observations (sequences of actions, sequences of multisets of actions and partial orderings of actions) different information on the causal and temporal structure of Event Structures, a basic model of parallelism, is captured. As a result, three different semantic models for concurrent systems are obtained. These models can be used as the basis for defining interleaving, multisets or partial ordering semantics of concurrent systems. The common framework used to define the models allows us to study the relationship between these three traditional approaches to the semantics of concurrent communicating systems.


Event Structure Causal Structure Label Transition System Concurrent System Observable Action 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AB84]
    Austry, D. and Boudol, G. Algebre de Processus et Synchronization. Theoret. Comput. Sci. Vol. 30, No. 1, North Holland, Amsterdam (1984).Google Scholar
  2. [BC86]
    Boudol, G. and Castellani, I. On the Semantics of Concurrency: Partial Orders and Transition Systems. Proc. Tapsoft-CAAP '87, Lecture Notes in Computer Science, Volume 249, pp. 123–137, Springer-Verlag, Heidelberg (1987).Google Scholar
  3. [BHR84]
    Brookes, S.D., Hoare, C.A.R. and Roscoe, A.D. A Theory of Communicating Sequential Processes. Journal of ACM, Vol. 31, No. 3, pp. 560–599 (1984).CrossRefGoogle Scholar
  4. [BK84]
    Bergstra, J. and Klop, G. Process Algebra for Synchronous Communication, Information and Control, Vol 60, pp.109–137, North Holland, Amsterdam (1984).CrossRefGoogle Scholar
  5. [CH85]
    Castellani,I. and Hennessy,M. Distributed Bisimulations. Unpublished manuscript, (1985).Google Scholar
  6. [DeN86]
    De Nicola, R.: Extensional Equivalences for Transition Systems, Internal Report IEI-CNR, B4-41 (1986). To appear in Acta Informatica Springer-Verlag, Heidelberg.Google Scholar
  7. [DDM86]
    Degano, P., De Nicola, R. and Montanari, U. Observational Equivalences for Concurrency Models (1986). To appear in Proc. IFIP Workshop on Formal Description of Programming Concepts, (M. Wirsing, ed.), North Holland, Amsterdam.Google Scholar
  8. [DDPS85]
    De Cindio,F., De Michelis,G., Pomello,L. and Simone,C. Exhibited-Behaviour Equivalence and Organizational Abstraction in Concurrent Systems. Proc. 5th International Conference on Distributed Computing Systems, IEEE Computer Society Press, (1985).Google Scholar
  9. [DH84]
    De Nicola, R. and Hennessy, M. Testing Equivalences for Processes. Theoret. Comput. Sci., Vol. 34, pp. 83–133, North Holland, Amsterdam (1984).CrossRefGoogle Scholar
  10. [DM83]
    Degano,P. and Montanari,U. A Model for Distributed Systems based on Graph Rewriting. Internal Report Cnet No. 111, ETS, Pisa (1983). To appear in Journal of ACM.Google Scholar
  11. [HM85]
    Hennessy, M., Milner, R. Algebraic Laws for Nondeterminism and Concurrency. Journal of ACM, Vol.32, No. 1, pp. 137–161 (1985).CrossRefGoogle Scholar
  12. [Hoa85]
    Hoare,C.A.R. Communicating Sequential Processes. Prentice Hall (1985).Google Scholar
  13. [Mil80]
    Milner, R. A Calculus of Communicating Systems. Lecture Notes in Computer Science, Volume 92, Springer-Verlag, Heidelberg (1980).Google Scholar
  14. [Mil83]
    Milner, R. Calculi for Synchrony and Asynchrony. Theoret. Comput. Sci. Vol. 25, pp. 267–310,North Holland, Amsterdam (1983).CrossRefGoogle Scholar
  15. [Moo56]
    Moore,E. Gedanken Experiments on Sequential Machines. In Automata Studies, (Shannon,C.E. and McCarthy,J. eds) Princeton University Press (1956).Google Scholar
  16. [NPW81]
    Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, Event Structures and Domains, Part 1. Theoret. Comput. Sci., Vol.13, pp.85–108, North Holland, Amsterdam (1981).CrossRefGoogle Scholar
  17. [Par81]
    Park, D. Concurrency and Automata on Infinite Sequences. Proc. 5th GI Conference, Lecture Notes in Computer Science, Volume 104, pp. 167–183, Springer-Verlag, Heidelberg (1981).Google Scholar
  18. [Pet80]
    Petri, C.A. Concurrency, in Net Theory and Applications, Lecture Notes in Computer Science Volume 84, pp. 1–19, Springer-Verlag, Heidelberg (1980).Google Scholar
  19. [Pnu86]
    Pnueli, A. Specification and Development of Reactive Systems. Proc. Information Processing '86. (H.-J. Kugler ed.), pp. 845–858, North Holland, Amsterdam (1986).Google Scholar
  20. [Pom86]
    Pomello, L. Some Equivalence Notions for Concurrent Systems: An Overview. In Advances on Petri Nets '85 (G. Rozenberg ed.) Lecture Notes in Computer Science, Volume 222, Springer-Verlag, Heidelberg (1986).Google Scholar
  21. [Rei85]
    Reisig, W.: Petri Nets: An Introduction, EACTS Monographs on Theoretical Computer Science, Springer-Verlag, Heidelberg 1985.Google Scholar
  22. [Win82]
    Winskel, G. Event Structures for CCS and Related Languages. Proc. ICALP '82, (Schmidt, E.M. ed.), Lecture Notes in Computer Science Volume 140, pp. 561–576, Springer-Verlag, Heidelberg (1982).Google Scholar
  23. [Win84]
    Winskel, G. Categories of Models for Concurrency. In Seminar on Concurrency, (Brookes, S.D., Roscoe, A.W. and Winskel, G. eds.), Lecture Notes in Computer Science, Volume 197, pp. 246–267, Springer-Verlag, Heidelberg (1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Luca Aceto
    • 1
  • Rocco De Nicola
    • 2
  • Alessandro Fantechi
    • 2
  1. 1.Dipartimento di InformaticaUniversità di PisaPisa
  2. 2.Istituto di Elaborazione dell'Informazione, C.N.R.Pisa

Personalised recommendations