Design methods based on nets

Esprit basic research action DEMON
  • Eike Best
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 424)


This paper describes the rationale and the workplan of the ESPRIT Basic Research Action No. 3148 DEMON (Design Methods Based on Nets).


Concurrency Design Petri Nets Esprit 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    IJ.J. Aalbersberg and G. Rozenberg: Theory of Traces. University of Leiden, Dept. of Computer Science, Report 86-16 (1986).Google Scholar
  2. [2]
    J. Baeten: Process Algebra. To appear.Google Scholar
  3. [3]
    H. Barringer: A Survey of Verification Techniques for Parallel Programs. LNCS 191, Springer (1985).Google Scholar
  4. [4]
    G. Berthelot: Transformations and Decompositions of Nets. In: LNCS Vol.254 (1987).Google Scholar
  5. [5]
    E. Best: Weighted Basic Modular Nets. In: Concurrency'88, LNCS Vol.335 (1988).Google Scholar
  6. [6]
    E.Best and J.Desel: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing (1990).Google Scholar
  7. [7]
    E. Best and R. Devillers: Sequential and Concurrent Behaviour in Petri Net Theory, Theoretical Computer Science Vol.55, No.1, pp.87–136 (1987).Google Scholar
  8. [8]
    E.Best, R.Devillers, A.Kiehn and L.Pomello: Fully Concurrent Bisimulation. Draft (July 1989).Google Scholar
  9. [9]
    W. Brauer and D. Taubner: Petri Nets and CSP. Proc. 4th Hung. Comp. Sci. Conf. (1985).Google Scholar
  10. [10]
    M. Broy: Semantics of Finite and Infinite Networks of Concurrent Communicating Agents. Distributed Computing (1987)Google Scholar
  11. [11]
    L. Castellano, G. de Michelis and L. Pomello: Concurrency vs Interleaving: an Instructive Example. EATCS Bull., N. 31, pp. 12–15 (1987).Google Scholar
  12. [12]
    F. de Cindio, G. de Michelis, L. Pomello and C. Simone: A Petri Net Model of CSP. Proc. CIL '81, Barcelona (1981).Google Scholar
  13. [13]
    L. Cherkasova and V. Kotov: Descriptive and Analytical Process Algebras. 9th Petri Net Workshop, Venice (1988).Google Scholar
  14. [14]
    P. Degano, R. Gorrieri and S. Marchetti: An Exercise in Concurrency: A CSP Process as a Condition/Event System. Eighth Petri Net Workshop, Zaragoza (1987), also: Advances in Petri Nets (1988).Google Scholar
  15. [15]
    Various Authors: Technical Annex for the Esprit Basic Research Action No.3148: Demon (March 1989). Arbeitspapiere der GMD (January 1990).Google Scholar
  16. [16]
    A. Ehrenfeucht and G. Rozenberg: On the Structure of Dependence Graphs. In: Concurrency and Nets (K.Voss, H.J.Genrich and G.Rozenberg, eds.), Springer (1987).Google Scholar
  17. [17]
    J. Esparza and M. Silva: Circuits, Handles, Bridges and Nets. Advances in Petri Nets (1989).Google Scholar
  18. [18]
    H.J. Genrich and K. Lautenbach: System Modelling with High-level Petri Nets. Theor. Comp. Sci. 13 (1981).Google Scholar
  19. [19]
    H.J. Genrich, K. Lautenbach and P.S. Thiagarajan: Elements of General Net Theory. In: LNCS Vol.84 (1980), pp.21–163.Google Scholar
  20. [20]
    R.J.van Glabbeek: ST-bisimulation. Joint IFIG WG 2.2/2.3 Conference, Israel (1990).Google Scholar
  21. [21]
    R.J.van Glabbeek and U.Goltz: Equivalence Notions for Concurrent Systems and Refinement of Actions. MFCS'89, LNCS (1989).Google Scholar
  22. [22]
    R.J. van Glabbeek and F.W. Vandraager: Petri Net Models for Algebraic Theories of Concurrency. Proc. PARLE, Vol.II, LNCS 259, 224–242 (1987).Google Scholar
  23. [23]
    U. Goltz and A. Mycroft: On the Relationship of CCS and Petri Nets. Proc. ICALP '84 (1984).Google Scholar
  24. [24]
    U. Goltz and W. Reisig: CSP-Programs as Nets with Individual Tokens. Fifth Petri Net Workshop, Århus (1984).Google Scholar
  25. [25]
    D. Harel: Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming 8, pp. 231–274 (1987).Google Scholar
  26. [26]
    M.Hennessy: Observing Processes. Univ. of Sussex, Comp. Sci., TR 5/88 (1989).Google Scholar
  27. [27]
    C.A.R. Hoare: Communicating Sequential Processes. Communications of the ACM 21, Vol. 8 (1978).Google Scholar
  28. [28]
    H.J. Hoogeboom and G. Rozenberg: Diamond Properties of State Spaces of Elementary Net Systems. Dept. of Comp. Sci., Univ. of Leiden, TR 89-19 (1989).Google Scholar
  29. [29]
    R.P. Hopkins and M. Koutny: Dynamically Structured Systems with Asynchronous Communication. Computing Laboratory, Univ. of Newcastle upon Tyne, TR (1989).Google Scholar
  30. [30]
    Inmos Ltd: Occam 2 Reference Manual, Prentice Hall (1988).Google Scholar
  31. [31]
    Simpler Real-time Programming with the Transputer. Inmos technical note 51, in: The Transputer Applications Notebook (1988).Google Scholar
  32. [32]
    R.Janicki and M.Koutny: Observing Concurrent Histories. Workshop on Real-Time Systems, York, North Holland (1989).Google Scholar
  33. [33]
    R.Janicki, P.E.Lauer, M.Koutny and R.Devillers: Concurrent and Maximally Concurrent Evolution of Non-sequential Systems. Theoretical Computer Science 43 (1986).Google Scholar
  34. [34]
    K. Jensen: Coloured Petri Nets and the Invariant Method. Theor. Comp. Sci. 14 (1981).Google Scholar
  35. [35]
    A. Kiehn: A Structuring Mechanism for Petri Nets. PhD Thesis, Techn. Univ. München (1989).Google Scholar
  36. [36]
    V. Kotov: An Algebra for Parallelism Based on Petri Nets. MFCS 78, LNCS 64, Springer (1978).Google Scholar
  37. [37]
    M. Kwiatkowska: Fairness for Non-interleaving Concurrency. PhD Thesis, Univ. of Leicester (1989).Google Scholar
  38. [38]
    P. E. Lauer, M.W. Shields and E. Best: Formal Theory of the Basic COSY Notation. TR 143, Computing Laboratory, Univ. Newcastle upon Tyne (1978).Google Scholar
  39. [39]
    A. Mazurkiewicz: Concurrent Programs Schemes and Their Interpretations. DAIMI PB 78, Århus Univ. Publ. (1977).Google Scholar
  40. [40]
    A. Mazurkiewicz: Semantics of Concurrent Systems: A Modular Fixed-Point Trace Approach. LNCS 188: Advances in Petri Nets 1984 (ed. G.Rozenberg), Springer-Verlag, 353–375 (1985).Google Scholar
  41. [41]
    A.Mazurkiewicz: Complete Processes and Inevitability. Univ. of Leiden, Inst. of Comp. Science, TR 86-06 (1986).Google Scholar
  42. [42]
    A. Mazurkiewicz: Trace Theory. LNCS Vol.255, 279–324 (1987).Google Scholar
  43. [43]
    G. Memmi and G. Roucairol: Linear Algebra in Net Theory. LNCS Vol.84 (ed. W.Brauer), (1980).Google Scholar
  44. [44]
    R. Milner: A Calculus of Communicating Systems. LNCS 92, Springer (1980).Google Scholar
  45. [45]
    T. Murata and I. Suzuki: On the Structural Properties and Stepwise Refinement of Petri Nets. 24th Midwest Symp. on Circuits and Systems (1981).Google Scholar
  46. [46]
    M. Nielsen, G. Rozenberg and P.S. Thiagarajan: Behavioural Notions for Elementary Net Systems. Dept. of Comp. Sci., Univ. of Leiden, TR 89-19 (1989).Google Scholar
  47. [47]
    C.A. Petri: Kommunikation mit Automaten. Bonn: Institut für Instrumentelle Mathematik, Schriften des IIM Nr. 2 (1962). English translation: New York: Griffiss Air Force Base, Technical Report RADC-TR-65-377, Vol.1, Suppl. 1.Google Scholar
  48. [48]
    C.A.Petri: Concepts of Net Theory. Mathematical Foundations of Computer Science: Proc. of Symposium and Summer School, High Tatras, Sep. 3–8, 1973, pp. 137–146 (1973).Google Scholar
  49. [49]
    L. Pomello and C. Simone: A State Transformation Preorder over a Class of EN Systems. 10th Petri Net Conference, Bad Godesberg (1989).Google Scholar
  50. [50]
    S.S. Owicki and D. Gries: An Axiomatic Proof Technique for Parallel Programs. Acta Informatica 6, pp.319–340 (1976).Google Scholar
  51. [51]
    D. Park: Concurrency and Automata on Infinite Sequences, LNCS 104, Springer (1981).Google Scholar
  52. [52]
    W. Reisig: Petri Nets and Algebraic Specifications. Theor. Comp. Sci. (1989).Google Scholar
  53. [53]
    M. Rem: Concurrent Computations and VLSI Circuits. in: Control Flow and Data Flow: Concepts of Distributed Programming (ed. M. Broy), Springer, pp. 399–437 (1985).Google Scholar
  54. [54]
    A.W. Roscoe: Denotational Semantics for Occam. Seminar on Concurrency, Pittsburgh, LNCS Vol.194, 306–329 (1984).Google Scholar
  55. [55]
    G. Rozenberg: Behaviour of Elementary Net Systems. LNCS Vol.254, 60–94 (1987).Google Scholar
  56. [56]
    P.H. Starke: Processes in Petri Nets. EIK 17 8/9 (1981).Google Scholar
  57. [57]
    P.S. Thiagarajan: Elementary Net Systems. LNCS Vol.254, 26–59 (1987).Google Scholar
  58. [58]
    R.Valette: Analysis of Petri Nets by Stepwise Refinement. JCSS 18 (1979).Google Scholar
  59. [59]
    W.Vogler: Behaviour Preserving Refinements of Petri Nets. in: Tinhofer et al. (eds.): Graph Theoretic Concepts in Computer Science, LNCS Vol.246 (1987).Google Scholar
  60. [60]
    W.Vogler: Failure Semantics Based on Interval Semiwords is a Congruence for Refinement. STACS (1990).Google Scholar
  61. [61]
    J.Winkowski: An Algebraic Way of Defining the Behaviours of Place/Transition Petri Nets. Petri Net Newsletters No.33, 15–24 (August 1989).Google Scholar
  62. [62]
    T. Winograd: Beyond Programming Languages. Communications of the ACM (1979).Google Scholar
  63. [63]
    G. Winskel: A New Definition of Morphism on Petri Nets. STACS 84, LNCS 166, Springer (1984).Google Scholar
  64. [64]
    G. Winskel: Event Structures. In: LNCS Vol.255, pp. 325–392 (1987).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Eike Best
    • 1
    • 2
  1. 1.Institut für Methodische Grundlagen Gesellschaft für Mathematik und DatenverarbeitungSankt Augustin 1
  2. 2.Institut für InformatikUniversität HildesheimHildesheim

Personalised recommendations