Semi-Commutations and Petri Nets

Abstract A semi-commutation is a generalization of a partial commutation. So-called traces are generated by partial commutations. This class is generalized in the paper for semi-commutations called quasi-traces. A study of quasi-traces and their application to the analysis of the firing sequences of Petri nets are presented in the sequel.

[1]  Eike Best,et al.  Concurrent Behaviour: Sequences, Processes and Axioms , 1984, Seminar on Concurrency.

[2]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[3]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[4]  Peter H. Starke,et al.  Processes in Petri Nets , 1981, J. Inf. Process. Cybern..

[5]  Roy H. Campbell,et al.  The specification of process synchronization by path expressions , 1974, Symposium on Operating Systems.

[6]  Grzegorz Rozenberg,et al.  Theory of Traces , 1988, Theor. Comput. Sci..

[7]  Christine Duboc,et al.  Mixed Product and Asynchronous Automata , 1986, Theor. Comput. Sci..

[8]  M. Clerbout,et al.  Semi-commutations , 1987, Inf. Comput..

[9]  Wilfried Brauer,et al.  Net Theory and Applications , 1980, Lecture Notes in Computer Science.

[10]  Alberto Bertoni,et al.  A hierarchy of regular trace languages and some combinatorial applications , 1982 .