Infinitary languages of Petri nets and logical sentences

Now, our work deals with the infinite (sequential) behaviour of Petri nets. In this article we will show that a certain class of sentences of the monadic second order logic = {< , (P~) e~ ~ , -<g'=8 } (introduced in [P-P1] and [P-P2]) exactly characterize the infinitary or elanguages of Petri nets over an alphabet ,~,, defined by their 3-behaviour (according to Valk and Carstensen's definition [V, V-C] ).

[1]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[2]  Rüdiger Valk,et al.  Infinite behaviour and fairness in Petri nets , 1985, European Workshop on Applications and Theory in Petri Nets.

[3]  Wolfgang Thomas,et al.  A Combinatorial Approach to the Theory of omega-Automata , 1981, Inf. Control..

[4]  Rüdiger Valk,et al.  Infinite Behaviour and Fairness , 1986 .

[5]  Elisabeth Pelz,et al.  A logical formalism for the study of the infinite behaviour of Petri nets , 1985, Applications and Theory in Petri Nets.

[6]  Rüdiger Valk.  Infinite Behaviour of Petri Nets , 1983, Theor. Comput. Sci..

[7]  Elisabeth Pelz,et al.  A Logical Approach of Petri Net Languages , 1985, Theor. Comput. Sci..