Skip to main content
SpringerLink
Log in

Esprit basic research action 3148 DEMON (Design methods based on nets) — Aims, scope and achievements —

  • Conference paper
  • First Online:
Advances in Petri Nets 1992

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 609))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

DEMON literature list

  1. Eike Best, Fiorella De Cindio and Richard Hopkins: DEMON — an ESPRIT Basic Research Action (No.3148). EATCS Bulletin No.41, 87–103 (June 1990).

    Google Scholar 

  2. Eike Best: Design Methods Based on Nets. Advances in Petri Nets 1989 (ed. G.Rozenberg), Springer Lecture Notes in Computer Science Vol.424, 487–506 (1990).

    Google Scholar 

  3. Volker Diekert: Combinatorics on Traces. Habilitation (München 1989), Springer Lecture Notes in Computer Science Vol.454 (1990). (with ASMICS)

    Google Scholar 

  4. Javier Esparza: Structure Theory of Free Choice Petri Nets. Dissertation (Zaragoza, June 90).

    Google Scholar 

  5. Younes Souissi: Property Preservation by Composition of Petri Nets; Extension to FIFO Nets and Application to Communication Protocols. Dissertation (Paris, 1990).

    Google Scholar 

  6. Elisabeth Pelz: Réseaux et Logique. These d'état (Paris, 1990).

    Google Scholar 

  7. Luca Bernardinello and Fiorella De Cindio: A Survey of Basic Net Models and Modular Net Classes. Revised version (1991). This volume.

    Google Scholar 

  8. Wilfried Brauer: Graphs, Automata, Petri Nets. Advanced Information Processing, Springer Verlag (ed. H. Schwärtzel, I. Mizin (1990)).

    Google Scholar 

  9. Einar Smith: On Net Systems Generated by Process Foldings. Draft Paper (June 1990). In: Advances in Petri Nets, Springer LNCS (1991), pp.253–276.

    Google Scholar 

  10. Wilfried Brauer, Robert Gold and Walter Vogler: A Survey of Behaviour and Equivalence Preserving Refinements of Petri Nets. In: Advances in Petri Nets 1990, Springer LNCS Vol.483, 1–46 (1990).

    Google Scholar 

  11. Rob J. van Glabbeek and Ursula Goltz: Refinement of Actions in Causality Based Models. Arbeitspapiere der GMD Nr. 428 (Jan. 1990), in: Proc. of REX Workshop on Stepwise Refinement of Distributed Systems, Springer Lecture Notes in Computer Science (1989), 267–300.

    Google Scholar 

  12. Jörg Desel: On Abstractions of Nets. Report TUM, SFB-Bericht Nr. 342/2/90 B (April 1990). In: Advances in Petri Nets 91, Springer LNCS, pp.78–92.

    Google Scholar 

  13. Walter Vogler: Failures Semantics of Petri Nets and the Refinement of Places and Transitions. Report TUM-I9003 (January 1990), published [27,99].

    Google Scholar 

  14. Robert Gold and Walter Vogler: Quality Criteria for Partial Order Semantics of Place/Transition Systems. Report TUM-I9004, (January 1990), Extended Abstract in: Proc. of MFCS'90 (ed. B.Rovan), LNCS Vol.452, 306–312 (1990).

    Google Scholar 

  15. Elisabeth Pelz: Normalisation of Place/Transition Systems Preserves Net Behaviour. Rapport LRI (1990), to appear in RAIRO.

    Google Scholar 

  16. Elisabeth Pelz: Place/Transition Systems: Concurrent Behaviour and Logic. Rapport LRI No. 571 (1990), in: Journées Mathématiques-Informatiques du CIRM, Marseille, 5.–7-Nov 1990. Modified version accepted at the European Joint Conference on Engineering System Design and Analysis, under the changed title A Problem in System Design: From Behaviour Oriented Specifications to Net Models (June 1991).

    Google Scholar 

  17. Lucia Pomello: Refinement of Concurrent Systems Based on Local State Transformation. Proc. of REX Workshop on Stepwise Refinement of Distr. Systems: Models, Formalism, Correctness, Lecture Notes in Computer Science, Springer Verlag (1989), 641–668.

    Google Scholar 

  18. Lucia Pomello and Carla Simone: Concurrent Systems as Local State Transformation Algebras: the Case of Elementary Net Systems. Proc. of the 3rd Italian Conf. on Th. Comp. Sci, Nov. 89 (eds. A. Bertoni, C. Böhm, P. Miglioli).

    Google Scholar 

  19. Lucia Pomello and Carla Simone: A Preorder of Concurrent Systems. DEMON Deliverable (1990).

    Google Scholar 

  20. Lucia Pomello and Carla Simone: A State Transformation Preorder over a Class of EN Systems. In: Advances in Petri Nets (1990), pp.436–454.

    Google Scholar 

  21. Giorgio De Michelis: Domains of EN Systems. 2nd Workshop on Concurrency and Compositionality, San Miniato (Feb./March 1990), Ext. Abstr.

    Google Scholar 

  22. Eike Best, Raymond Devillers, Astrid Kiehn and Lucia Pomello: Fully Concurrent Bisimulation. Technical Report LIT-202, Univ. Bruxelles (July 1989). Appeared in Acta Informatica Vol.28 with the changed title: Concurrent Bisimulation in Petri Nets, 231–264 (1991). (with CEDISYS)

    Google Scholar 

  23. Raymond Devillers: Maximality Preserving Bisimulation. Technical Report LIT-214, ULB (March 90), to appear in TCS.

    Google Scholar 

  24. H. J. Hoogeboom and G. Rozenberg: Diamond Properties of State Spaces of Elementary Net Systems. Report 89-18, Univ. of Leiden (December 1989). Fundamenta Informaticae XIV, 287–300 (1991).

    Google Scholar 

  25. Mogens Nielsen, Grzegorz Rozenberg and P. S. Thiagarajan: Behavioural Notions for Elementary Net Systems. Distributed Computing 4: 45–57 (90). (with CEDISYS)

    Google Scholar 

  26. Mogens Nielsen, Grzegorz Rozenberg and P. S. Thiagarajan: Elementary Transition Systems. Technical Report, Univ. Leiden 90-13 (May 1990), to appear in TCS (Proc. of San Miniato) (1992). (with CEDISYS)

    Google Scholar 

  27. W. Vogler: Failures Semantics Based on Interval Semiwords is a Congruence for Refinement. Extended abstract in Proc. of STACS'90, Springer LNCS Vol.415, 285–297 (1990). Full paper in Distributed Computing 4: 139–162 (1991).

    Google Scholar 

  28. J. M. Colom and M. Silva: Convex Geometry and Semiflows in P/T-Nets. In: Advances in Petri Nets (1990), pp.79–112.

    Google Scholar 

  29. J. M. Colom and M. Silva: Improving the Linearly Based Characterisation of P/T-Nets. In: Advances in Petri Nets (1990), pp.113–145.

    Google Scholar 

  30. J. M. Couvreur and J. Martínez: Linear Invariants in Commutative High Level Nets. In: Advances in Petri Nets (1990), pp.146–164.

    Google Scholar 

  31. J. Esparza and M. Silva: Circuits, Handles, Bridges and Nets. In: Advances in Petri Nets (1990), pp.210–242.

    Google Scholar 

  32. Eike Best and Jörg Desel: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing Vol. 2(2), 123–138 (1990).

    Google Scholar 

  33. Ryszard Janicki and Maciej Koutny: Net Implementation of Optimal Simulation. Proc. of 11th PN Conference, 295–314, Paris (1990). Also TR 90-08, Dept. of Computer Science and Systems, McMaster University (1990). Also in Advances in Petri Nets (1991) with the changed title: Optimal Simulations, Nets and Reachability Graphs, pp.205–226.

    Google Scholar 

  34. Ryszard Janicki and Maciej Koutny: Optimal Simulation for the Verification of Concurrent Systems. Technical Report 89-05, McMaster (1989), submitted.

    Google Scholar 

  35. Younes Souissi: Deterministic Systems of Sequential Processes. Proc. of 11th PN Conference, Paris (1990).

    Google Scholar 

  36. Alain Finkel and Laure Petrucci: Propriétés de la composition/decomposition de réseaux de Petri et leurs graphes de couvertures. Rapport de recherches, MASI 90 — 24 (May 90), Submitted paper. English version: Verification of Net Properties by Composition / Decomposition. Rapport de Recherche CEDRIC No.91-06 (1991).

    Google Scholar 

  37. Laure Petrucci: Comparing Finkel's and Jensen's Reduction Techniques to Build Covering Trees for Coloured Nets. Petri Net Newsletter 36 (August 1990). Also: Research Report CEDRIC with the title: Smaller Covering Trees for Coloured Nets and Semi-covering Trees for Algebraic Nets (January 1991).

    Google Scholar 

  38. Gérard Berthelot, Alain Finkel, Colette Johnen and Laure Petrucci: A Generic Example for Testing Performance of Reachability and Covering Graph Construction Algorithms. PN Newsletter 35 (April 1990).

    Google Scholar 

  39. Jörg Desel: Reduction and Design of Well-Behaved Concurrent Systems. Proc. of CONCUR'90, Springer Lecture Notes in Computer Science Vol. 458, 166–181 (1990).

    Google Scholar 

  40. J. M. Colom and M. Silva: On Liveness Analysis Through Linear Algebraic Techniques. Draft Paper (1990).

    Google Scholar 

  41. J. Esparza and M. Silva: On the Analysis and Synthesis of Free Choice Systems. In: Advances of Petri Nets'90, Springer LNCS (1990), pp.243–286.

    Google Scholar 

  42. J. Esparza, E. Best and M. Silva: Minimal Deadlocks in Free Choice Nets. Hildesheimer Informatik-Berichte 1/89 (June 1989).

    Google Scholar 

  43. J. Esparza and M. Silva: Compositional Synthesis of Live and Bounded Free Choice Nets. Report GISI 90.06, Univ. of Zaragoza (March 1990). To appear in Proc. of CONCUR'91, Springer LNCS (August 1991).

    Google Scholar 

  44. J. Esparza and M. Silva: Top-Down Synthesis of Free Choice Nets. 11th Petri Net Conference, Paris (June 1990), also in: Advances in Petri Nets 1991, Springer LNCS (1991), pp.118–139. An extended and revised version of this paper is [197].

    Google Scholar 

  45. J. Esparza and M. Silva: A Polynomial-time Algorithm to Decide Liveness of Bounded Free Choice Nets. Hildesheimer Informatik-Berichte 12/90 (December 1990). To appear in TCS (1992).

    Google Scholar 

  46. J. Esparza: Synthesis Rules for Petri Nets, and How they Lead to New Results. Proc. of CONCUR'90, Springer LNCS Vol.458, 182–198 (1990).

    Google Scholar 

  47. Eike Best, Ludmila Cherkasova, Jörg Desel and Javier Esparza: Characterisation of Home States in Free Choice Nets. Hildesheimer Informatik-Berichte Nr. 9 (September 90), Ext. Abstr. in Semantics of Concurrency, Springer Workshops in Computer Science Series (eds. M.Z.Kwiatkowska, M.W.Shields and R.Thomas), 16–20 (1990). Published in [96] and [97].

    Google Scholar 

  48. Ursula Goltz: CCS and Petri Nets. Proc. of the Spring School on Semantics of Concurrency, Springer Lecture Notes in Computer Science Vol.469 (ed. I. Guessarien), 334–357 (1990).

    Google Scholar 

  49. Rob J. van Glabbeek and Ursula Goltz: A Deadlock-sensitive Congruence for Action Refinement. SFB-Bericht Nr.342/23/90A, Technische Universität München (1990). Also: Invited contribution to the 3rd Workshop on Concurrency and Compositionality, Goslar, March 5–8 (1991). Extended abstract in [160].

    Google Scholar 

  50. R. Janicki and M. Koutny: On some Implementations of Optimal Simulation. TR 90-07, Dept. of Computer Science and Systems, McMaster Univ. (1990). To appear in Proc. of Computer-Aided Verification Workshop, Rutgers Univ. (June 1990) (ed. R.Kurshan). A short version of this paper will appear in the Abridged Proceedings of CAV with the changed title: Using Optimal Simulations to Reduce Reachability Graphs (also: TR 90-13, McMaster (1990)).

    Google Scholar 

  51. N. W. Keesmaat and H. C. M. Kleijn: Net-Based Control vs. Rational Control in Vector Controlled Concurrent Systems. TR 89–21, Univ. Leiden (December 1989), submitted paper.

    Google Scholar 

  52. Walter Vogler: A Generalisation of Trace Theory. Report TUM I 9018 (April 90), to appear in RAIRO.

    Google Scholar 

  53. Brigitte Rozoy: On Traces, Partial Order Sets and Recognizability. Rapport de Recherche, LRI No. 558 (March 90). Proceedings ISCIS V, Cappadocia (1990). (with ASMICS)

    Google Scholar 

  54. Brigitte Rozoy and P. S. Thiagarajan: Event Structure and Trace Monoids. To appear in TCS. (with ASMICS)

    Google Scholar 

  55. Brigitte Rozoy: On Distributed Languages and Models for Distributed Computation. Rapport de Recherche, LRI 563-90. école de Printemps On the Semantics of Parallelism, Springer LNCS Vol.4669, 434–456 (April 1990). (with ASMICS)

    Google Scholar 

  56. Paul Gastin and Brigitte Rozoy: The Poset of Infinitary Traces. Rapport de Recherche, LRI 559-90. Also: TR LITP 91.07 (1991). Accepted for TCS. (with ASMICS)

    Google Scholar 

  57. Paola Bonizzoni, Giancarlo Mauri and Giovanni Pighizzini: On Infinite Traces. DSI-Internal Report 72/90; also: Proc. Workshop on Partially Commutative Monoids, TUM Report I9002 (January 1990). (With ASMICS.)

    Google Scholar 

  58. Stefania Jesi, Nicoletta Sabadini and Giovanni Pighizzini: Probabilistic Finite State Asynchronous Automata. Proc. Workshop on Partially Commutative Monoids, TUM Report I9002 (January 1990). (With ASMICS.)

    Google Scholar 

  59. Volker Diekert: Combinatorial Rewriting of Traces. Proc. of STACS'90, LNCS Vol. 415, 138–151 (1990). (with ASMICS)

    Google Scholar 

  60. Rolf Walter: Specification of the Distributed Termination Problem. Memorandum of DEMON WG 6 (October 1989).

    Google Scholar 

  61. Dominik Gomm and Rolf Walter: The Distributed Termination Problem: Formal Solution and Correctness Based on Petri Nets. To appear in Proc. IMYCS'90 (Aspects and Prospects of TCS), Springer Lecture Notes in Computer Science Vol.464 (ed. Dassow Kelemen), 159–168 (1990).

    Google Scholar 

  62. Eike Best: Specification of a Flexible Telephone Exchange System. Memorandum of DEMON WG6 (October 89).

    Google Scholar 

  63. Luca Bernardinello and Lucia Pomello: A Petri Net Model of a Flexible Telephone Exchange Network. DEMON Deliverable (June 1990).

    Google Scholar 

  64. Luca Bernardinello, Fiorella De Cindio and Lucia Pomello: The Lift Example (Specification). Memorandum of DEMON WG6 (June 1990).

    Google Scholar 

  65. Javier Martínez and Joaquin Ezpeleta: The Lift Example (Solution). Memorandum of DEMON WG6 (May 1990).

    Google Scholar 

  66. J. M. Colom, J. Esparza, J. Martínez and M. Silva: Specification of a Flexible Manufacturing System. Memorandum of DEMON WG6 (October 1989).

    Google Scholar 

  67. Javier Martiínez and Joaquin Ezpeleta: The Flexible Manufacturing System (Solution). Memorandum of DEMON WG6 (May 1990).

    Google Scholar 

  68. Thomas Belzner: Collected Case Studies. Memorandum of DEMON WG6 (1989).

    Google Scholar 

  69. Jörg Desel, Wofgang Reisig and Rolf Walter: The Alternating Bit Protocol. Petri Net Newsletters 35 (April 1990).

    Google Scholar 

  70. Raymond Devillers: The Bankers Problem. Memorandum of DEMON WG6 (1989).

    Google Scholar 

  71. Wofgang Reisig: Petri Nets and Algebraic Specifications. SFB-Bericht 342/1/90/B (March 90). Theoretical Computer Science Vol. 80, 1–34 (1991)

    Google Scholar 

  72. Wolfgang Reisig: On a Compositional Semantics for Hierarchies in Petri Nets and Statecharts. Ext. Abstract, Proc. of the 2nd Workshop on Concurrency and Compositionality, San Miniato.

    Google Scholar 

  73. Antonia Sinachopoulos: Partial Order Logics for Elementary Net Systems: State and Event Approaches. Proc. of CONCUR'90, Springer LNCS Vol.458, 442–455 (1990).

    Google Scholar 

  74. Antonia Sinachopoulos and Raymond Devillers: Partial Order for Axiomatising Concurrent Systems. Draft paper, submitted.

    Google Scholar 

  75. C. Dimitrovici, U. Hummert and Laure Petrucci: The Properties of Algebraic Net Schemes in some Semantics. Rapport de Recherche, LRI 5 (1990), 11th Petri Net Conference, Paris (1990). Also in Advances in Petri Nets (1991) with the title: Semantics, composition and net properties of algebraic high level nets, pp93–117.

    Google Scholar 

  76. Eugenio Battiston, Fiorella De Cindio and Giancarlo Mauri: OBJSA Nets: OBJ and Petri Nets for Specifying Concurrent Systems. CNR-Progretto Finalizzato Sistemi Informatici e Calcolo Parallelo, TR 4/51(e) (October 1990). To appear in ‘Case Studies with OBJ’ (ed. D.Coleman, R. Gallimore and J. Goguen), Cambridge University.

    Google Scholar 

  77. Eugenio Battiston: Definitions for OBJSA Nets. Draft paper (May 1990). CNR-Progretto Finalizzato Sistemi Informatici e Calcolo Parallelo, Tech. Rep. i.4.21 (October 1990).

    Google Scholar 

  78. Eike Best: Petri Nets Semantics of occam (some thoughts). Memorandum of DEMON WG8 (November 1989).

    Google Scholar 

  79. Eike Best: Report of WG8 Meeting of December 7/8, 1989. Memorandum of DEMON WG8 (December 1989).

    Google Scholar 

  80. Oliver Botti, Fiorella De Cindio, Jon Hall and Richard Hopkins: A Petri Net Semantics of occam 2. WG8 Technical Report (June 1990). Technical Report, Computing Laboratory, University of Newcastle upon Tyne (1990).

    Google Scholar 

  81. Oliver Botti and Fiorella De Cindio: Some Remarks about a Petri Net Model of occam using Τ-transitions. Technical Report of DEMON WG8 (June 1990).

    Google Scholar 

  82. Eike Best and Maciej Koutny: Partial Order Semantics of Priority Systems. Hildesheimer Informatik-Berichte Nr. 6/90 (June 90), to appear in a special volume of TCS (Proc. of San Miniato) under the title Petri Net Semantics of Priority Systems (1991).

    Google Scholar 

  83. Richard Hopkins and Jon Hall: PN 3-Preliminary Notions for a Petri Net Programming Notation: Generalised Communication. DEMON Technical Report (June 1990/January 1991).

    Google Scholar 

  84. Axel Poigné: Towards a Uniform Presentation of Nets. Arbeitspapiere der GMD Nr.548 (August 1991).

    Google Scholar 

  85. Raymond Devillers: Interrupts and Exceptions: a Short Introduction and some Clarification. DEMON WG9 Memorandum (February 1990).

    Google Scholar 

  86. Richard Hopkins: A Classification of Message Communication in Terms of their Petri Net Representation. TR of DEMON WG9 (June 1990).

    Google Scholar 

  87. Fiorella De Cindio and Carla Simone: Petri Nets for Modelling Fault Tolerant Distributed Systems in a Modular and Incremental Way. Position paper for the 4th ACM SIGOPS European Workshop on Fault Tolerance in Distributed Systems, Bologna (September 1990).

    Google Scholar 

  88. R. Janicki and M. Koutny: Is there Life Beyond Partial Order Semantics? TR 90-06, Dept. of Computer Science and Systems, McMaster Univ. (1989).

    Google Scholar 

  89. Ryszard Janicki and Maciej Koutny: Observing Concurrent Histories. In: Real-Time Systems, Theory and Applications, H.M.S. Zedan (ed.), Elsevier Publishers B.V. (North Holland), 133–142 (1990). Also: TR-89-06, McMaster Univ. (1989).

    Google Scholar 

  90. R. Janicki and M. Koutny: Generalised Invariant Semantics of Concurrent Systems. TR 90-05, McMaster University, Hamilton, Canada (1990).

    Google Scholar 

  91. Ryszard Janicki and Maciej Koutny: A Bottom-Top Approach to Concurrency Theory. Part I: Observations, Invariants and Paradigms. Technical Report 90-04, McMaster University, Hamilton, Canada. A short version will appear in the Proc. of AMAST-91 Conference, Iowa City (1991), with the changed title: Structure of Concurrency.

    Google Scholar 

  92. Richard Hopkins: Distributable Nets. DEMON WG9 Technical Report, also in Advances of Petri Nets 1991, Springer LNCS (1991), pp.161–187.

    Google Scholar 

  93. Richard Hopkins: A Note on Vator Nets. DEMON WG9 Memorandum (June 1990).

    Google Scholar 

  94. Marta Pietkiewicz-Koutny: Modelling Reconfigurability by Petri Nets. Technical Report, Computing Laboratory, University of Newcastle upon Tyne (June 1991).

    Google Scholar 

  95. J.Fanchon, D.Millot: Models for Dynamically Placed Concurrent Processes. Proc. of PARLE-91, Springer LNCS (1991).

    Google Scholar 

  96. Eike Best, Jörg Desel and Javier Esparza: Traps Characterise Home States in Free Choice Systems; to appear in a special volume of TCS (Proc. of Leicester Workshop on Semantics for Concurrency) (1991).

    Google Scholar 

  97. Eike Best, Ludmila Cherkasova and Jörg Desel: Compositional Generation of Home States in Free Choice Systems. Proc. of STACS'91 (eds. G.Choffrut and M.Jantzen), Springer LNCS Vol.480, 398–409 (1991).

    Google Scholar 

  98. Jörg Desel and Javier Esparza: Reachability in Reversible Free Choice Systems. SFB-Bericht Nr. 342/11/90 A, TUM; Shortened version in: Proc. of STACS'91 (eds. G.Choffrut and M.Jantzen), Springer LNCS Vol.480, 384–397 (1991). Extended abstract in [160].

    Google Scholar 

  99. Walter Vogler: Bisimulation and Action Refinement. Proc. of STACS'91, Springer LNCS Vol.480 (eds. C.Choffrut, M.Jantzen), 309–321 (1991). Extended abstract in [160].

    Google Scholar 

  100. Volker Diekert: On the Concatenation of Infinite Traces. In Proc. of STACS'91 (eds. G.Choffrut, M.Jantzen), Springer LNCS Vol.480, 105–117 (1991). (with ASMICS)

    Google Scholar 

  101. F.Baude and G.Vidal-Naquet: Actors as a Parallel Programming Model. In Proc. of STACS'91 (eds. G.Choffrut, M.Jantzen), Springer LNCS Vol.480, 184–195 (1991).

    Google Scholar 

  102. G.Vidal-Naquet and Y.Sami: Formalisation of the Behaviour of Actors by Coloured Petri Nets, and some Applications. LRI Report 605 10/90 (1990). To appear in PARLE'91.

    Google Scholar 

  103. R.J.van Glabbeek and U.Goltz: Equivalences and Refinement. SFB-Bericht 342/12/90 A, TUM (1990); Proc. of the Spring School on Semantics of Concurrency, Springer Lecture Notes in Computer Science Vol.469 (ed. I. Guessarien), 309–333 (1990).

    Google Scholar 

  104. Y.Souissi: A Modular Approach for the Validation of Communication Protocols Using FIFO Nets. Proc. of Xth Int. Symp. on Protocol Specification, Verification and Testing (June 1990).

    Google Scholar 

  105. Nicholas Guelfi: Classes de Réseaux Structurées: études, Utilisation et Modifications. Paris-Orsay (September 1990).

    Google Scholar 

  106. Laure Petrucci: Techniques d'Analyse des Réseaux de Petri Algébraiques. Thèse, Paris-Orsay (January 1991).

    Google Scholar 

  107. Javier Campos: Performance Bounds for Synchronised Queueing Networks. PhD Thesis, Zaragoza (December 1990).

    Google Scholar 

  108. Javier Campos, José Maria Colom and Manuel Silva: Improving Throughput Upper Bounds for Net Based Models of Manufacturing Systems. In: Proc. of IMACS Symposium of Modelling and Control of Technological Systems, Lille (May 1991).

    Google Scholar 

  109. Eike Best: Partial Order Semantics of Concurrent Programs. Invited Address at CONCUR'90. Abstract in Proc. of CONCUR'90, Springer LNCS Vol.458, p.1 (1990).

    Google Scholar 

  110. Oliver Botti: Un modello in reti di Petri per occam-2. (A Petri Net Model for occam-2.) Tesi di Laurea in Computer Science, Dip. Scienze dell'Informazione, Univ. degli Studi di Milano (A.A. 1989/90). (In Italian.)

    Google Scholar 

  111. Eike Best: Structure and Behaviour of Concurrent Systems: Selected Results of the Esprit Basic Research Action DEMON. Proc. of the Esprit Conference 1990, Kluwer Publications, 791–803.

    Google Scholar 

  112. Holger Schirnick: Implementation of a Flexible Telephone Exchange Systems on a Network of SUN Workstations. Thesis, Hildesheim (February 1991).

    Google Scholar 

  113. Manfred Broy and Thomas Streicher: Modular Functional Modelling of Petri Nets with Individual Tokens. This volume.

    Google Scholar 

  114. M.Nielsen, G.Rozenberg and P.S.Thiagarajan: Elementary Transition Systems and Refinements. TR 91-04, Univ. of Leiden (1991). (with CEDISYS)

    Google Scholar 

  115. A. Ehrenfeucht and G. Rozenberg: A Characterisation of Set Representable Labelled Partial 2-Structures through Decompositions. Acta Informatica 28, 83–94 (1990).

    Google Scholar 

  116. A.Ehrenfeucht, H.J.Hoogeboom and G.Rozenberg: Combinatorial Properties of Dependency Graphs. TR 91–11, Univ. of Leiden (1991).

    Google Scholar 

  117. N.W.Keesmaat and H.C.M.Kleijn: The Effect of Vector Synchronisation: Residue and Loss. This volume.

    Google Scholar 

  118. L.Bernardinello, L.Pomello and C.Simone: Categories of EN Systems and Local State Transformation Algebras. In: [160].

    Google Scholar 

  119. W.Reisig: The Asynchronous Stack Revisited. Petri Net Newsletters 36 (August 1990).

    Google Scholar 

  120. Walter Vogler: Partial Words Versus Processes: a Short Comparison. This volume.

    Google Scholar 

  121. W.Vogler: Deciding History Preserving Bisimulation. To appear in: Proc. of ICALP 1991, Springer LNCS (1990).

    Google Scholar 

  122. J.Fanchon: Fifo-net Models for Processes with Asynchronous Communication. Proc. of 12th Int. Conf. on Applications and Theory of Petri Nets, århus (June 1991) and this volume.

    Google Scholar 

  123. J.Campos, G.Chiola and M.Silva: Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector. IEEE Transactions on Software Engineering Vol.17 No.2 (February 1991).

    Google Scholar 

  124. A.Sinachopoulos: The Expressive Power of Partial Order Logics for Elementary Net Systems. TR LIT-26, Lab. d'Informatique Théorique, Univ. Libre de Bruxelles. Presented at CSL'90 (Heidelberg).

    Google Scholar 

  125. L.Pomello and C.Simone: A Survey of Equivalence. Notions for Net Based Systems. To appear in Advances in Petri Nets (1991).

    Google Scholar 

  126. E.Battiston: Una Specifica del Sistema Ascensore con le Reti OBJSA (A Specification of the Lift System Using OBJSA Nets). CNR-Progretto Finalizzato Sistemi Informatici e Calcolo Parallelo, Tech.Rep. N.4/21 (October 1990). (In Italian.)

    Google Scholar 

  127. E.Battiston, F.De Cindio, G.Mauri and L.Rapanotti: Morphisms and Minimal Models for OBJSA Net Systems. CNR-Progretto Finalizzato Sistemi Informatici e Calcolo Parallelo, Tech.Rep. i.4.26 (January 1991). Shorter version in Proc. of 12th Int. Conf. on Applications and Theory of Petri Nets, Gjern (June 1991).

    Google Scholar 

  128. A.Finkel and L.Petrucci: Avoiding State Explosion by Composition of Minimal Covering Graphs. Rapport de Recherche CEDRIC 91-09 (1991). In: Proc. of CAV, Aalborg (June 1991).

    Google Scholar 

  129. V.Diekert, P.Gastin and A.Petit: Recognizable Complex Trace Languages. Rapport de Recherche No.640, LRI (Feb. 1991). To appear in: Proc. 16th Symposium on Mathematical Foundations of Computer Science, Warszawa, Springer LNCS (1991). (with ASMICS)

    Google Scholar 

  130. Javier Campos and José Maria Colom: A Reachable Throughput Upper Bound for Live and Safe Free Choice Nets. Proc. of 12th Int. Conf. on Applications and Theory of Petri Nets. århus (June 1991).

    Google Scholar 

  131. P.Gastin, A.Petit and W.Zielonka: A Kleene Theorem for Infinite Trace Languages. Report LITP 90.93 (Nov. 1990). To appear in Proc. of ICALP'91, Springer LNCS (1991). (with ASMICS)

    Google Scholar 

  132. Brigitte Rozoy: Distributed Languages, a Context Dependent Extension of Traces. In: [160]. (with ASMICS)

    Google Scholar 

  133. P.Gastin: Infinite Traces. Report LITP 90.68 (Sep. 1990). Ecole de Printemps On the Semantics of Parallelism, Springer LNCS No.469, 277–308 (April 1990). (with ASMICS)

    Google Scholar 

  134. Manfred Broy: Formal Modelling of Networks of Time Sensitive Interactive Systems. To appear in: Computer Networks 91 (June 1991), University of Wroclaw.

    Google Scholar 

  135. R.Janicki and M.Koutny: Invariant Semantics of Nets with Inhibitor Arcs. To appear in Proc. of CONCUR'91, Springer LNCS (August 1991).

    Google Scholar 

  136. W.Vogler: Is Partial Order Semantics Necessary for Action Refinement? Report TUM I9101 SFB 342/1/91/A (January 1991).

    Google Scholar 

  137. M.Koutny: Modelling Systems with Dynamic Priorities. Draft paper (April 1991). This volume.

    Google Scholar 

  138. R.Janicki and M.Koutny: Invariants and Paradigms of Concurrency Theory. TR 91-10, McMaster (1991). Proceedings of PARLE'91, Lecture Notes in Computer Science 506, Springer, 59–74, 1991. Also to appear in a special issue of the journal: Future Generation Computer Systems.

    Google Scholar 

  139. C.Diamantini, S.Kasangian, L.Pomello and C.Simone: Elementary Nets and 2-Categories. CNR-Progretto Finalizzato Sistemi Informatici e Calcolo Parallelo, TR 4.29(I) (March 1991). Extended abstract in [160].

    Google Scholar 

  140. L.Pomello and C.Simone: An Algebraic Characterisation of EN System (Observable) State Space. CNR-Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo, TR 4.30(I) (March 1991); to appear in: Formal Aspects of Computing

    Google Scholar 

  141. Didier Buchs and Nicolas Guelfi: CO-OPN: A Concurrent Object Oriented Petri Net Approach. 12th Int. Conf. on Application and Theory of Petri Nets, århus (June 1991).

    Google Scholar 

  142. Colette Johnen and Laure Petrucci: Computation of P-invariants for Integer Nets: Application to the Analysis of Algebraic Nets. Rapport de Recherche CEDRIC No. 91-07 (January 1991).

    Google Scholar 

  143. Alain Finkel and Laure Petrucci: Verification of Net Properties by Composition / Decomposition. Research Report CEDRIC (January 1991).

    Google Scholar 

  144. Hans-Günther Linde: Free Choice Simulation of Petri Nets. Hildesheimer Informatik-Berichte Nr. 4/91 (March 1991). In: Proc. of the Fourth Int. Workshop on Petri Nets and Performance Models, Melbourne (3–5 December 1991), IEEE Computer Society, pp. 236–247.

    Google Scholar 

  145. Maciej Koutny: Linear Combination of Places. DEMON Memorandum (February 1991).

    Google Scholar 

  146. Thierry Massart and Raymond Devillers: Equality of Agents Resists to an Extension of the Universe of Actions. Technical Report LIT-232, Univ. Libre de Bruxelles (March 1991).

    Google Scholar 

  147. Thierry Massart and Raymond Devillers: Agents or Expressions: which Semantics for a Process Calculus? Technical Report LIT-230, Univ. Libre de Bruxelles (March 1991).

    Google Scholar 

  148. Javier Campos, Giovanni Chiola, José Maria Colom and Manuel Silva: Properties and Performance Bounds for Timed Marked Graphs. Research Report GISI-RR-90-17 (July 1990). Submitted paper.

    Google Scholar 

  149. Javier Campos, Giovanni Chiola and Manuel Silva: Properties and Performance Bounds for Closed Free Choice Synchronised Monoclass Queueing Networks. To appear in IEEE Transactions on Automatic Control (Special Issue on Multidimensional Queueing Systems) (1991).

    Google Scholar 

  150. Javier Campos, Beatriz Sánchez and Manuel Silva: Throughput Lower Bounds for Markovian Petri Nets: Transformation Techniques. In: Proc. of the Fourth Int. Workshop on Petri Nets and Performance Models, Melbourne (3–5 December 1991), IEEE Computer Society, pp. 322–333.

    Google Scholar 

  151. Javier Campos and Manuel Silva: Throughput Upper Bounds for Markovian Petri Nets: Embedded Subnets and Queueing Networks. In: Proc. of the Fourth Int. Workshop on Petri Nets and Performance Models, Melbourne (3–5 December 1991), IEEE Computer Society, pp. 312–321.

    Google Scholar 

  152. Ghassan Chehaibar: Replacement of Open Interface Subnets and Stable State Transformation Equivalence. Proc. of 12th Int. Conf. on Applications and Theory of Petri Nets, århus (June 1991).

    Google Scholar 

  153. Ghassan Chehaibar: Use of Reentrant Nets in Modular Analysis of Coloured Nets. In Advances in Petri Nets (1991), pp.58–77, and in High Level Petri Nets-Theory and Application (eds. K.Jensen and G.Rozenberg).

    Google Scholar 

  154. Raymond Devillers: Maximality Preserving Bisimulation: Simplifications and Extensions. Technical Report LIT-231 (February / May 1991). Abstract in [160].

    Google Scholar 

  155. Didier Buchs and Nicolas Guelfi: A Semantic Description of Actor Languages by Structured Algebraic Petri Nets. LRI Rapport de Recherche No.639 (February 1991). Accepted as extended abstract to 14th ICSE, Melbourne, 1992

    Google Scholar 

  156. Didier Buchs, Nicolas Guelfi and Fabrice Mourlin: Semantic Description of the occam-2 Language: CO-OPN and PN2, two Approaches. Draft (May 1991).

    Google Scholar 

  157. Maciej Koutny, Luigi V. Mancici and Giuseppe Pappalardo: Formalising Replicated Distributed Processing. Proceedings of the 10th Symposium on Reliable Distributed Systems, Pisa, 108–117 (1991).

    Google Scholar 

  158. Oliver Botti and Fiorella de Cindio: From Basic to Timed Models of occam: an Application to Program Placement. (May 1991). In: Proc. of the Fourth Int. Workshop on Petri Nets and Performance Models, Melbourne (3–5 December 1991), IEEE Computer Society, pp. 216–223.

    Google Scholar 

  159. Eike Best: The Petri Box Calculus for Concurrent Programs. In: [160].

    Google Scholar 

  160. Eike Best and Grzegorz Rozenberg (editors): Proceedings of the 3rd Workshop on Concurrency and Compositionality, jointly organised by DEMON and CEDISYS, Goslar, March 5–8, 1991; GMD-Studien Nr.191 and Hildesheimer Informatik-Bericht Nr. 6/91 (May 1991).

    Google Scholar 

  161. Mogens Nielsen, Grzegorz Rozenberg, P.S. Thiagarajan: Transition Systems, Event Structures and Unfoldings. Extended Abstract in [160].

    Google Scholar 

  162. A. Ehrenfeucht, H.J. Hoogeboom, Grzegorz Rozenberg: On the Structure of Consistent Regular Languages of Dependency Graphs.

    Google Scholar 

  163. P.S. Thiagarajan, H.C.M. Kleijn, P. Hoogers: A Trace Semantics for Petri Nets.

    Google Scholar 

  164. Ryszard Janicki, Maciej Koutny: Relational Structure Semantics of Concurrent Systems. Proceedings of the 13th IMACS Congress on Computation and Applied Mathematics, 709–713, Dublin (1991).

    Google Scholar 

  165. E.Best and J.Hall: The Box Calculus: A New Causal Algebra with Multilabel Communication. This volume.

    Google Scholar 

  166. J. Ezpeleta, J.M. Couvreur: A New Technique for Finding a Generating Family of Siphons, Traps and ST-components. Application to Colored Petri Nets. Proc. of 12th Conf. on Application and Theory of Petri Nets, århus (1991).

    Google Scholar 

  167. E.Best, J.Esparza and M.Koutny: Operational Semantics for the Box Algebra. Draft paper (October 1991).

    Google Scholar 

  168. J. Ezpeleta, J. Martinez: Petri Nets as a Specification Language for Manufacturing Systems. To appear in Proc. of 13th IMACS World Congress on Computation and Applied Mathematics, Dublin (July 1991).

    Google Scholar 

  169. Manuel Silva, J.M. Colom, J. Campos: Linear Algebraic Techniques for the Analysis of Petri Nets. To appear in int. Symposium on the Mathematical Theory of Networks and Systems, Kobe (June 1991).

    Google Scholar 

  170. Antonia Sinachopoulos: A Completeness Proof and Decidability for Pre Order Logics. TR LIT-227, Univ. Libre de Bruxelles (1991), submited.

    Google Scholar 

  171. Antonia Sinachopoulos: Linear and Partial Order Temporal Logics and Refinement of Actions. Draft (June 1991).

    Google Scholar 

  172. Michael Leuschel: Concurrent Transition Systems (CTS) — True Concurrency for Labelled Transition Systems. TR LIT-233, Univ. Libre de Bruxelles.

    Google Scholar 

  173. Michael Leuschel: Language and Refinement. Univ. Libre de Bruxeles (1990).

    Google Scholar 

  174. TH. Massart: A Basic Agent Caclulus and Bisimulation Laws for the Design of Systems. Univ. Libre de Bruxelles.

    Google Scholar 

  175. J.Hall: General Recursion. Draft paper, Univ. of Newcastle upon Tyne (June 1991/January 1992).

    Google Scholar 

  176. J.Esparza: Fixpoint Semantics of Recursion in the Box Algebra. DEMON Memorandum (December 1991).

    Google Scholar 

  177. Thierry Massart: An Agent Calculus with Simple Actions where the Enabling and Disabling are Derived Operators. Information Processing Letters 40 (1991), pp 213–218

    Google Scholar 

  178. Thierry Massart: A Basic Agent Calculus for the LOTOS Specification Language. Draft paper.

    Google Scholar 

  179. Didier Buchs, Nicolas Guelfi: Open Distributed Programming using the Object Oriented Specification Formalism CO-OPN. LRI rapport no.700 (1991), submitted.

    Google Scholar 

  180. Didier Buchs, Nicolas Guelfi: System Specification using CO-OPN. DEMON Report, LRI (May 1991). Will appear as: System Specification using CO-OPN, 3rd IEEE Int. Workshop on Future Trends in Distributed Computing, Taipei (1992).

    Google Scholar 

  181. Colette Johnen, Fabrice Mourlin: Analysis of the Communication Structure of 0CCAM2 Programs using Petri Nets. Rapport de Recherche No.643, LRI (1991).

    Google Scholar 

  182. Giorgio De Michelis: Constraints and Extensions in a Calculus of EN Systems. Proc. of 12th Conf. on Applications and Theory of Petri Nets, Gjern (1991).

    Google Scholar 

  183. Giorgio De Michelis: Morphisms and Refinements for EN Systems. DEMON Report, DSI (May 1991).

    Google Scholar 

  184. Gianni Degli Antoni: Communicating Petri Nets. DEMON Report, DSI (April 1991).

    Google Scholar 

  185. Eugenio Battiston, Laure Petrucci, Lucia Rapanotti: Establishing a Relationship between OBJSA Nets and Algebraic Nets Schemes. DEMON Technical Report, DSI/LRI (May 1991).

    Google Scholar 

  186. L. Bernardinello, G. Nifosí, N. Sabadini: A Comparison between Asynchronous Automata and Superposed Automata Net Systems. Presented at the general ASMICS meeting (February 1991) (revised May 1991). (with ASMICS)

    Google Scholar 

  187. P. Bonizzoni, G. Mauri, G. Pighizzini, N. Sabadini: Recognizing Sets of Labelled Acyclic Graphs. Technical Report, DSI (November 1990)

    Google Scholar 

  188. Carla Simone, M. Ajmone Marsan, P. Donzelli: The Application of EB-Equivalence Rules to the Structural Reduction of GSPN Models. Technical Report, DSI (revised version, October 1991), submitted.

    Google Scholar 

  189. Gabriella Nifosí: Automi Asincroni e Reti di Automi Sovrapposti. (Asynchronous Automata and Superposed Automata Nets). DSI (1990/91) (in Italian).

    Google Scholar 

  190. Lucia Rapanotti: Una caratterizzazione semantica delle reti OBJSA. (A Semantical Characterization of OBJSA Nets). DSI (1990/91) (in Italian).

    Google Scholar 

  191. Claudia Diamantini: Approcci categoriali alle reti di Petri: i sistemi EN come bicategorie. (Categorial Approaches to Petri Nets: EN Systems as Bicategories). DSI (1990/91) (in Italian).

    Google Scholar 

  192. David Bramini: Specifica e implementazione prototipale di una interfaccia utente per il linguaggio delle reti OBJSA. (Specification and Prototypal Implementation of a User Interface for OBJSA Nets Language). DSI (1990/91) (in Italian).

    Google Scholar 

  193. S. Kasangian, G. Mauri, N. Sabadini: Traces and Pomsets: a Categorical View. Technical Report, DSI, revised version (February 1992).

    Google Scholar 

  194. J.Esparza: Model Checking of Persistent Petri Nets Using Partial Orders. Draft Paper (January 1992).

    Google Scholar 

  195. E.Best and J.Esparza: Model Checking of Persistent Petri Nets. Hildesheimer Informatikbericht (September 1991); preliminary version in the Proceedings of the Båstad Workshop (May 1991); presented at Computer Science Logic'91 (Bern, October 1991).

    Google Scholar 

  196. R.Hopkins: A (prioritised) Petri Box Algebra and its Use for a Triple Modular Redundancy Case Study. Draft paper (June 1991); submitted.

    Google Scholar 

  197. J.Esparza: Reduction and Synthesis of Live and Bounded Free Choice Petri Nets. Hildesheimer Informatik-Berichte Nr. 7/91 (June 1991).

    Google Scholar 

  198. E.Best and J.Esparza (eds.): Second Progress Report of the Esprit Basic Research Action 3148 DEMON. GMD-Studien Nr.198 (September 1991).

    Google Scholar 

  199. E. Best: Overview of the Results of the Esprit Basic Research Action DEMON — Design Methods Based on Nets. In: Proc. of the Fourth Int. Workshop on Petri Nets and Performance Models, Melbourne (3–5 December 1991), IEEE Computer Society, pp. 224–235. Also in the Bulletin of the EATCS No.45 (October 1991), pp.39–58.

    Google Scholar 

  200. J.Desel: The Rank Theorem for Extended Free Choice Nets. Draft paper (January 1992).

    Google Scholar 

  201. E.Battiston, F.De Cindio, L.Petrucci and L.P.Rapanotti: OBJSA Nets and their Relationship with other Classes of Algebraic High Level Nets. CNR, Progretto Finalizzato 'sistemi Informatici e Calcolo Parallelo', TR i/4/ (November 1991).

    Google Scholar 

  202. Carla Simone: Net System Morphisms and Observability in System Design. Proceeding of ISCAS 1991, Singapore (June 1990).

    Google Scholar 

  203. Oliver Botti and Fiorella De Cindio: Comparison of occam Program Placements by a Generalized Stochastic Petri Net Model. Proceedings TRANSPUTERS 92, Paris, May 92 (to appear).

    Google Scholar 

  204. Aldo Restelli: Categorie Ordinate di Sistemi Concorrenti. (Ordered Categories of Concurrent Systems.) Tesi di Laurea in Computer Science, Dip. Scienze dell'Informazione, Univ. degli Studi di Milano (A.A. 1990/91). (In Italian.)

    Google Scholar 

  205. Stefano Beltramolli: Il disegno di sistemi distribuiti con le Reti OBJSA. (Distributed System Design with OBJSA Nets.) Tesi di Laurea in Computer Science, Dip. Scienze dell'Informazione, Univ. degli Studi di Milano (A.A. 1990/91). (In Italian.)

    Google Scholar 

  206. R.Devillers: Maximality Preservation and the ST-idea for Action Refinements. This volume.

    Google Scholar 

  207. Paul Gastin and Antoine Petit: Asynchronous Automata for Infinite Traces. Rapport LRI no 707, 1991.

    Google Scholar 

  208. I.Czaja, R.J.van Glabbeek and U.Goltz: Interleaving Semantics and Action Refinement with Atomic Choice. This volume.

    Google Scholar 

  209. U.Goltz and N.Götz: Modelling a Simple Communication Protocol in a Language with Action Refinement. Draft (November 1991).

    Google Scholar 

  210. U.Goltz and A.Rensink: Finite Petri Nets as Models for Recursive Causal Behaviour. Arbeitspapiere der GMD Nr.604 (December 1991).

    Google Scholar 

  211. J.Esparza: A Solution to the Covering Problem for 1-Bounded Conflict-free Petri Nets using Linear Programming. Hildesheimer Informatikbericht (September 1991). To appear in IPL.

    Google Scholar 

  212. W.Vogler: Modular Construction of Petri Nets by Merging Places and the Refinement of Transitions. Draft paper (March 1991).

    Google Scholar 

  213. Paul Gastin and Antoine Petit: Poset Properties of Complex Traces. Rapport LRI (1991).

    Google Scholar 

  214. Y.Souissi an G.Memmi: Composition of Nets via a Communication Medium. In: Advances in Petri Nets 1990, pp.457–470.

    Google Scholar 

  215. Y.Souissi: On Liveness Preservation by Composition of Nets via a Set of Places. In: Advances in Petri Nets 1991, pp.277–295.

    Google Scholar 

  216. Vittorio Patera: Reti di Petri: Equivalenze e Morfismi nel Disegno di Sistemi Distribuiti. (Petri Nets: Equivalences and Morphisms in Distributed System Design.) Tesi di Laurea in Computer Science, Dip. Scienze dell'Informazione, Univ. degli Studi di Milano (A.A. 1990/91). (In Italian.)

    Google Scholar 

  217. W.Reisig: Parallel Composition of Liveness. Draft paper (October 1991).

    Google Scholar 

  218. W.Reisig: Concurrent Temporal Logic. Draft paper (October 1991).

    Google Scholar 

  219. L.Bernardinello, G.De Michelis, C.Diamantini, L.Pomello, A.Restelli and C.Simone: Relationships between Categories of’ Elementary’ Concurrent Systems. Submitted paper (October1991)

    Google Scholar 

  220. A. Finkel, C. Johnen and L. Petrucci: Decomposition of Petri Nets for Parallel Analysis. Submitted paper (January 1992).

    Google Scholar 

  221. S. Christensen and L. Petrucci: Towards a Modular Analysis of Coloured Petri Nets. Submitted paper (January 1992).

    Google Scholar 

  222. U. Goltz: Causality Based Models for the Design of Concurrent Systems. Invited Lecture. Abstract, CONCUR-91, LNCS 527, pp. 43–44 (1991).

    Google Scholar 

  223. O.Botti, J.Hall and R.P.Hopkins: A Basic Net Algebra for Program Semantics and its Application to occam. This volume.

    Google Scholar 

  224. Ryszard Janicki and Maciej Koutny: Structure of Concurrency. (A full version of [91] solicited for a special issue of Theoretical Computer Science).

    Google Scholar 

  225. Ryszard Janicki and Maciej Koutny: On Deadlock Detection using Partial Orders. Submitted paper. (1991)

    Google Scholar 

  226. Paolo Consolaro: Le reti di Petri e il paradigma object-oriented. (Petri Nets and the Object-oriented Paradigm.) Tesi di Laurea in Computer Science, Dip. Scienze dell'Informazione, Univ. degli Studi di Milano (A.A. 1990/91). (In Italian.)

    Google Scholar 

  227. Javier Camposs and Manuel Silva: Structural Techniques in Performance Analysis of Petri Net Models. This volume.

    Google Scholar 

  228. Paul Gastin and Antoine Petit: A Survey on Recognizable Languages of Infinite Traces. This volume.

    Google Scholar 

  229. Lucia Pomello, Grzegorz Rozenberg and Carla Simone: A Survey of Equivalence Notions for Net Based Systems. This volume.

    Google Scholar 

  230. Brigitte Rozoy: On Distributed Languages and Models for Concurrency. This volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hildesheim

    Eike Best

Authors
  1. Eike Best
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Best, E. (1992). Esprit basic research action 3148 DEMON (Design methods based on nets) — Aims, scope and achievements —. In: Rozenberg, G. (eds) Advances in Petri Nets 1992. Lecture Notes in Computer Science, vol 609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55610-9_166

Download citation

  • DOI: https://doi.org/10.1007/3-540-55610-9_166

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55610-7

  • Online ISBN: 978-3-540-47258-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation