On the omega-language Expressive Power of Extended Petri Nets

In this paper, we study the expressive power of several monotonic extensions of Petri nets. We compare the expressive power of Petri nets, Petri nets extended with non-blocking arcs and Petri nets extended with transfer arcs, in terms of ω-languages. We show that the hierarchy of expressive powers of those models is strict. To prove these results, we propose original techniques that rely on well-quasi orderings and monotonicity properties.

[1]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[2]  Philippe Schnoebelen,et al.  Reset Nets Between Decidability and Undecidability , 1998, ICALP.

[3]  Gianfranco Ciardo,et al.  Petri Nets with Marking-Dependent Ar Cardinality: Properties and Analysis , 1994, Application and Theory of Petri Nets.

[4]  Giorgio Delzanno,et al.  Towards the Automated Verification of Multithreaded Java Programs , 2002, TACAS.

[5]  Jim Handy,et al.  The cache memory book , 1993 .

[6]  Alain Finkel,et al.  Decidability of Reachability Problems for Classes of Two Counters Automata , 2000, STACS.

[7]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[8]  Alain Finkel,et al.  On the verification of broadcast protocols , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[9]  Philippe Schnoebelen,et al.  Boundedness of Reset P/T Nets , 1999, ICALP.

[10]  Sagar Chaki,et al.  Parameterized Verification of Multithreaded Software Libraries , 2001, TACAS.

[11]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[12]  Jean-François Raskin,et al.  Petri Nets with Non-blocking Arcs are Difficult to Analyze , 2004, INFINITY.

[13]  Alain Finkel,et al.  Reduction and covering of infinite reachability trees , 1990, Inf. Comput..

[14]  Jean-François Raskin,et al.  Efficient verification of counting abstractions for parametric systems , 2004 .

[15]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[16]  Giorgio Delzanno.  Automatic Verification of Parameterized Cache Coherence Protocols , 2000, CAV.

[17]  Alain Finkel,et al.  An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS , 2000, MFCS.

[18]  Kedar S. Namjoshi,et al.  On model checking for non-deterministic infinite-state systems , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).