Well-formedness of Equal Conflict systems

  • Enrique Teruel
  • Manuel Silva
Full Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 815)


The aim of this work is to deepen into the structure theory of Place/Transition net systems. In particular, it considers well-formedness (i.e. structural liveness and boundedness) of Equal Conflict net systems, a class which generalises the well-known (Extended) Free Choice allowing weights but keeping the total autonomy of conflicts. This contribution, together with [18, 19, 20, 21], shows that many results that were known for some subclasses of ordinary Petri nets can be extended to non ordinary nets. For this purpose, some important classical concepts are re-defined, namely components and allocatability.


Place/Transition net systems Structure theory Rank theorem Well-formedness Decomposition 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    E. Best, editor. Final Report of Esprit BRA 3148 (DEMON), Feb. 1993. GMD-Studien Nr.217.Google Scholar
  2. 2.
    G. W. BRAMS. Réseaux de Petri: Théorie et Pratique. Masson, 1983.Google Scholar
  3. 3.
    J. Campos, G. Chiola, and M. Silva. Properties and performance bounds for closed Free Choice synchronized monoclass queueing networks. IEEE Trans, on Automatic Control, 36(12):1368–1382, 1991.Google Scholar
  4. 4.
    J. M. Colom, J. Campos, and M. Silva. On liveness analysis through linear algebraic techniques. In Procs. of the AGM of Esprit BRA 3148 (DEMON), 1990.Google Scholar
  5. 5.
    J. Desel. A proof of the rank theorem for Extended Free Choice nets. In Jensen [9], pages 134–153.Google Scholar
  6. 6.
    J. Esparza and M. Silva. On the analysis and synthesis of Free Choice systems. In Rozenberg [15], pages 243–286.Google Scholar
  7. 7.
    M. H. T. Hack. Analysis of production schemata by Petri nets. Master's thesis, MIT, 1972. (Corrections in Computation Structures Note 17, 1974).Google Scholar
  8. 8.
    A. W. Holt and F. Commoner. Events and conditions. Appl. Data Research, 1970.Google Scholar
  9. 9.
    K. Jensen, editor. Application and Theory of Petri Nets 1992, volume 616 of Lecture Notes in Computer Science. Springer Verlag, 1992.Google Scholar
  10. 10.
    W. E. Kluge and K. Lautenbach. The orderly resolution of memory access conflicts among competing channel processes. IEEE Trans. on Computers, 31(3):194–207, 1982.Google Scholar
  11. 11.
    Y. E. Lien. Termination properties of generalized Petri nets. Siam Journal on Computing, 5(2):251–265, 1976.Google Scholar
  12. 12.
    G. Memmi and G. Roucairol. Linear algebra in net theory. In W. Brauer, editor, Net Theory and Applications, volume 84 of Lecture Notes in Computer Science, pages 213–223. Springer Verlag, 1979.Google Scholar
  13. 13.
    T. Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4):541–580, 1989.Google Scholar
  14. 14.
    K. G. Murty. Linear Programming. Wiley and Sons, 1983.Google Scholar
  15. 15.
    G. Rozenberg, editor. Advances in Petri, Nets 1990, volume 483 of Lecture Notes in Computer Science. Springer Verlag, 1991.Google Scholar
  16. 16.
    M. W. Shields. An Introduction to Automata Theory. Blackwell Scientific Publications, 1987.Google Scholar
  17. 17.
    M. Silva. Las Redes de Petri: en la Autornática y la Informdtica. AC, 1985.Google Scholar
  18. 18.
    E. Teruel, P. Chrzastowski, J. M. Colom, and M. Silva. On Weighted T-systems. In Jensen [9], pages 348–367.Google Scholar
  19. 19.
    E. Teruel, J. M. Colom, and M. Silva. Modelling and analysis of deteministic concurrent systems with bulk services and arrivals. In M. Cosnard and R. Puigjaner, editors, Decentralized and Distributed Systems, pages 213–224. IFIP Transactions A-39, Elsevier, 1994.Google Scholar
  20. 20.
    E. Teruel and M. Silva. Liveness and home states in Equal Conflict systems. In M. Ajmone Marsan, editor, Application and Theory of Petri Nets 1993, volume 691 of Lecture Notes in Computer Science, pages 415–432. Springer Verlag, 1993.Google Scholar
  21. 21.
    E. Teruel and M. Silva. Structure theory of Equal Conflict systems. Research Report GISI-RR-93-22, DIEL Univ. Zaragoza, Nov. 1993. (Revised in Mar. 1994, 30 pages).Google Scholar
  22. 22.
    P. S. Thiagarajan and K. Voss. A fresh look at Free Choice nets. Information and Control, 61(2):85–113, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Enrique Teruel
    • 1
  • Manuel Silva
    • 1
  1. 1.Departamento de Ingenien'a Eléctrica e InformáticaCentro Politécnico Superior de Ingenieros de la Universidad de ZaragozaZaragozaSpain

Personalised recommendations