On the ω-language expressive power of extended petri nets

Authors:
A. Finkel;G. Geeraerts;J.-F. Raskin;L. Van Begin
Affiliations:
L.S.V., École Normale Supérieure de Cachan, CACHAN Cedex, France;D.I., Université Libre de Bruxelles - bld. du Triomphe, Bruxelles, Belgium;D.I., Université Libre de Bruxelles - bld. du Triomphe, Bruxelles, Belgium;D.I., Université Libre de Bruxelles - bld. du Triomphe, Bruxelles, Belgium
Venue:
Theoretical Computer Science - Expressiveness in concurrency
Year:
2006

Citing 13
Cited 4

Reduction and covering of infinite reachability trees

Information and Computation
Reasoning about systems with many processes

Journal of the ACM (JACM)
The cache memory book

The cache memory book
Handbook of Theoretical Computer Science: Formal Models and Semantics

Handbook of Theoretical Computer Science: Formal Models and Semantics
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems
Reset Nets Between Decidability and Undecidability

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Parameterized Verification of Multithreaded Software Libraries

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards the Automated Verification of Multithreaded Java Programs

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Automatic Verification of Parameterized Cache Coherence Protocols

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Petri Nets with Marking-Dependent Ar Cardinality: Properties and Analysis

Proceedings of the 15th International Conference on Application and Theory of Petri Nets
General decidability theorems for infinite-state systems

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On Model Checking for Non-Deterministic Infinite-State Systems

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On the Verification of Broadcast Protocols

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A classification of the expressive power of well-structured transition systems

Information and Computation
Catalytic petri nets are turing complete

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Comparing the expressive power of well-structured transition systems

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.