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
Model checking of systems with many identical timed processes
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
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
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
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
Fundamenta Informaticae - PETRI NETS 2007
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
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Multiset rewriting: a semantic framework for concurrency with name binding
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A classification of the expressive power of well-structured transition systems
Information and Computation
Ordinal theory for expressiveness of well structured transition systems
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Language-based comparison of petri nets with black tokens, pure names and ordered data
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
The theory of WSTS: the case of complete WSTS
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
| Hi-index | 0.00 |
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewriting systems. For each one of these models we study the class of languages generated by labelled transition systems describing their semantics. We consider here two types of accepting conditions: coverability and reachability of a given configuration. In both cases we obtain a strict hierarchy in which constrained multiset rewriting systems is the the most expressive model.