Skip to main content
SpringerLink
Log in
Book cover

Advanced Course on Petri Nets

ACPN 1996: Lectures on Petri Nets I: Basic Models pp 309–373Cite as

Linear algebraic and linear programming techniques for the analysis of place/transition net systems

  • II Analysis and Synthesis
  • Chapter
  • First Online:

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

Abstract

The structure theory of Place/Transition net systems is surveyed — incorporating new contributions — in a tutorial style, mainly from a linear algebraic perspective. Topics included are: state equation based analysis of safety properties (e.g., boundedness, mutual exclusion, deadlock-freeness, etc.), linear invariants, siphons and traps, implicit places and their application to improve the accuracy of the state equation, and rank theorems (structural conditions for liveness and boundedness based on the rank of the incidence matrix).

This work was partially supported by Project TIC-94-0242 of the Spanish CICYT and Contract CHRX-CT94-0452 (MATCH) within the HCM Programme of the EU.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Alaiwan and J. M. Toudic. Recherche des semi-flots, des verrous et des trappes dans les réseaux de Petri. Technique et Science Informatiques, 4(1):103–112, 1985.

    Google Scholar 

  2. E. Badouel and P. Darondeau. A survey on net synthesis. In Borne et al. [9], pages 309–316.

    Google Scholar 

  3. Z. A. Banaszak and B. H. Krogh. Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows. IEEE Trans. on Robotics and Automation, 6(6):724–734, 1990.

    Google Scholar 

  4. K. Barkaoui and M. Minoux. A polynomial-time graph algorithm to decide liveness of some basic: classes of bounded Petri nets. In Jensen [42], pages 62–75.

    Google Scholar 

  5. K. Barkaoui and J. F. Pradat-Peyre. On liveness and controlled siphons in Petri nets. In Billington and Reisig [8], pages 57–72.

    Google Scholar 

  6. G. Berthelot and G. Roucairol. Reduction of Petri netss. In Procs. of the Symposium on MFCS '76, volume 45 of Lecture Notes in Computer Science, pages 202–209. Springer, 1976.

    Google Scholar 

  7. E. Best, J. Desel, and J. Esparza. Traps characterize home states in free choice systems. Theoretical Computer Science, 101:161–176, 1993.

    Google Scholar 

  8. J. Billington and W. Reisig, editors. Application and Theory of Petri Nets 1996, volume 1091 of Lecture Notes in Computer Science. Springer, 1996.

    Google Scholar 

  9. P. Borne, J. C. Gentina, E. Craye, and S. El Khattabi, editors. Symposium on Discrete Events and Manufacturing Systems. CESA '96 IMACS Multiconference, Lille, France, July 1996.

    Google Scholar 

  10. G. W. BRAMS. Réseaux de Petri: Theorie et Pratique. Mason, 1983.

    Google Scholar 

  11. W. Brauer, editor. Net Theory and Applications, volume 84 of Lecture Notes in Computer Science. Springer, 1980.

    Google Scholar 

  12. W. Brauer, W. Reisig, and G. Rozenberg, editors. Petri Nets: Central Models and their Properties. Advances in Petri Nets 1986, Part I, volume 254 of Lecture Notes in Computer Science. Springer, 1987.

    Google Scholar 

  13. 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 

  14. J. Campos, J. M. Colom, H. Jungnitz, and M. Silva. Approximate throughput computation of stochastic marked graphs. IEEE Trans. on Software Engineering, 20(7):526–535, 1994.

    Google Scholar 

  15. J. Campos, J. M. Colom, and M. Silva. Performance evaluation of repetitive automated manufacturing systems. In Procs. 2 nd Int. Conf. on Computer Integrated Manufacturing and Automation Technology (CIMAT '90), pages 74–81. IEEE-Computer Society Press, 1990.

    Google Scholar 

  16. J. Campos, J. M. Colom, and M. Silva. Improving throughput upper bounds for net based models. In S. G. Tzafestas and J. C. Gentina, editors, Robotics and Flexible Manufacturing Systems, pages 281–294. Elsevier, 1992.

    Google Scholar 

  17. J. Campos and M. Silva. Structural techniques and performance bounds of stochastic Petri net models. In G. Rozenberg, editor, Advances in Petri Nets 1992, volume 609 of Lecture Notes in Computer Science, pages 352–391. Springer, 1992.

    Google Scholar 

  18. J. Campos, M. Silva, and S. Donatelli. Structured solution of stochastic DSSP systems. In Procs. of the 7 th Int. Workshop on Petri Nets and Performance Models (PNPM97). IEEE Computer Society Press, 1997.

    Google Scholar 

  19. J. M. Colom. Análisis Estructural de Redes de Petri. Programación Lineal y Geometría Convexa. PhD thesis, DIEL Univ. Zaragoza, June 1989.

    Google Scholar 

  20. 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 

  21. J. M. Colom et al. Linear algebraic characterisation of structurally safe P/T systems. Technical report, DIIS. Univ. Zaragoza, 1997. In preparation.

    Google Scholar 

  22. J. M. Colom and M. Silva. Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows. In Rozenberg [75], pages 79–112.

    Google Scholar 

  23. J. M. Colom and M. Silva. Improving the linearly based characterization of P/T nets. In Rozenberg [75], pages 113–145.

    Google Scholar 

  24. J. M. Colom, M. Silva, and J. L. Villarroel. On software implementation of Petri nets and colored Petri nets using high-level concurrent languages. In Proc. 7 th European Workshop on Application and Theory of Petri Nets, pages 207–241, Oxford, England, July 1986.

    Google Scholar 

  25. F. Commoner, A. W. Holt, S. Even, and A. Pnueli. Marked directed graphs. Journal on Computer Systems Science, 5:72–79, 1971.

    Google Scholar 

  26. R. G. Coyle. Management System Dynamics. Wiley, 1977.

    Google Scholar 

  27. R. David and H. Alla. Petri Nets and Grafcet. Prentice-Hall, 1992.

    Google Scholar 

  28. J. Desel. A proof of the rank theorem for extended free choice nets. In Jensen [42], pages 134–153.

    Google Scholar 

  29. J. Desel. Regular marked Petri nets. In J. Leeuwen, editor, WG' 93: 19th Int. Workshop on Graph-Theoretic Concepts in Computer Science, volume 790 of Lecture Notes in Computer Science, pages 264–275. Springer, 1993.

    Google Scholar 

  30. J. Desel and J. Esparza. Reachability in cyclic extended free choice systems. Theoretical Computer Science, 114:93–118, 1993.

    Google Scholar 

  31. J. Desel and J. Esparza. Free Choice Petri Nets, volume 40 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1995.

    Google Scholar 

  32. J. Desel, K. P. Neuendorf, and M. D. Radola. Proving nonreachability by modulo-invariants. Theoretical Computer Science, 153(1-2):49–64, 1996.

    Google Scholar 

  33. J. Esparza and M. Silva. A polynomial time algorithm to decide liveness of bounded free choice nets. Theoretical Computer Science, 102:185–205, 1992.

    Google Scholar 

  34. J. Ezpeleta, J. M. Colom, and J. Martinez. A Petri net based deadlock prevention policy for flexible manufacturing systems. IEEE Trans. on Robotics and Automation, 11(2):173–184, 1995.

    Google Scholar 

  35. J. Ezpeleta, J. M. Couvreur, and M. Silva. A new technique for finding a generating family of siphons, traps and ST-components. application to coloured Petri nets. In G. Rozenberg, editor, Advances in Petri Nets 1993, volume 674 of Lecture Notes in Computer Science, pages 126–147. Springer, 1993.

    Google Scholar 

  36. H. J. Genrich and K. Lautenbach. Synchronisationgraphen. Acta Informatica, 2:143–161, 1973.

    Google Scholar 

  37. H. J. Genrich, K. Lautenbach, and P. S. Thiagarajan. Elements of general net theory. In Brauer [11], pages 21–163.

    Google Scholar 

  38. A. Giua, F. DiCesare, and M. Silva. Generalized mutual exclusion constraints on nets with uncontrollable transitions. In IEEE Int. Conf. on Systems. Man, and Cybernetics, Chicago, IL, USA, October 1992.

    Google Scholar 

  39. M. H. T. Hack, Analysis of production schemata by Petri nets. Master's thesis, M.I.T., Cambridge, MA, USA, 1972. (Corrections in Computation Structures Note 17, 1974).

    Google Scholar 

  40. L. E, Holloway, B. H. Krogh, and A. Giua. Petri nets for the control of discrete event systems: A tutorial survey, In Supervisory Control of Discrete Event Systems. Laboratoire d'Automatique de Grenoble, INPG, September 1995.

    Google Scholar 

  41. M. Jantzen and R. Valk. Formal properties of Place/Transition nets. In Brauer [11], pages 165–212.

    Google Scholar 

  42. K. Jensen, editor, Application and Theory of Petri Nets 1992, volume 616 of Lecture Notes in Computer Science, Springer, 1992.

    Google Scholar 

  43. K. Jensen and G, Rozenberg, editors, High-level Petri Nets, Springer, 1991.

    Google Scholar 

  44. C. Johnen. Algorithmic verification of home spaces in P/T systems. In Procs. IMACS 1988, 12th World Congress on Scientific Computation, pages 491–493, 1988

    Google Scholar 

  45. R. Kannan and A. Bachem. Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM Journal on Computing, 8:499–507, 1979.

    Google Scholar 

  46. P. Kemper. Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net, In M, Ajmone Marsan, editor, Application and Theory of Petri Nets 1993, volume 691 of Lecture Notes in Computer Science, pages 319–338, Springer, 1993.

    Google Scholar 

  47. 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 

  48. F. Krückeberg and M. Jaxy. Mathematical methods for calculating invariants in Petri nets. In G, Rozenberg, editor, Advances in Petri Nets 1987, volume 266 of Lecture Notes in Computer Science, pages 104–131, Springer, 1987

    Google Scholar 

  49. J. B. Lasserre and P. Mahey. Using linear programming in Petri net analysis, Operations Research, 26(1):43–50, 1989.

    Google Scholar 

  50. K. Lautenbach. Linear algebraic calculation of deadlocks and traps, In K. Voss et al., editors, Concurrency and Nets, pages 315–336. Springer, 1987

    Google Scholar 

  51. K. Lautenbach. Linear algebraic techniques for Place/ Transition nets. In Brauer et al. [12], pages 142–167.

    Google Scholar 

  52. K. Lautenbach and H. A. Schmid. Use of Petri nets for proving correctness of concurrent process systems. In Procs. IFIP Congress 74, pages 187–191. North-Holland, 1974.

    Google Scholar 

  53. Y. Li and W. M. Wonham. Control of vector discrete event systems I — the base model. IEEE Trans. on Automatic Control, 38(8):1214–1227, 1993.

    Google Scholar 

  54. Y. Li and W. M. Wonham. Control of vector discrete event systems II — controller synthesis. IEEE Trans. on Automatic Control, 39(3):512–531, 1994.

    Google Scholar 

  55. Y. E. Lien. Termination properties of generalized Petri nets. SIAM Journal on Computing, 5(2):251–265, 1976.

    Google Scholar 

  56. D. G. Luenberger. Introduction to Linear and Non Linear Programming. Addison Wesley, 1972.

    Google Scholar 

  57. J. Martínez and M. Silva. A simple and fast algorithm to obtain all invariants of a generalized Petri net. In C. Girault and W. Reisig, editors, Application and Theory of Petri Nets, pages 301–310. Springer, 1982.

    Google Scholar 

  58. S. Melzer and J. Esparza. Checking system properties via integer programming. In H. R. Nielsen, editor, Proceedings of ESOP '96, volume 1058 of Lecture Notes in Computer Science, pages 250–265. Springer, 1996.

    Google Scholar 

  59. G. Memmi. Applications of the semiflow notion to the boundedness and liveness problems in Petri net theory. In Conf. on Information Sciences and Systems. John Hopkins University, 1978.

    Google Scholar 

  60. G. Memmi and G. Roucairol. Linear algebra in net theory. In Brauer [11], pages 213–223.

    Google Scholar 

  61. G. Memmi and J. Vautherin. Analysing nets by the invariant method. In Brauer et al. [12], pages 300-336. Collected in [43].

    Google Scholar 

  62. T. Murata. Circuit theoretic analysis and synthesis of marked graphs. IEEE Trans. on Circuits and Systems, 24(7):400–405, 1977.

    Google Scholar 

  63. T. Murata. State equation, controllability, and maximal matchings of Petri nets. IEEE Trans. on Automatic Control, 22(3):412–416, 1977.

    Google Scholar 

  64. T. Murata, B. Shenker, and S. M. Shatz. Detection of Ada static deadlocks using Petri net invariants. IEEE Trans. on Software Engineering, 15(3):314–326, 1989.

    Google Scholar 

  65. K. G. Murty. Linear Programming. Wiley and Sons, 1983.

    Google Scholar 

  66. C. J. Pérez, J. Campos, and M. Silva. On approximate performace evaluation of manufacturing systems modelled with weighted T-systems. In Borne et al. [9], pages 201–207.

    Google Scholar 

  67. J. L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, 1981.

    Google Scholar 

  68. P. J. G. Ramadge and W. M. Wonham. The control of discrete event systems. Proceedings of the IEEE, 77(1):81–98, 1989.

    Google Scholar 

  69. C. V. Ramamoorthy and G. S. Ho. Performance evaluation of asynchronous concurrent systems using Petri nets. IEEE Trans. on Software Engineering, 6(5):440–449, 1980.

    Google Scholar 

  70. C. Ramchandani. Analysis of asynchronous concurrent systems by Petri nets. Technical Report Project MAC, TR-120, M.I.T., Cambridge, MA, USA, 1974.

    Google Scholar 

  71. L. Recalde, E. Teruel, and M. Silva. On well-formedness analysis: The case of deterministic systems of sequential processes. In J. Desel, editor, Proc. of the Int. Workshop on Structures in Concurrency Theory (STRICT), Workshops in Computing, pages 279–293. Springer, 1995.

    Google Scholar 

  72. L. Recalde, E. Teruel, and M. Silva. ECS: A class of modular and hierarchical cooperating systems. In Billington and Reisig [8], pages 440–459.

    Google Scholar 

  73. L. Recalde, E. Teruel, and M. Silva. Improving the decision power of rank theorems. In IEEE Int. Conf on Systems, Man, and Cybernetics, Orlando, Florida, USA, October 1997. To appear.

    Google Scholar 

  74. L. Recalde, E. Teruel, and M. Silva. Modeling and analysis of sequential processes that cooperate through buffers. Technical report, DIIS. Univ. Zaragoza, 1997. Submitted paper.

    Google Scholar 

  75. G. Rozenberg, editor. Advances in Petri Nets 1990, volume 483 of Lecture Notes in Computer Science. Springer, 1991.

    Google Scholar 

  76. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.

    Google Scholar 

  77. M. W. Shields. An Introduction to Automata Theory. Blackwell Scientific Publications, 1987.

    Google Scholar 

  78. J. Sifakis. Uses of Petri nets for performance evaluation. In Measuring, Modelling, and Evaluating Computer Systems, pages 75–93. North-Holland, 1977.

    Google Scholar 

  79. J. Sifakis. Structural properties of Petri nets. In J. Winkowski, editor, Mathematical Foundations of Computer Science 1978, pages 474–483. Springer, 1978.

    Google Scholar 

  80. J. Sifakis. Realization of fault-tolerant systems by coding Petri nets. Design Automation and Fault-Tolerant Computing, 3(2):93–107, 1979.

    Google Scholar 

  81. M. Silva. Las Redes de Petri: en la Automdtica y la Informdtica. AC, 1985.

    Google Scholar 

  82. M. Silva. Introducing Petri nets. In Practice of Petri Nets in Manufacturing, pages 1–62. Chapman & Hall, 1993.

    Google Scholar 

  83. M. Silva and J. M. Colom. On the computation of structural synchronic invariants in P/T nets. In G. Rozenberg, editor, Advances in Petri Nets 1988, volume 340 of Lecture Notes in Computer Science, pages 387–417. Springer, 1988.

    Google Scholar 

  84. M. Silva and T. Murata. B-fairness and structural b-fairness in Petri net models of concurrent systems. Journal of Computer and System Sciences, 44(3):447–477, 1992.

    Google Scholar 

  85. M. Silva and S. Velilla. Detección y correction de errores mediante la codificación de redes de Petri. In II Simposium Nacional IFAC: Automática en la Industria, pages 491–500, Zaragoza, Spain, November 1984.

    Google Scholar 

  86. M. Silva and S. Velilla. Error detection and correction on Petri net models of discrete event control systems. In Proc. ISCAS 85, pages 921–924, 1985.

    Google Scholar 

  87. E. Teruel. Programa para la mejora de la descripción lineal de redes de Petri mediante adición de lugares implicitos secantes. Master's thesis, DIEL Univ. Zaragoza, 1990.

    Google Scholar 

  88. E. Teruel, P. Chrzastowski, J. M. Colom, and M. Silva. On weighted T-systems. In Jensen [42], pages 348–367.

    Google Scholar 

  89. E. Teruel, J. M. Colom, and M. Silva. Linear analysis of deadlock-free ness of Petri net models. In Procs. of the 2 nd European Control Conference, volume 2, pages 513–518. North-Holland, 1993.

    Google Scholar 

  90. E. Teruel, J. M. Colom, and M. Silva. Choice-free Petri nets: A model for deterministic: concurrent systems with bulk services and arrivals. IEEE Trans. on Systems, Man, and Cybernetics, 27(1):73–83, 1997.

    Google Scholar 

  91. E. Teruel and M. Silva. Well-formedness of equal conflict systems. In R. Valette, editor, Application and Theory of Petri Nets 1994, volume 815 of Lecture Notes in Computer Science, pages 491–510. Springer, 1994.

    Google Scholar 

  92. E. Teruel and M. Silva. Structure theory of equal conflict systems. Theoretical Computer Science, 153(1-2):271–300, 1996.

    Google Scholar 

  93. F. Tricas and J. Martínez. An extension of the liveness theory for concurrent sequential processes competing for shared resources. In IEEE Int. Conf. oil Systems, Man, and Cybernetics, pages 4119–4124, Vancouver, Canada, October 1995.

    Google Scholar 

  94. N. Viswanadham, Y. Narahari, and T. L. Johnson. Deadlock prevention and deadlock avoidance in flexible manufacturing systems using Petri net models. IEEE Trans. on Robotics and Automation, 6(6):713–723, 1990.

    Google Scholar 

  95. M. C. Zhou, F. DiCesare, and A. A. Desrochers. A hybrid methodology for synthesis of Petri nets for manufacturing systems. IEEE Trans. on Robotics and Automation, 8(3):350–361, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. Informática e Ingenieriá de Sistemas, CPS, Universidad de Zaragoza, Maria de Luna 3, E-50015, Zaragoza, Spain

    Manuel Silva, Enrique Terue & José Manuel Colom

Authors
  1. Manuel Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Enrique Terue
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. José Manuel Colom
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Reisig Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Silva, M., Terue, E., Colom, J.M. (1998). Linear algebraic and linear programming techniques for the analysis of place/transition net systems. In: Reisig, W., Rozenberg, G. (eds) Lectures on Petri Nets I: Basic Models. ACPN 1996. Lecture Notes in Computer Science, vol 1491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-65306-6_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-65306-6_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65306-6

  • Online ISBN: 978-3-540-49442-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation