Advertisement

A survey of equivalence notions for net based systems

  • L. Pomello
  • G. Rozenberg
  • C. Simone
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 609)

Abstract

This paper surveys various notions of equivalence for concurrent systems in the framework of Elementary Net Systems, a fundamental class in the family of Petri Net models. Two types of equivalences are considered: equivalences based on observations of actions defined in the framework of interleaving, step and partial order semantics; and equivalences based on state spaces and state observability.

Keywords

elementary net systems action observability state observability interleaving semantics step semantics partial order semantics action based equivalence state based equivalence morphism abstraction refinement 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AAB79]
    C. Andre', P.Armand, F.Boeri, Synchronic Relations and Applications in Parallel Computation. Digital Processes 5, Georgi Pub. Comp., 1979.Google Scholar
  2. [Abr87]
    S. Abramsky, Observation Equivalence as a Testing Equivalence, Theoretical Computer Science, North Holland, Amsterdam 53, pp. 225–241, 1987.Google Scholar
  3. [ADF87]
    L. Aceto, R. De Nicola, A. Fantechi, Testing Equivalences for Event Structures, in M.V. Zilli (ed.), “Mathematical Models for the Semantics of Parallelism”, Lecture Notes in Computer Science, Springer Verlag, Berlin 280, pp. 1–20, 1987.Google Scholar
  4. [AH89]
    L. Aceto, M. Hennessy, Towards Action — Refinement in Process Algebras, in Proc. LICS'89, Asilomar, California, IEEE Computer Society Press, Washington, pp. 138–145, 1989.Google Scholar
  5. [And82a]
    C. Andre', Behaviour of a Place-Transition Net on a Subset of Transitions, and Use of The Behaviour Equivalence in Place-Transition Net Analysis, in C. Girault, W. Reisig (eds.), “Applications and Theory of Petri Nets”, Informatik Fachberichte, Springer Verlag, Berlin 52, pp. 131–135 and pp.241–250, 1982.Google Scholar
  6. [And82b]
    C. Andre', Structural Transformations giving B-equivalent PT-Nets, in A. Pagnoni, G. Rozenberg (eds.), “Applications and Theory of Petri Nets”, Informatik Fachberichte, Springer Verlag, Berlin 66, pp. 14–28, 1982.Google Scholar
  7. [BBK87a]
    Baeten, J. A. Bergstra, J. W. Klop, Decidability of Bisimulation Equivalence for Processes generating Context-free Languages, in J.W. de Bakker, A.J. Nijman, P.C. Treleaven (eds.), “PARLE 87, Vol.II: Parallel Languages”, Lecture Notes in Computer Science, Springer Verlag, Berlin 259, pp. 94–113, 1987.Google Scholar
  8. [BBK87b]
    Baeten, J. A. Bergstra, J. W. Klop, Ready-trace Semantics for Concrete Process Algebra with the Priority Operator, The Computer Journal 30(6), pp. 498–506, 1987.Google Scholar
  9. [BC87]
    G. Boudol, I. Castellani, On the Semantics of Concurrency: Partial Orders and Transition Systems, in H. Ehrig, R. Kowalski, G. Levi, U. Montanari (eds.), “TAPSOFT 87”, Lecture Notes in Computer Science, Springer Verlag, Berlin 249, pp. 123–137, 1987.Google Scholar
  10. [BC89]
    G. Boudol, I. Castellani, Permutation of Transitions: An Event Structure Semantics for CCS and SCCS, in J.W. de Bakker, W. P. de Roever, G. Rozenberg (eds.) “Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency”, Lecture Notes in Computer Science, Springer Verlag, Berlin 354, pp 411–427, 1989.Google Scholar
  11. [BD90]
    L. Bernardinello, F. De Cindio, A Survey of Basic Net Models and Modular Net Classes, DEMON Esprit BRA 3148 Deliverables, June 1990 (the revised version is in this special issue).Google Scholar
  12. [BDKP89]
    E. Best, R. Devillers, A. Kiehn, L. Pomello, Fully Concurrent Bisimulation, Université Libre de Bruxelles, LIT-202, July 1989. An improved version appeared under the title: Concurrent Bisimulations in Petri Nets, Acta Inf. 28, pp 231–264, 1991Google Scholar
  13. [Ber87]
    G. Berthelot, Transformations and Decompositions of Nets, in [BRR87], pp. 359–376, 1987.Google Scholar
  14. [Bes87]
    E. Best, Structure Theory of Petri Nets: the Free Choice Hiatus, in [BRR87], pp. 168–206, 1987.Google Scholar
  15. [BF88]
    E. Best, C. Fernandez, Nonsequential Processes, a Petri Net View, EATCS Monographs on Theoretical Computer Science n.13, Springer Verlag, 1988.Google Scholar
  16. [BGV90]
    W. Brauer, R. Gold, W. Vogler, Behaviour and Equivalences Preserving Refinements of Petri Nets, in G. Rozenberg (ed.) Advances in Petri Nets, Springer Verlag, Berlin'90, Lecture Notes in Computer Science, Springer Verlag, Berlin 483, pp. 1–46, 1991.Google Scholar
  17. [BHR84]
    S.D. Brookes, C.A.R. Hoare, A.W. Roscoe, A Theory of Communicating Sequential Processes, Journal of the ACM 31 N.3, 1984.Google Scholar
  18. [BK85]
    J. A. Bergstra, J. W. Klop, Algebra of Communicating Processes with Abstraction, Theoretical Computer Science, North Holland, Amsterdam 37 1, pp. 77–121, 1985.Google Scholar
  19. [Bro83]
    S.D. Brookes, On the Relationship of CCS and CSP, in J. Diaz (ed.), “Automata Languages and Programming 83”, Lecture Notes in Computer Science, Springer Verlag, Berlin 154, pp. 83–96, 1983.Google Scholar
  20. [Bro84]
    S.D. Brookes, A Semantics and Proof System for Communicating Processes, in E. Clarke and D. Kozen (eds.), “Logics of Programs”, Lecture Notes in Computer Science, Springer Verlag, Berlin 164, pp. 68–85, 1984.Google Scholar
  21. [BRR87]
    W. Brauer, W. Reisig, G. Rozenberg (eds.), Petri Nets: Central Models and Their Properties, Lecture Notes in Computer Science, Springer Verlag, Berlin 254, 1987.Google Scholar
  22. [Cas87]
    I. Castellani, Bisimulations for Concurrency, Ph.D. Thesis, University of Edinburgh, 1987.Google Scholar
  23. [CFM83]
    I. Castellani, P. Franceschi, U. Montanari, Labeled Event Structures: A Model for Observable Concurrency, in D.Bjorner (ed.), “Formal Description of Programming Concepts II”, pp. 383–400, North-Holland, 1983.Google Scholar
  24. [CH87]
    I. Castellani, M. Hennessy, Distributed Bisimulations, Report N. 4/87, University of Sussex, July 1987.Google Scholar
  25. [Cha91]
    G. Chehaibar, Replacement of Open Interface Subnets and Stable State Transformation Equivalence, Proc. XII International Conference on Applicatons and Theory of Petri Nets, Gjern (DK), pp 490–509,1991.Google Scholar
  26. [Dar82]
    P. Darondeau, An enlarged Definition and complete Axiomatization of Observational Congruence of Finite Processes, in M. Dezani-Ciancaglini, U. Montanari (eds.), “International Symposium on Programming”, Lecture Notes in Computer Science, Springer Verlag, Berlin 137, pp. 47–62, 1982.Google Scholar
  27. [DD90]
    P. Darondeau, P. Degano, Event Structures, Causal Trees, and Refinements, in B. Rovan (ed.), “Mathematical Foundations of Computer Science”, Lecture Notes in Computer Science, Springer Verlag, Berlin 452, 1990.Google Scholar
  28. [DDM87]
    P. Degano, R. De Nicola, U. Montanari, Observational Equivalences for Concurrency Models, in M. Wirsing (ed.), “Formal Description of Programming Concepts III”, North Holland, pp 105–132, 1987.Google Scholar
  29. [DDM89]
    P. Degano, R. De Nicola, U. Montanari, Partial Ordering Description of Nondeterministic Concurrent Systems, in Proc. REX School/Workshop on Linear, Branching Time and Partial Order in Logics and Models of Concurrency, Lecture Notes in Computer Science, Springer Verlag, Berlin 354, pp. 438–466, 1989.Google Scholar
  30. [DDPS83]
    F. De Cindio, G. De Michelis, L. Pomello, C. Simone, Equivalence Notions For Concurrent Systems, in A. Pagnoni, G. Rozenberg (eds.), “Applications and Theory of Petri Nets”, Informatik Fachberichte, Springer Verlag, Berlin 66, pp. 29–39, 1983.Google Scholar
  31. [DDPS85]
    F. De Cindio, G. De Michelis, L. Pomello, C. Simone, Exhibited-Behaviour Equivalence and Organizational Abstraction in Concurrent System Design, Proc. 5th International Conference on Distributed Computing, IEEE, Denver Co., pp. 486–495, 1985.Google Scholar
  32. [DDPS88]
    F. De Cindio, G. De Michelis, L. Pomello, C. Simone, A State Transformation Equivalence for Concurent Systems: Exhibited Functionality Equivalence, in F.H. Vogt (ed.),“CONCURRENCY 88”, Lecture Notes in Computer Science, Springer Verlag, Berlin 335, pp. 222–236, 1988.Google Scholar
  33. [DDS87]
    F. De Cindio, G. De Michelis, C. Simone, GAMERU: a Language for the Analysis and Design of human Communication Pragmatics, in G. Rozenberg (ed.), Advances in Petri Nets, Springer Verlag, Berlin' 86, Lecture Notes in Computer Science, Springer Verlag, Berlin 266, pp. 21–44, 1987.Google Scholar
  34. [DeM90]
    G. De Michelis, Domains of EN systems (extended abstract), 2nd Workshop on Concurrency and Compositionality, San Miniato, February–March 1990.Google Scholar
  35. [DeN85]
    R. De Nicola, Two Complete Sets of Axioms for a Theory of Communicating Sequential Processes, Information and Computation 64, 1,3, pp. 136–176, 1985.Google Scholar
  36. [DeN87]
    R. De Nicola, Extensional Equivalences for Transition Systems, Acta Informatica, Springer Verlag, Barlin 24, Springer Verlag, pp 211–237, 1987.Google Scholar
  37. [Dev88]
    R. Devillers, On the Definition of a Bisimulation Notion Based on Partial Words, Petri Net Newsletter 29, pp. 16–19, April 1988.Google Scholar
  38. [Dev 90]
    R. Devillers, Maximality Preserving Bisimulation, Université Libre de Bruxelles, LIT-214, March 1990 (to appear in TCS).Google Scholar
  39. [DH84]
    R. De Nicola, M. Hennessy, Testing Equivalences for Processes, Theoretical Computer Science, North Holland, Amsterdam 34, pp. 83–134, 1984.Google Scholar
  40. [DK83]
    P. Darondeau, L. Kott, On the Observational Semantics of Fair Parallelism, Lecture Notes in Computer Science, Springer Verlag, Berlin 154, pp. 147–159, 1983.Google Scholar
  41. [DM90]
    J. Desel, A. Merceron, Vicinity Respecting Morphisms, in G. Rozenberg (ed.) Advances in Petri Nets, Springer Verlag, Berlin'90, Lecture Notes in Computer Science, Springer Verlag, Berlin 483, pp. 165–185, 1991.Google Scholar
  42. [DP83]
    G. De Michelis, L. Pomello, A Less Restrictive Observational Equivalence Notion, Proc.IV Workshop on Application ad Theory of Petri Nets, Toulose, pp. 364–381, 1983.Google Scholar
  43. [ER90a]
    A. Ehrenfeucht, G. Rozenberg, Partial (Set) 2-Structures — Part I: Basic Notion and the Representation Problem, Acta Informatica, Springer Verlag, Berlin, vol. 26, pp. 315–342, 1990.Google Scholar
  44. [ER90b]
    A. Ehrenfeucht, G. Rozenberg, Partial (Set) 2-Structures-Part II: State Spaces of Concurrent Systems, Acta Informatica, Springer Verlag, Barlin, vol. 26, pp. 343–368, 1990.Google Scholar
  45. [GG89]
    R. van Glabbeek, U. Goltz, Equivalence Notions for Concurrent Systems and Refinement of Actions, in A. Kreczmar and G. Mirkowska (eds.), “Mathematical Foundations of Computer Science 1989”, Lecture Notes in Computer Science, Springer Verlag, Berlin 379, pp. 237–248, 1989.Google Scholar
  46. [GG90a]
    R. van Glabbeek, U. Goltz, Refinement of Actions in Causality based Models, in J.W. de Bakker, W. P. de Roever, G. Rozenberg (eds.), “Stepwise Refinement of Distributed Systems: models, formalism, correctness”, Lecture Notes in Computer Science, Springer Verlag, Berlin 430, pp. 267–300, 1990.Google Scholar
  47. [GG90b]
    R. van Glabbeek, U. Goltz, Equivalence Notions and Refinement of Actions for Flow Event Structures, DEMON Esprit BRA 3148 Deliverables, June 1990.Google Scholar
  48. [Gla90a]
    R. van Glabbeek, Comparative Concurrency Semantics and Refinement of Actions, PhD. Thesis, Centrum voor Wiskunde en Informatica, Amsterdam, 1990.Google Scholar
  49. [Gla90b]
    R. van Glabbeek, The Linear Time — Branching Time Spectrum, in J.C.M. Baeten and J.W. Klop (eds) CONCUR'90, Lecture Notes in Computer Science, Springer Verlag, Berlin 458, pp. 278–297, 1990.Google Scholar
  50. [Gra81]
    J. Grabowski. On Partial languages, Fundamenta Informaticae, Vol. IV.2, North Holland, Amsterdam, pp. 428–498, 1981.Google Scholar
  51. [GS80]
    H.J. Genrich, E. Stankiewicz-Wiechno, A Dictionary of Some Basic Notations of Net Theory, in W. Brauer (ed.), “Net Theory and Applications”, Lecture Notes in Computer Science, Springer Verlag, Berlin 84, pp. 519–535, 1980.Google Scholar
  52. [GV87]
    R. van Glabbeek, F. Vandraager, Petri Net Models for Algebraic Theories of Concurrency, in J.W. de Bakker, A.J. Nijman, P.C. Treleaven (eds.), “Parallel Languages”, Lecture Notes in Computer Science, Springer Verlag, Berlin 259, pp. 224–242, 1987.Google Scholar
  53. [GW89a]
    R. van Glabbeek, W.P. Weijland, Branching Time and Abstraction in Bisimulation Semantics, (extended abstract), in G.X. Ritter (ed.), “Information Processing 89”, North Holland, pp. 613–618, 1989.Google Scholar
  54. [GW89b]
    R. van Glabbeek, W. Weijland, Refinement in Branching Time Semantics, in Proc. of the Int. Conf. on Algebraic Methodology and Software Technology, Iowa City, USA, pp. 197–201, 1989.Google Scholar
  55. [Jan87]
    M. Jantzen, Language Theory of Petri Nets, in [BRR87], pp. 397–412, 1987.Google Scholar
  56. [Hen88]
    M. Hennessy, Algebraic Theory of Processes, The MIT Press, 1988.Google Scholar
  57. [Hoa78]
    C.A.R. Hoare, Communicating Sequential Processes, Communication of the ACM 21, Vol. 8, pp. 666–677, 1978.Google Scholar
  58. [Hoa81]
    C.A.R. Hoare, A Model for Communicating Sequential Processes, Technical Monograph, Prg 22, Comp. Lab., Univ. of Oxford, 1981.Google Scholar
  59. [HM80]
    M. Hennessy, R. Milner, On Observing Non-Determinism and Concurrency, in J.W. de Bakker, J. van Leeuwen (eds.), “Automata Languages and Programming”, Lecture Notes in Computer Science, Springer Verlag, Berlin 85, pp. 299–309, 1980.Google Scholar
  60. [HM85]
    M. Hennessy, R. Milner, Algebraic Laws for Nondeterminism and Concurrency, Journal of ACM 32, pp. 136–161, 1985.Google Scholar
  61. [HO86]
    C.A.R. Hoare, E. R. Olderog Specification-oriented Semantics for Communicating Processes, Acta Informatica, Springer Verlag, Barlin 23, pp. 9–66, 1986.Google Scholar
  62. [HR90]
    H.J. Hoogeboom, G. Rozenberg, Diamond Properties of State Spaces of Elementary Net Systems, Fundamente Informaticae, North Holland, Amsterdam, 1990.Google Scholar
  63. [Kie87]
    A. Kiehn, Infinitary partial Petri net languages and their relationship to other Petri net semantics, TUM Report — I8705, 1987.Google Scholar
  64. [Lar87]
    K. G. Larsen, A Context-Dependent Bisimulation between Processes, Theoretical Computer Science, North Holland, Amsterdam 49, 1987.Google Scholar
  65. [Mar87]
    G. Marcon, TEBE: Tools for Exhibited-Behaviour Equivalence, DSI Technical Report, University of Milano, June1987.Google Scholar
  66. [Maz77]
    A. Mazurkiewicz, Concurrent Program Schemes and Their Interpretation, DAIMIPB-78, Comp. Science Depart., Aarhus University, July 1977.Google Scholar
  67. [Mil80]
    R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, Springer Verlag, Berlin 92, 1980.Google Scholar
  68. [Mil83]
    R. Milner, Calculi for Synchrony and Asynchrony, Theoretical Computer Science, North Holland, Amsterdam 25, pp. 276–310, 1983.Google Scholar
  69. [Mil84]
    R. Milner, A Complete Inference System for a Class of Regular Behaviours, Journal of Computer and System Sciences, Academic Press, San Diego Vol. 28 N. 3, pp. 439–466, 1984.Google Scholar
  70. [Mil89a]
    R. Milner, A complete Axiomatization for Observational Congruence of Finite-State Behaviours, Information and Computation 81, pp. 227–247, 1989.Google Scholar
  71. [Mil89b]
    R. Milner, Communication and Concurrency, Prentice Hall, 1989.Google Scholar
  72. [Mul85]
    K. Mueller, Constructable Petri nets, Elektr. Informationverarbeitung und Kybernetik EIK 21, 4/5, pp. 171–199, 1985.Google Scholar
  73. [NRT90a]
    M. Nielsen, G. Rozenberg, P.S. Thiagarajan, Elementary Transition Systems, Tech. Report, Dept. of Computer Science, University of Leiden, 1990.Google Scholar
  74. [NRT90b]
    M. Nielsen, G. Rozenberg, P.S. Thiagarajan, Elementary Transition Systems and Refinement, Tech. Report, Dept. of Computer Science, University of Leiden, 1990. (to appear in TCS)Google Scholar
  75. [NT84]
    M. Nielsen, P.S. Thiagarajan, Degrees of Non-Determinism and Concurrency: a Petri Net view, in Mathai Josef, Rudrapatna Shyamasundar (eds.),“Foundations of Software Technology and Theoretical Computer Science”, Lecture Notes in Computer Science, Springer Verlag, Berlin 181, pp. 89–117, 1984.Google Scholar
  76. [Par81]
    D. Park, Concurrency and Automata on Infinite Sequences, Proc. 5th GI Conference, in P. Deusseu (ed.), “Theoretical Computer Science”, Lecture Notes in Computer Science, Springer Verlag, Berlin 104, pp. 167–183, 1981.Google Scholar
  77. [Pet73]
    C.A. Petri, Concepts in Net Theory, Mathematical Foundations of Computer Science: Proc. of Symposium and Summer School, High Tatras, sept. 1973, Math. Inst. of the Slovak Acad. of Sciences, pp. 137–146, 1973.Google Scholar
  78. [Pet77a]
    C.A. Petri, General Net Theory, in B. Shaw (ed.), “Computing Systems Design”, Proc. of the Joint IBM — University of Newcastle upon Tyne Seminar, Univ. Newcastle upon Tyne, 1977.Google Scholar
  79. [Pet77b]
    C.A. Petri, Non-sequential Processes, ISF-Bericht ISF-77-5. 1977.Google Scholar
  80. [Pete81]
    J. L. Peterson, Petri Nets Theory and Modelling of Systems, Englewood Cliffs, NJ, Prentice Hall, 1981Google Scholar
  81. [Pnu85]
    A. Pnueli, Linear and Branching Structures in the Semantics and Logics of Reactive Systems, in W. Brauer (ed.), Proc. ICALP 85, Lecture Notes in Computer Science, Springer Verlag, Berlin 194, pp. 15–32, 1985.Google Scholar
  82. [Pom84]
    L. Pomello, Some Equivalence Notions for Concurrent Systems: An Overview, GMD Report Nr.103, (1984); also in G.Rozenberg (ed.), APN'85, LNCS 222, pp. 381–400, 1986.Google Scholar
  83. [Pom87]
    L. Pomello, Observing Net Behaviour, in K. Voss, H.J. Genrich, G. Rozenberg (eds.), “Concurrency and Nets”, Springer Verlag, pp.403–421, 1987Google Scholar
  84. [Pom88]
    L. Pomello, Osservatore, Reti di Petri, Processi, PhD Thesis Univ. of Milano and Torino, 1988.Google Scholar
  85. [Pra86]
    V. Pratt, Modelling Concurrency with Partial Orders, Int. Journal of Parallel Programming Vol. 15 N.1, pp. 33–71, 1986.Google Scholar
  86. [PS90]
    L. Pomello and C. Simone, A State Transformation Preorder over a Class of EN Systems, in G. Rozenberg (ed.) Advances in Petri Nets, Springer Verlag, Berlin'90, Lecture Notes in Computer Science, Springer Verlag, Berlin 483, pp. 436–456, 1991.Google Scholar
  87. [PS91]
    L. Pomello, C. Simone, An algebraic Characterization of EN System (observable) State Space, DSI Technical Report, University of Milano, January 1991 (to appear in Formal Aspects of Computing).Google Scholar
  88. [PW86]
    L. Priese, U. Willecke-Klemmme, On State Equivalence Relations in Nondeterministic or Concurrent Systems, Univ. Paderborn, Reihe Theoretische Informatik, Bericht Nr. 34, December 1986.Google Scholar
  89. [Rei85a]
    W. Reisig, Petri Nets: an Introduction, Springer Verlag, Berlin, 1985.Google Scholar
  90. [Rei85b]
    W. Reisig, On the Semantics of Petri Nets, Formal Models in Programming, IFIP, 1985.Google Scholar
  91. [Roz87]
    G. Rozenberg, Behaviour of Elementary Net Systems, in [BRR87], pp. 60–94, 1987.Google Scholar
  92. [RS87]
    W. Reisig, E. Smith, The Semantics of a Net is a Net-An Exercise in General Net Theory, in K. Voss, H.J. Genrich, G. Rozenberg (eds.), “Concurrency and Nets”, Springer Verlag, pp.461–480, 1987.Google Scholar
  93. [RT88]
    A. Rabinovich, B.A. Trakhtenbrot, Behaviour Structures and Nets, Fundamenta Informaticae, Vol XI, N. 4, pp. 357–404, 1988.Google Scholar
  94. [RT86]
    G. Rozenberg, P.S. Thiagarajan, Petri Nets: basic notions, structure, behaviour, in J.W. de Bakker, W.P. de Rover and G. Rozenberg (eds.), “Current Trends in Concurrency”, Lecture Notes in Computer Science, Springer Verlag, Berlin 224, pp. 585–668, 1986.Google Scholar
  95. [Sal85]
    A. Salomaa, Computation and Automata, Encyclopedia of Mathematics and its Applications Vol. 25, Cambridge Univ. Press, 1985.Google Scholar
  96. [Sta81]
    P.H. Starke, Processes in Petri nets, Journal Inf. Process. Cybern. EIK, 17, pp. 389–416, 1981.Google Scholar
  97. [SM83]
    I. Suzuki, T. Murata, A Method for Stepwise Refinement and Abstraction of Petri Nets, Journal of Computer and System Sciences, Academic Press, San Diego Vol. 27, pp. 51–76, 1983.Google Scholar
  98. [Thi87]
    P.S. Thiagarajan, Elementary Net Systems, in [BRR87], pp. 26–59, 1987.Google Scholar
  99. [TRH88]
    B.A. Trakhtenbrot, A. Rabinovich, J. Hirshfeld, Nets of Processes, Tech/Rep 97/88, Tel Aviv Univ., 1988.Google Scholar
  100. [TV89]
    D. Taubner, W. Vogler, The Step Failure Semantics and Complete Proof System, Acta Informatica, Springer Verlag, Barlin 27, pp. 125–156, 1989.Google Scholar
  101. [Val79]
    R. Valette, Analysis of Petri Nets by Stepwise Refinements, Journal of Computer and System Sciences, Academic Press, San Diego Vol.18, pp. 35–46, 1979.Google Scholar
  102. [Vog87]
    W. Vogler, Behaviour preserving Refinements of Petri Nets, in Proc. 12th Int. Workshop on Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Springer Verlag, Berlin 246, pp. 82–93, 1987.Google Scholar
  103. [Vog89]
    W. Vogler, Failures Semantics and Deadlocking of Modular Petri Nets, Acta Informatica, Springer Verlag, Barlin 26, pp. 333–348, 1989.Google Scholar
  104. [Vog90a]
    W. Vogler, Failures Semantics based on Interval Semiwords is a Congruence for Refinements, in C. Choffrut, T. Lengauer (eds.), Proc. STACS 90, Lecture Notes in Computer Science, Springer Verlag, Berlin 415, pp. 285–297, 1990Google Scholar
  105. [Vog90b]
    W. Vogler, Bisimulation and Action refinement, SFB-Bericht Nr. 342/10/90 A, TUM München, May 1990.Google Scholar
  106. [Vos87]
    K. Voss, Interface as a Basic Concept for Systems Specification and Verification, in K. Voss, H.J. Genrich, G. Rozenberg (eds.), “Concurrency and Nets”, Springer Verlag, pp.585–604, 1987.Google Scholar
  107. [Win80]
    G. Winskel, Events in Computation, Ph.D. Thesis, University of Edinburgh, Great Britain, 1980.Google Scholar
  108. [Win87]
    G. Winskel, Event Structures, Lecture Notes in Computer Science, Springer Verlag, Berlin 235, pp. 325–392, 1987.Google Scholar
  109. [Wink89]
    J. Winkowski, An Equivalence of Communicating Processes in Distributed Environments, Fundamenta Informaticae XII, North Holland, Amsterdam, pp. 97–128, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • L. Pomello
    • 1
  • G. Rozenberg
    • 2
  • C. Simone
    • 1
  1. 1.Dipartimento di Scienze dell'InformazioneUnivesita' di MilanoMilanoItaly
  2. 2.Department of Computer ScienceLeiden UniversityRA LeidenThe Netherlands

Personalised recommendations