Unreliable channels are easier to verify than perfect channels
Information and Computation
Well-structured transition systems everywhere!
Theoretical Computer Science
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
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
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
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
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
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 use language theory to study the relative expressiveness of infinite-state models laying in between finite automata and Turing machines. We focus here our attention on well structured transition systems that extend Petri nets. For these models, we study the impact of whole-place operations like transfers and resets on nets with indistinguishable tokens and with tokens that carry data over an infinite domain. Our measure of expressiveness is defined in terms of the class of languages recognized by a given model using coverability of a configuration as accepting condition.