A classification of the expressive power of well-structured transition systems

Authors:
Parosh Aziz Abdulla;Giorgio Delzanno;Laurent Van Begin
Affiliations:
Uppsla University, Dept. Information Technology, Box 337, 751 05 Uppsala, Sweden;Dipartimento di Informatica e Scienze dell'Informazione, Universita' di Genova, via Dodecaneso 35, 16146 Genova, Italy;Département d'Informatique, Université Libre de Bruxelles, Boulevard du Triomphe - C.P. 212, 1050 Bruxelles, Belgium
Venue:
Information and Computation
Year:
2011

Citing 17
Cited 7

Unreliable channels are easier to verify than perfect channels

Information and Computation
Undecidable verification problems for programs with unreliable channels

Information and Computation
Well-structured transition systems everywhere!

Theoretical Computer Science
Deciding Properties of Integral Relational Automata

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Reset Nets Between Decidability and Undecidability

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Undecidable Problems in Unreliable Computations

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
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 the Verification of Broadcast Protocols

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

PETRI NET LANGUAGE
A classification of symbolic transition systems

ACM Transactions on Computational Logic (TOCL)
On the ω-language expressive power of extended petri nets

Theoretical Computer Science - Expressiveness in concurrency
Well-structured languages

Acta Informatica
A well-structured framework for analysing petri net extensions

Information and Computation
Nets with tokens which carry data

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Name creation vs. replication in Petri net systems

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
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

Well-quasi-ordering hereditarily finite sets

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Cost soundness for priced resource-constrained workflow nets

PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
On the coverability and reachability languages of monotonic extensions of Petri nets

Theoretical Computer Science
Ordinal theory for expressiveness of well-structured transition systems

Information and Computation
The power of well-structured systems

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Safety and Soundness for Priced Resource-Constrained Workflow Nets

Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012

Quantified Score

Hi-index	0.00

Visualization

Abstract

We compare the expressive power of a class of well-structured transition systems that includes relational automata (extensions of), Petri nets, lossy channel systems, constrained multiset rewriting systems, and data nets. For each one of these models we study the class of languages generated by labeled transition systems describing their semantics. We consider here two types of accepting conditions: coverability and reachability of a fixed a priori configuration. In both cases we obtain a strict hierarchy in which constrained multiset rewriting systems is the most expressive model.