Advertisement

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra

  • Gérard Boudol
  • Ilaria Castellani
  • Matthew Hennessy
  • Mogens Nielsen
  • Glynn Winskel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5065)

Abstract

We recall some memories of the Esprit Basic Research Action CEDISYS, a small, well-focussed and fruitful project which brought together researchers at the meeting point of true concurrency and process algebra, in the period 1988-1991. The project was initiated and effectively animated by Ugo Montanari, a passionate and long-time advocate of both these approaches to the semantics of concurrency.

Keywords

Transition System Event Structure Operational Semantic Label Transition System Process Algebra 
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. 1.
    Aceto, L.: Action-refinement in process algebras. In: Distinguished Dissertations in Computer Science. Cambridge University Press, Cambridge (1992)Google Scholar
  2. 2.
    Aceto, L.: History preserving, causal and mixed-ordering equivalence over stable event structures (Note). Fundamenta Informaticae 17(4), 319–331 (1992)zbMATHMathSciNetGoogle Scholar
  3. 3.
    Aceto, L.: Relating distributed, temporal and causal observations of simple processes. Fundamenta Informaticae 17(4), 369–397 (1992)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Aceto, L.: A static view of localities. Formal Aspects of Computing 6, 201–222 (1994); Previously appeared as INRIA Research Report n. 1483 (1991)zbMATHCrossRefGoogle Scholar
  5. 5.
    Aceto, L., Engberg, U.: Failure semantics for a simple process language with refinement. In: Biswas, S., Nori, K.V. (eds.) FSTTCS 1991. LNCS, vol. 560, pp. 89–108. Springer, Heidelberg (1991)Google Scholar
  6. 6.
    Aceto, L., Hennessy, M.: Towards action-refinement in process algebras. Information and Computation 103(2), 204–269 (1993); Extended abstract. In: Proceedings LICS 1989, IEEE Computer Society Press (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Aceto, L., Hennessy, M.: Adding action refinement to a finite process algebra. Information and Computation 115(2), 179–247 (1994); Extended abstract. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, Springer, Heidelberg (1991)Google Scholar
  8. 8.
    Badouel, E., Darondeau, P.: Structural operational specifications and trace automata. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  9. 9.
    Bednarczyk, M.: Categories of Asynchronous Systems. PhD thesis, University of Sussex (1988)Google Scholar
  10. 10.
    Berry, G., Boudol, G.: The chemical abstract machine. Theoretical Computer Science 96, 217–248 (1992); Extended abstract. In: Proceedings POPL 1990, pp. 81–94 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Boudol, G.: Atomic actions (Note). Bulletin of the European Association for Theoretical Computer Science 38, 136–144 (1989)zbMATHGoogle Scholar
  12. 12.
    Boudol, G.: Flow event structures and flow nets. In: Guessarian, I. (ed.) LITP School 1990. LNCS, vol. 469, pp. 62–95. Springer, Heidelberg (1990)Google Scholar
  13. 13.
    Boudol, G., Castellani, I.: On the semantics of concurrency: partial orders and transition systems. In: Ehrig, H., Levi, G., Montanari, U. (eds.) CAAP 1987 and TAPSOFT 1987. LNCS, vol. 249, pp. 123–137. Springer, Heidelberg (1987)Google Scholar
  14. 14.
    Boudol, G., Castellani, I.: Concurrency and atomicity. Theoretical Computer Science 59, 25–84 (1988)CrossRefMathSciNetzbMATHGoogle Scholar
  15. 15.
    Boudol, G., Castellani, I.: A non-interleaving semantics for CCS based on proved transitions. Fundamenta Informaticae 11(4), 433–452 (1988)zbMATHMathSciNetGoogle Scholar
  16. 16.
    Boudol, G., Castellani, I.: Permutation of transitions: an event structure semantics for CCS and SCCS. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX Workshop. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, Springer, Heidelberg (1989)CrossRefGoogle Scholar
  17. 17.
    Boudol, G., Castellani, I.: Flow models of distributed computations: event structures and nets. Research Report 1482, INRIA (1991); Previous version by G. Boudol. In: Guessarian, I.(ed.) LITP School 1990. LNCS, vol. 469, Springer, Heidelberg (1990) Google Scholar
  18. 18.
    Boudol, G., Castellani, I.: Flow models of distributed computations: three equivalent semantics for CCS. Information and Computation 114(2), 247–314 (1994); Extended abstract. In: Guessarian, I. (ed.) LITP School 1990. LNCS, vol. 469, Springer, Heidelberg (1990)Google Scholar
  19. 19.
    Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: Observing localities. Theoretical Computer Science 114, 31–61 (1993); Extended abstract. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol. 520. Springer, Heidelberg (1991)Google Scholar
  20. 20.
    Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: A theory of processes with localities. Formal Aspects of Computing 6, 165–200 (1994); Extended abstract. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 165–200. Springer, Heidelberg (1992)Google Scholar
  21. 21.
    Brookes, S., Hoare, C.A.R., Roscoe, A.: A theory of communicating sequential processes. Journal of ACM 31(3), 560–599 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Cardelli, L., Gordon, A.D.: Mobile Ambients. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol. 1378. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  23. 23.
    Castellani, I.: Bisimulations and abstraction homomorphisms. Journal of Computer and System Sciences 34, 210–235 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    Castellani, I.: Bisimulations for Concurrency. PhD thesis, University of Edinburgh (1988)Google Scholar
  25. 25.
    Castellani, I.: Observing distribution in processes: static and dynamic localities. Int. Journal of Foundations of Computer Science 4(6), 353–393 (1995); Extended abstract. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711. Springer, Heidelberg (1993)Google Scholar
  26. 26.
    Castellani, I.: Process algebras with localities. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 945–1045. North-Holland, Amsterdam (2001)CrossRefGoogle Scholar
  27. 27.
    Castellani, I., Hennessy, M.: Distributed bisimulations. JACM 36(4), 887–911 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    Castellani, I., Zhang, G.Q.: Parallel product of event structures. Theoretical Computer Science 179(1-2), 203–215 (1997); Previously appeared as DAIMI Research Report PB-301, 1989, and as INRIA Research Report 1078 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    Castellano, L., De Michelis, G., Pomello, L.: Concurrency vs interleaving: an instructive example. Bulletin of the EATCS 31, 12–15 (1987)zbMATHGoogle Scholar
  30. 30.
    Cattani, G., Winskel, G.: Profunctors, open maps and bisimulation. MSCS 15(3), 553–614 (2005)zbMATHMathSciNetGoogle Scholar
  31. 31.
    Christensen, S.: Distributed bisimilarity is decidable for a class of infinite state-space systems. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630. Springer, Heidelberg (1992)Google Scholar
  32. 32.
    Corradini, F., De Nicola, R.: Locality based semantics for process algebras. Acta Informatica 34, 291–324 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  33. 33.
    Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292–307. Springer, Heidelberg (2004)Google Scholar
  34. 34.
    Darondeau, P., Degano, P.: Causal trees. In: ICALP 1989. LNCS, vol. 372. Springer, Heidelberg (1989)Google Scholar
  35. 35.
    Darondeau, P., Degano, P.: Causal trees: interleaving + causality. In: Guessarian, I. (ed.) LITP School 1990. LNCS, vol. 469. Springer, Heidelberg (1990)Google Scholar
  36. 36.
    Darondeau, P., Degano, P.: Refinement of actions in event structures and causal trees. Theoretical Computer Science 118(1), 21–48 (1993); Extended abstract. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol. 452. Springer, Heidelberg (1990)Google Scholar
  37. 37.
    De Cindio, F., De Michelis, G., Pomello, L., Simone, C.: A Petri net model for CSP. In: Proceedings CIL 1981, Barcelona (1981)Google Scholar
  38. 38.
    De Cindio, F., De Michelis, G., Pomello, L., Simone, C.: Milner’s Communicating Systems and Petri Nets. In: European Workshop on Applications and Theory of Petri Nets, pp. 40–59 (1982)Google Scholar
  39. 39.
    De Nicola, R., Ferrari, G., Pugliese, R.: Locality based LINDA: programming with explicit localities. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol. 1214, Springer, Heidelberg (1997)CrossRefGoogle Scholar
  40. 40.
    De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: a kernel language for agents interaction and mobility. IEEE Trans. on Software Engineering 24(5), 315–330 (1998)CrossRefGoogle Scholar
  41. 41.
    De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science 43, 83–133 (1984)CrossRefGoogle Scholar
  42. 42.
    Degano, P., De Nicola, R., Montanari, U.: Partial ordering derivations for CCS. In: Budach, L. (ed.) FCT 1985. LNCS, vol. 199, pp. 520–533. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  43. 43.
    Degano, P., De Nicola, R., Montanari, U.: Observational equivalences for concurrency models. In: Proceedings 3rd IFIP WG 2.2 Working Conference, Ebberup 1986, North-Holland, Amsterdam (1987)Google Scholar
  44. 44.
    Degano, P., De Nicola, R., Montanari, U.: A distributed operational semantics for CCS based on condition/event systems. Acta Informatica 26(1/2), 59–91 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  45. 45.
    Degano, P., De Nicola, R., Montanari, U.: On the consistency of truly concurrent operational and denotational semantics. In: Proceedings LICS 1988, IEEE Computer Society Press, Los Alamitos (1988)Google Scholar
  46. 46.
    Degano, P., De Nicola, R., Montanari, U.: Partial orderings descriptions and observations of nondeterministic concurrent processes. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX Workshop. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, Springer, Heidelberg (1989)CrossRefGoogle Scholar
  47. 47.
    Degano, P., De Nicola, R., Montanari, U.: A partial ordering semantics for CCS. Theoretical Computer Science 75(3), 223–262 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  48. 48.
    Degano, P., De Nicola, R., Montanari, U.: Universal axioms for bisimulations. Theoretical Computer Science 114, 63–91 (1993); Extended abstract. In: Proceedings 3rd Workshop on Concurrency and Compositionality, GMD-Studien Nr. 191 (1991)Google Scholar
  49. 49.
    Degano, P., Montanari, U.: Concurrent histories: A basis for observing distributed systems. Journal of Computer and System Sciences 34(2/3), 422–461 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  50. 50.
    Degano, P., Priami, C.: Proved trees. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, Springer, Heidelberg (1992)Google Scholar
  51. 51.
    Ferrari, G.: Unifying Models of Concurrency. PhD thesis, University of Pisa (1990)Google Scholar
  52. 52.
    Ferrari, G., Gorrieri, R., Montanari, U.: An extended expansion theorem. In: Abramsky, S. (ed.) TAPSOFT 1991, CCPSD 1991, and ADC-Talks 1991. LNCS, vol. 494, Springer, Heidelberg (1991)Google Scholar
  53. 53.
    Ferrari, G., Montanari, U.: Towards the unification of models of concurrency. In: Arnold, A. (ed.) CAAP 1990. LNCS, vol. 431, Springer, Heidelberg (1990)Google Scholar
  54. 54.
    Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the join-calculus. In: Proceedings POPL 1996, pp. 372–385 (1996)Google Scholar
  55. 55.
    Gischer, J.L.: Partial orders and the axiomatic theory of shuffle. PhD thesis, Stanford University (1984)Google Scholar
  56. 56.
    van Glabbeek, R.J.: The refinement theorem for ST-bisimulation semantics. In: Proceedings IFIP TC2 Working Conference on Programming Concepts and Methods, pp. 27–52. North-Holland, Amsterdam (1990)Google Scholar
  57. 57.
    van Glabbeek, R.J., Goltz, U.: Equivalence notions for concurrent systems and refinement of actions. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol. 379. Springer, Heidelberg (1989)Google Scholar
  58. 58.
    van Glabbeek, R.J., Goltz, U.: Equivalences and refinement. In: Guessarian, I. (ed.) LITP School 1990. LNCS, vol. 469. Springer, Heidelberg (1990)Google Scholar
  59. 59.
    van Glabbeek, R.J., Goltz, U.: Refinement of actions in causality based models. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX Workshop 1989. LNCS, vol. 430. Springer, Heidelberg (1990)Google Scholar
  60. 60.
    van Glabbeek, R.J., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37(4/5), 229–327 (2001); Previously appeared as Research Report 6/98, University of Hildesheim (1998)Google Scholar
  61. 61.
    van Glabbeek, R.J., Goltz, U.: Well-behaved flow event structures for parallel composition and action refinement. Theoretical Computer Science 311(1-3), 463–478 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  62. 62.
    van Glabbeek, R.J., Vaandrager, F.W.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259. Springer, Heidelberg (1987)Google Scholar
  63. 63.
    Goltz, U., Mycroft, A.: On the relationship of CCS and Petri nets. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172. Springer, Heidelberg (1984)Google Scholar
  64. 64.
    Goltz, U., Reisig, W.: CSP programs as nets with individual tokens. In: Rozenberg, G. (ed.) APN 1984. LNCS, vol. 188. pp. 169–196. Springer, Heidelberg (1985)Google Scholar
  65. 65.
    Gorrieri, R.: Refinement, Atomicity and Transactions for Process Description Languages. PhD thesis, University of Pisa (1991)Google Scholar
  66. 66.
    Gorrieri, R., Marchetti, S., Montanari, U.: A 2CCS: Atomic actions for CCS. Theoretical Computer Science 72, 203–223 (1990); Extended abstract. In: Dauchet, M., Nivat, M. (eds.) CAAP 1988. LNCS, vol. 299. Springer, Heidelberg (1988)Google Scholar
  67. 67.
    Gorrieri, R., Montanari, U.: SCONE: A simple calculus of nets. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458. Springer, Heidelberg (1990)Google Scholar
  68. 68.
    Gorrieri, R., Montanari, U.: Towards hierarchical description of systems: a proof system for strong prefixing. Int. Journal of Foundations of Computer Science 1(3), 277–293 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  69. 69.
    Gorrieri, R., Rensink, A.: Action refinement. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 1047–1147. North-Holland, Amsterdam (2001)CrossRefGoogle Scholar
  70. 70.
    Grabowski, J.: On partial languages. Fundamenta Informaticae 4(1), 427–498 (1981)zbMATHMathSciNetGoogle Scholar
  71. 71.
    Hennessy, M.: On the relationship between time and interleaving. Sophia-Antipolis (1980) (unpublished draft)Google Scholar
  72. 72.
    Hennessy, M.: Axiomatising finite concurrent processes. SIAM Journal of Computing 17(5), 997–1017 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  73. 73.
    Hennessy, M.: A Distributed Pi-calculus. Cambridge University Press, Cambridge (2007)zbMATHGoogle Scholar
  74. 74.
    Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. JACM 32 (1985)Google Scholar
  75. 75.
    Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)zbMATHGoogle Scholar
  76. 76.
    Joyal, A., Nielsen, M., Winskel, G.: Bisimulation and open maps. In: Proceedings LICS 1993, pp. 418–427. IEEE Computer Society Press, Los Alamitos (1993)Google Scholar
  77. 77.
    Kiehn, A.: Concurrency in process algebras. Habilitation Thesis, Technische Universität München (1999)Google Scholar
  78. 78.
    Kiehn, A.: Distributed bisimulations for finite CCS. Report 7/89, University of Sussex (1989)Google Scholar
  79. 79.
    Kiehn, A.: Local and global causes. Technical Report 342/23/91, Technische Universität München (1991)Google Scholar
  80. 80.
    Kiehn, A.: Comparing locality and causality based equivalences. Acta Informatica 31, 697–718 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  81. 81.
    Langerak, R.: Bundle event structures: a non-interleaving semantics for LOTOS. In: Proceedings IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (1992); Previously appeared as University of Twente Research Report (1991)Google Scholar
  82. 82.
    Loogen, R., Goltz, U.: Modelling nondeterministic concurrent processes with event structures. Fundamenta Informaticae XIV(1), 39–74 (1991)MathSciNetGoogle Scholar
  83. 83.
    Mazurkiewicz, A.: Concurrent program schemes and their interpretation. Report DAIMI PB-78, Aarhus University (1977)Google Scholar
  84. 84.
    Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255. Springer, Heidelberg (1987)Google Scholar
  85. 85.
    Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)Google Scholar
  86. 86.
    Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)zbMATHGoogle Scholar
  87. 87.
    Montanari, U., Boudol, G., Castellani, I., Ferrari, G., Hennessy, M., Nielsen, M., Winskel, G.: ESPRIT Basic Research Action n. 3011 CEDISYS - Final Report (1992), http://www-sop.inria.fr/mimosa/personnel/Ilaria.Castellani/CEDISYS-final-report.pdf
  88. 88.
    Montanari, U., Sgamma, M.: Canonical representatives for observational equivalence. In: Proceedings Colloquium on the Resolution of Equations in Algebraic Structures, pp. 292–319. Academic Press, London (1989)Google Scholar
  89. 89.
    Montanari, U., Yankelevich, D.: A parametric approach to localities. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623. Springer, Heidelberg (1992)Google Scholar
  90. 90.
    Montanari, U., Yankelevich, D.: Location equivalence in a parametric setting. Theoretical Computer Science 149. 299–332 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  91. 91.
    Mukund, M., Nielsen, M.: CCS, locations and asynchronous transition systems. In: Shyamasundar, R.K. (ed.) FSTTCS 1992. LNCS, vol. 652, Springer, Heidelberg (1992)Google Scholar
  92. 92.
    Nielsen, M.: CCS and its relationship to net theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, Springer, Heidelberg (1987)Google Scholar
  93. 93.
    Nielsen, M., Engberg, U.H., Larsen, K.S.: Fully abstract models for a process language with refinement. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354. Springer, Heidelberg (1989)CrossRefGoogle Scholar
  94. 94.
    Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains, Part I. Theoretical Computer Science 13(1), 85–108 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  95. 95.
    Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Behavioural notions for elementary net systems. Distributed Computing 4, 45–57 (1990)CrossRefMathSciNetGoogle Scholar
  96. 96.
    Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary transition systems. Theoretical Computer Science 96(1), 3–33 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  97. 97.
    Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Transition systems, event structures and unfoldings. Information and Computation 118(2), 191–207 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  98. 98.
    Olderog, E.-R.: Operational Petri net semantics for CCSP. In: Rozenberg, G. (ed.) APN 1987. LNCS, vol. 266. Springer, Heidelberg (1987)Google Scholar
  99. 99.
    Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104. Springer, Heidelberg (1981)CrossRefGoogle Scholar
  100. 100.
    Petri, C.A.: Nonsequential processes. Research Report 77-05, GMD, Sankt Augustin (1977)Google Scholar
  101. 101.
    Phillips, I., Ulidowski, I.: Reversibility and models for concurrency. Electron. Notes Theor. Comput. Sci. 192(1), 93–108 (2007)CrossRefMathSciNetGoogle Scholar
  102. 102.
    Plotkin, G.D.: A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University (1981)Google Scholar
  103. 103.
    Pratt, V.R.: On the composition of processes. In: Proceedings POPL 1982 (1982)Google Scholar
  104. 104.
    Pratt, V.R.: Modelling concurrency with partial orders. Journal of Parallel Programming 15(1) (1986)Google Scholar
  105. 105.
    Priami, C.: Enhanced Operational Semantics for Concurrency. PhD thesis, University of Pisa (1996)Google Scholar
  106. 106.
    Priami, C., Plotkin, G. (eds.): Transactions on Computational Systems Biology VI. LNCS, vol. 4220. Springer, Heidelberg (2006)zbMATHGoogle Scholar
  107. 107.
    Rabinovich, A., Trakhtenbrot, B.A.: Behavior structures and nets. Fundamenta Informaticae XI(4), 357–404 (1988)MathSciNetGoogle Scholar
  108. 108.
    Reisig, W.: Petri Nets. EATCS Monographs on Theoretical Computer Science (1985)Google Scholar
  109. 109.
    Stark, E.W.: Connections between a concrete and an abstract model of concurrent systems. In: Schmidt, D.A., Main, M.G., Melton, A.C., Mislove, M.W. (eds.) MFPS 1989. LNCS, vol. 442, pp. 53–79. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  110. 110.
    Winskel, G.: Events in Computation. PhD thesis, University of Edinburgh (1980)Google Scholar
  111. 111.
    Winskel, G.: Event structure semantics for CCS and related languages. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140. Springer, Heidelberg (1982)CrossRefGoogle Scholar
  112. 112.
    Winskel, G.: Categories of models for concurrency. In: Brookes, S.D., Winskel, G., Roscoe, A.W. (eds.) Seminar on Concurrency. LNCS, vol. 197, Springer, Heidelberg (1985)Google Scholar
  113. 113.
    Winskel, G.: A new definition of morphism on Petri nets. In: Fontet, M., Mehlhorn, K. (eds.) STACS 1984. LNCS, vol. 166, pp. 140–150. Springer, Heidelberg (1984)Google Scholar
  114. 114.
    Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)Google Scholar
  115. 115.
    Winskel, G.: Petri nets, algebras, morphisms and compositionality. Information and Control 72, 197–238 (1987)zbMATHMathSciNetGoogle Scholar
  116. 116.
    Winskel, G.: Symmetry and concurrency. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 40–64. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  117. 117.
    Winskel, G., Nielsen, M.: Models for concurrency. In: Handbook of Logic in Computer Science, Oxford, vol. 4, pp. 1–148 (1995)Google Scholar
  118. 118.
    Yankelevich, D.: Parametric Views of Process Description Languages. PhD thesis, University of Pisa (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Gérard Boudol
    • 1
  • Ilaria Castellani
    • 1
  • Matthew Hennessy
    • 2
  • Mogens Nielsen
    • 3
  • Glynn Winskel
    • 4
  1. 1.INRIASophia Antipolis CedexFrance
  2. 2.Department of Computer ScienceO’Reilly Institute, Trinity CollegeDublin 2Ireland
  3. 3.Department of Computer ScienceUniversity of AarhusAarhus NDenmark
  4. 4.Computer LaboratoryUniversity of CambridgeCambridgeUK

Personalised recommendations