Linear algebra in net theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 84 LNCS, Issue , 1980, Pages 213-223

  Memmi, G ^a   Roucairol, G ^b  

^a ECA Automation ^*  (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85027625952     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10001-6_24     Document Type: Conference Paper

References (18)

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.
2. F. Commoner. Deadlocks in Petri nets. CA-7206-2311, Applied Data Research, Wakefield, Mass., June 1972.
3. T.C. HU. Integer Programming and networks flows. Addison Wesley reading. Mass. 1969.
4. H.G. Genrich, K. Lautenbach, P.S. Thiagarajan. An overview of net theory. In this volume.
5. M. Hack. Analysis of production schemata by Petri nets. M.S. Thesis, MAC TR 94, MIT Cambridge Mass. sept. 1972.
6. M. Jantzen, R. Valk. Formal properties of place-transition nets. In this volume.
7. K. Lautenbach. Exakte Bedingungen der Lebendigkeit für eine Klasse von Petri-Netzen. St. Augustin, GMD Bonn, Bericht nr. 82 (1973).
8. K. Lautenbach, H.A. Schmid. Use of nets for proving correctness of concurrent systems. Proc. IFIP Congress 74. North-Holland Publ. Comp. (1974).
9. Y.E. Lien. Termination properties of generalized Petri-nets. S.I.A.M. j. Comp., June 1976, Vol. 5, no2, pages 251–265.
10. A note on transition systems. J. inf. Sciences 1976, vol.10, no4, p. 347–362.
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.
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.
13. G. Memmi. -Fuites et semi-flots dans les Réseaux de Petri. Thèse de Docteur-Ingénieur. Institut de Programmation. Université Paris 6. Dec. 1978.
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.
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.
16. G. Ramchandani. Analysis of asynchronous concurrent systems by timed Petri-nets. Ph. D thesis. MAC-TR-120. Cambridge Mass. Feb. 1974.
17. J. Sifakis. Structural properties of Petri-nets. Proc. of M.F.C.S. 78 Lect. Notes in Comp. Sciences. Springer Verlag ed. 1978.
18. J. Sifakis. Use of Petri-nets for performance evaluation. In this volume.