Structure theory of choice-free Petri nets based on eigenvalues

Journal of the Franklin Institute

Volumn 336, Issue 5, 1999, Pages 833-849

  Amer Yahia, Chérif ^a,b   Zerhouni, Noureddine ^b  

^a UNIVERSITÉ MOULOUD MAMMERI   (Algeria)

^b UNIVERSITÉ DE TECHNOLOGIE DE BELFORT MONTBÉLIARD   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; THEOREM PROVING;

CHOICE-FREE PETRI NETS;

PETRI NETS;

EID: 0033165032     PISSN: 00160032     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0016-0032(99)00008-3     Document Type: Article

References (22)

1. [1] T. Murata, Petri nets: properties, analysis and applications, Proc. IEEE 77 (4) (1989) 541.
2. [2] M.C. Zhou, F. Dicesare, Petri Nets Synthesis for Discrete Control of Manufacturing System, Kluwer Academic Publishers, Boston, 1993.
3. [3] A.A. Desrochers, R.Y. Al-Jaar, Applications of Petri Nets in Manufacturing Systems, IEEE Press, New York, 1995.
4. [4] R. David, H. Alla, Petri nets and Grafcet: Tools for Modelling Discrete Event Systems, Prentice-Hall, London, 1992.
5. [5] J. Sifakis, Structural properties of Petri nets, Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 64, Springer, Berlin, 1978, p. 474.
6. [6] M. Jantzen, R. Valk, Formal properties of places/transitions nets, Lecture Notes Comput. Sci. 84 (15) (1980) 165.
7. [7] R. Karp, R. Miller, Parallel program schemata, J. Comput. Syst. Sci. 3 (2) (1969) 147.
8. [8] G. Berthelot, R. Terrat, Petri nets theory for the correcteness of protocols, IEEE Trans. Commun. COM-30 (12) (1982) 2497.
9. [9] A.W. Holt, F. Commoner, Events and conditions, Information systems theory project, Research Report of Applied Data Research, Lakeside Office Park, Wakefield, MA 01880, 1970.
10. [10] Y.L. Lien, Termination properties of generalized Petri nets, SIAM J. Comput. 5 (2) (1976) 251.
11. [11] G. Memmi, Fuites et semi-flots dans les réseaux de Petri, Thèse de Docteur-Ingénieur, Université Pierre et Marie Curie, Paris, 1978.
12. [12] G. Memmi, Méthode d'analyse des réseaux de Petri, réseaux à files. Applications aux systèmes en temps réels, Thèse d'état, Université de Paris VI, 1983.
13. [13] L.H. Landweber, E. Roberson, Properties of conflict-free and persistent Petri nets, J. ACM 25 (3) (1978) 352.
14. [14] E. Teruel, J.M. Colom, M. Silva, Choice-free Petri nets: a model for deterministic concurrent systems with bulk services and arrivals, IEEE Trans. Systems, Man, Cybernet. 27 (1) (1997) 73.
15. [15] M. Fiedler, V. Ptak, On matrices with nonpositive off-diagonal elements and positive principal minors, Czech Math. J. 12 (87) (1962) 382.
16. [16] A. Berman, R.J. Plemmons, Nonnegative Matrices in the Mathematical Sciences, Academic Press, New York, 1979.
17. [17] C.T. Chen, Linear System Theory and Design, Holt, Rinehart and Winston, New York, 1984.
18. [18] D.J.N. Limebeer, The application of generalized diagonal dominance to linear system stability theory, Int. J. Control 36 (2) (1982) 185.
19. [19] J. Martinez, M. Silva, A simple and fast algorithm to obtain all invariants of a generalized Petri net, Informatik-Fachberichte 52′, Application and Theory of Petri nets, Springer, Berlin, New York, 1982, p. 301.
20. [20] G. Memmi, G. Roucairol, Linear algebra in net theory, in: W. Brauer (Ed.), Net Theory and Applications, Lecture Notes in Computer Science, vol. 84, Springer, Berlin, 1979, p. 213.
21. [21] M.W. Shields, An Introduction to Automata Theory, Blackwell, Oxford, UK, 1987.
22. [22] E. Teruel, Structure theory of weighted place/transition net systems: the equal conflict hiatus, Ph.D. dissertation, Dept. Informatica e ingenieria de Sistemas, Univ. of Zaragoza, Spain, 1994.