ESPRIT ’90 pp 791-803 | Cite as

Structure and Behaviour of Concurrent Systems: Selected Results of the Esprit Basic Research Action No. 3148: DEMON (Design Methods Based on Nets)

  • Eike Best
Conference paper


The Esprit Basic Research Action DEMON (Design Methods Based on Nets) has been set up with the following aim [1]: In order to ensure the correct and efficient functioning of concurrent systems, effective formal reasoning is indispensable during their design. Suitable formalisms must properly describe concurrency and provide appropriate means (structuring techniques, algebra, proof rules) in order to facilitate such reasoning. Petri net theory is amongst the most mature formalisms capable of describing concurrency. This Action proposes to undertake foundational work needed for the eventual development of an effective design calculus for concurrent systems based on net theory. The envisaged calculus would comprise structuring techniques, algebras, proof rules, appropriate notions of equivalence and implementation, and analysis techniques.


Free Choice Concurrent System Springer Lecture Note Home State Proof Rule 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Various Authors: Technical Annex of the Esprit Basic Research Action DEMON (Design Methods Based on Nets). GMD-Arbeitspapiere Nr. 435 (March 1990).Google Scholar
  2. [2]
    E. Best, L. Cherkasova, J. Desel and J. Esparza: Traps, Free Choice and Home States (extended abstract). Semantics for Concurrency, Leicester 1990 (eds. M.Kwiatkowska, M.W.Shields and R.Thomas), Springer-Verlag, Workshops in Computing, pp.16-20 (1990). Also: Hildesheimer Informatik-Berichte Nr.7 (August 1990).Google Scholar
  3. [3]
    E. Best and J. Desel: Partial Order Behaviour and Structure of Petri Nets Formal Aspects of Computing Vol. 2, pp. 123 – 138 (1990).Google Scholar
  4. [4]
    E. Best and C. Fernandez: Nonsequential Processes: A Petri Net View. Springer EATCS Monographs (1988).Google Scholar
  5. [5]
    E. Best and M. Koutny: Partial Order Semantics of Priority Systems. Hildesheimer Informatik-Berichte Nr.6/90 (June 1990).Google Scholar
  6. [6]
    O. Botti and J. Hall: A Petri Net Semantics of occam. DEMON Technical Report (June 1990).Google Scholar
  7. [7]
    J. Desel: Reduction and Design of Weil-Behaved Concurrent Systems. Report, Institut fur Informatik, Technische Universitat Munchen (1990). To appear in: Proc. of CONCUR’90, Springer Lecture Notes in Computer Science.Google Scholar
  8. [8]
    J. Esparza: Structure Theory of Free Choice Nets. PhD Thesis, Universidad de Zaragoza (1990).Google Scholar
  9. [9]
    J. Esparza: Synthesis Rules for Petri Nets, and How they Lead to New Results. Informatik-Berichte Nr.4/90, Institut fur Informatik, Universitat Hildesheim (1990). To appear in: Proc. of CONCUR’90, Springer Lecture Notes in Computer Science.Google Scholar
  10. [10]
    J. Esparza and M. Silva: Circuits, Handles, Bridges and Nets. Proc. of the 10th Int. Conf. on Theory and Applications of Petri Nets, to appear in Advances in Petri Nets, Springer Lecture Notes in Computer Science (1990).Google Scholar
  11. [11]
    J. Esparza and M. Silva: A Polynomial Time Algorithm to Decide Liveness of Bounded Free Choice Nets. Technical Report, Universidad de Zaragoza (1989).Google Scholar
  12. [12]
    J. Esparza and M. Silva: On the Analysis and Synthesis of Free Choice Systems (survey paper). Submitted to the Advances in Petri Nets, Springer Verlag.Google Scholar
  13. [13]
    H.J. Genrich and P.S. Thiagarajan: A Theory of Bipolar Synchronization Schemes. Theoretical Computer Science 30, 241 – 318 (1984).MathSciNetzbMATHCrossRefGoogle Scholar
  14. [14]
    M. Hack: Analysis of Production Schemata by Petri Nets. MIT 1972/74.Google Scholar
  15. [15]
    R. Hopkins and J. Hall: Towards a Petri Net Programming Notation. Draft DEMON Report (June 1990).Google Scholar
  16. [16]
    N. D. Jones, L. H. Landweber and Y. E.Lien: Complexity of Some Problems in Petri Nets. TCS 4, 277 – 299 (1977).MathSciNetzbMATHCrossRefGoogle Scholar
  17. [17]
    W. Reisig: Petri Nets - an Introduction. Springer EATCS Monographs in Theoretical Computer Science Vol. 4 (1985).Google Scholar
  18. [18]
    The occam-2 Reference Manual. INMOS Ltd. (1988).Google Scholar

Copyright information

© ECSC, EEC, EAEC, Brussels and Luxembourg 1990

Authors and Affiliations

  • Eike Best
    • 1
    • 2
  1. 1.Institut für InformatikUniversität HildesheimHildesheimGermany
  2. 2.Schloβ BirlinghovenGMD-F1.PSt. Augustin 1Germany

Personalised recommendations