Skip to main content

Linear algebra in net theory

  • Conference paper
  • First Online:

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

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.

Bibliogrphy

  1. E. Best, H. Schmid. Systems of open paths in Petrinets. Proc. of the Symp. ou M.F.C.S. 75. Lect. Notes in Comp. Sc. no 32. Springer Verlag ed. 1975.

    Google Scholar 

  2. F. Commoner. Deadlocks in Petri nets. CA-7206-2311, Applied Data Research, Wakefield, Mass., June 1972.

    Google Scholar 

  3. T.C. HU. Integer Programming and networks flows. Addison Wesley reading. Mass. 1969.

    Google Scholar 

  4. H.G. Genrich, K. Lautenbach, P.S. Thiagarajan. An overview of net theory. In this volume.

    Google Scholar 

  5. M. Hack. Analysis of production schemata by Petri nets. M.S. Thesis, MAC TR 94, MIT Cambridge Mass. sept. 1972.

    Google Scholar 

  6. M. Jantzen, R. Valk. Formal properties of place-transition nets. In this volume.

    Google Scholar 

  7. K. Lautenbach. Exakte Bedingungen der Lebendigkeit für eine Klasse von Petri-Netzen. St. Augustin, GMD Bonn, Bericht nr. 82 (1973).

    Google Scholar 

  8. K. Lautenbach, H.A. Schmid. Use of nets for proving correctness of concurrent systems. Proc. IFIP Congress 74. North-Holland Publ. Comp. (1974).

    Google Scholar 

  9. Y.E. Lien. Termination properties of generalized Petri-nets. S.I.A.M. j. Comp., June 1976, Vol. 5, no2, pages 251–265.

    Google Scholar 

  10. A note on transition systems. J. inf. Sciences 1976, vol.10, no4, p. 347–362.

    Article  Google Scholar 

  11. G. Memmi. Semiflows and invariants. Applications in Petri nets theory. Journées d'étude sur les réseaux de Petri. A.F.C.E.T. Institut de Programmation. Paris mars 1977.

    Google Scholar 

  12. G. Memmi. —Application of the semiflow to the boundedness and liveness problems in the Petri-nets theory. Proc. of the Conf. on Information Sciences and Systems. Johns Hopkins University. Baltimore Maryland. march 1978.

    Google Scholar 

  13. -Fuites et semi-flots dans les Réseaux de Petri. Thèse de Docteur-Ingénieur. Institut de Programmation. Université Paris 6. Dec. 1978.

    Google Scholar 

  14. G. Memmi. Notion de dualité et de symétrie dans les réseaux de Petri. Proc. of the Symp. on Semantics of concurrent computations. Evian July 1979. Lect. Notes in Comp. Sciences no70. Springer-Verlag ed.

    Google Scholar 

  15. T. Murata. State equations, controllability, maximal matchings of Petri nets. IEEE Trans. Autom. and Control. Vol. AC-22 no3, June 1977, pp. 412–416.

    Article  Google Scholar 

  16. G. Ramchandani. Analysis of asynchronous concurrent systems by timed Petri-nets. Ph. D thesis. MAC-TR-120. Cambridge Mass. Feb. 1974.

    Google Scholar 

  17. J. Sifakis. Structural properties of Petri-nets. Proc. of M.F.C.S. 78 Lect. Notes in Comp. Sciences. Springer Verlag ed. 1978.

    Google Scholar 

  18. J. Sifakis. Use of Petri-nets for performance evaluation. In this volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wilfried Brauer

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Memmi, G., Roucairol, G. (1980). Linear algebra in net theory. In: Brauer, W. (eds) Net Theory and Applications. Lecture Notes in Computer Science, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10001-6_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-10001-6_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10001-0

  • Online ISBN: 978-3-540-39322-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics