References

  1. Paolo Baldan & Silvia Crafa (2014): A Logic for True Concurrency. J. ACM 61(4), pp. 24:1–24:36, doi:10.1145/2629638.
  2. Marek A. Bednarczyk (1991): Hereditary history preserving bisimulations or what is the power of the future perfect in program logics. Technical report, Polish Academy of Sciences.
  3. Jan A. Bergstra & Jan Willem Klop (1984): Process Algebra for Synchronous Communication. Information and Control 60(1-3), pp. 109–137, doi:10.1016/S0019-9958(84)80025-X.
  4. Gérard Boudol & Ilaria Castellani (1987): On the Semantics of Concurrency: Partial Orders and Transition Systems. In: Proc. of TAPSOFT'87, pp. 123–137, doi:10.1007/3-540-17660-8_52.
  5. Gérard Boudol & Ilaria Castellani (1988): Permutation of transitions: An event structure semantics for CCS and SCCS. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354. Springer, pp. 411–427, doi:10.1007/BFb0013028.
  6. Antonio Bucciarelli & Thomas Ehrhard (1991): Extensional Embedding of a Strongly Stable Model of PCF. In: Proc. of ICALP, LNCS 510. Springer, pp. 35–46, doi:10.1007/3-540-54233-7_123.
  7. Antonio Bucciarelli & Thomas Ehrhard (1991): Sequentiality and Strong Stability. In: Proc. of LICS. IEEE Computer Society, pp. 138–145, doi:10.1109/LICS.1991.151638.
  8. Rocco De Nicola, Ugo Montanari & Frits W. Vaandrager (1990): Back and Forth Bisimulations. In: Proc. of CONCUR, LNCS 458. Springer, pp. 152–165, doi:10.1007/BFb0039058.
  9. Pierpaolo Degano, Rocco De Nicola & Ugo Montanari (1987): Observational equivalences for concurrency models. In: Formal Description of Programming Concepts - III. North-Holland, pp. 105–134.
  10. Pierpaolo Degano, Rocco De Nicola & Ugo Montanari (1988): Partial orderings descriptions and observations of nondeterministic concurrent processes. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354. Springer, pp. 438–466, doi:10.1007/BFb0013030.
  11. Harald Fecher (2004): A completed hierarchy of true concurrent equivalences. Inf. Process. Lett. 89(5), pp. 261–265, doi:10.1016/j.ipl.2003.11.008.
  12. Jean-Yves Girard (1987): Linear Logic. Theor. Comput. Sci. 50, pp. 1–102, doi:10.1016/0304-3975(87)90045-4.
  13. J.L. Gischer (1984): Partial orders and the axiomatic theory of shuffle. Stanford University.
  14. Rob J. van Glabbeek (1990): The Linear Time-Branching Time Spectrum (Extended Abstract). In: Proc. of CONCUR, LNCS 458. Springer, pp. 278–297, doi:10.1007/BFb0039066.
  15. Rob J. van Glabbeek (1993): The Linear Time - Branching Time Spectrum II. In: Proc. of CONCUR, LNCS 715. Springer, pp. 66–81, doi:10.1007/3-540-57208-2_6.
  16. Rob J. van Glabbeek & Ursula Goltz (2001): Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37(4/5), pp. 229–327, doi:10.1007/s002360000041.
  17. Rob J. van Glabbeek, Ursula Goltz & Jens-Wolfhard Schicke-Uffmann (2013): On Characterising Distributability. Logical Methods in Computer Science 9(3), doi:10.2168/LMCS-9(3:17)2013.
  18. Rob J. van Glabbeek & Gordon D. Plotkin (1995): Configuration Structures. In: Proc. of LICS. IEEE Computer Society, pp. 199–209.
  19. C. A. R. Hoare (1978): Communicating Sequential Processes. Commun. ACM 21(8), pp. 666–677, doi:10.1145/359576.359585.
  20. Brendan D. McKay & Adolfo Piperno: nauty/Traces software distribution. Available at http://cs.anu.edu.au/~bdm/nauty and http://pallini.di.uniroma1.it.
  21. Brendan D. McKay & Adolfo Piperno (2014): Practical graph isomorphism, II. Journal of Symbolic Computation 60, pp. 94–112, doi:10.1016/j.jsc.2013.09.003.
  22. R. Milner (1989): Communication and Concurrency. Prentice Hall.
  23. Mogens Nielsen, Gordon D. Plotkin & Glynn Winskel (1981): Petri Nets, Event Structures and Domains, Part I. Theor. Comput. Sci. 13, pp. 85–108, doi:10.1016/0304-3975(81)90112-2.
  24. Mogens Nielsen & P. S. Thiagarajan (2002): Regular Event Structures and Finite Petri Nets: The Conflict-Free Case. In: Applications and Theory of Petri Nets, LNCS 2360. Springer, pp. 335–351, doi:10.1007/3-540-48068-4_20.
  25. J. L. Peterson (1977): Petri Nets. ACM Computing Surveys 9(3), pp. 223–252, doi:10.1145/356698.356702.
  26. J. L. Peterson (1981): Petri Net Theory and the Modeling of Systems. Prentice Hall.
  27. C. A. Petri (1962): Kommunikation mit Automaten. University of Bonn.
  28. Lucia Pomello (1985): Some equivalence notions for concurrent systems. An overview. In: Advances in Petri Nets, LNCS 222. Springer, pp. 381–400, doi:10.1007/BFb0016222.
  29. V. R. Pratt (1985): The pomset model of parallel processes: unifying the temporal and the spatial. In: Proceedings of Seminar on Concurrency, LNCS 197. Springer, pp. 180–196, doi:10.1007/3-540-15670-4_9.
  30. V. R. Pratt (1986): Modelling concurrency with partial orders. International Journal of Parallel Programming 15(1), doi:10.1007/BF01379149.
  31. A. Rabinovich & B. A. Trakhtenbrot (1988): Behaviour structures and nets. Fundamenta Informaticae 11(4), pp. 357–404.
  32. Glynn Winskel (1986): Event Structures. In: Petri Nets: Central Models and Their Properties (Advances in Petri Nets), LNCS 255. Springer, pp. 325–392, doi:10.1007/3-540-17906-2_31.
  33. Glynn Winskel & Mogens Nielsen (1995): Models for Concurrency. In: S. Abramsky, Dov M. Gabbay & T. S. E. Maibaum: Handbook of Logic in Computer Science (Vol. 4). Oxford University Press, Inc., New York, NY, USA, pp. 1–148.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org