Petri nets: an introduction
Unreliable channels are easier to verify than perfect channels
Information and Computation
Petri nets and regular processes
Journal of Computer and System Sciences
Well-structured transition systems everywhere!
Theoretical Computer Science
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Notes on Nominal Calculi for Security and Mobility
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Computation: finite and infinite machines
Computation: finite and infinite machines
Acta Informatica
Instance Isolation Analysis for Service-Oriented Architectures
SCC '08 Proceedings of the 2008 IEEE International Conference on Services Computing - Volume 1
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
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
A well-structured framework for analysing petri net extensions
Information and Computation
The downward-closure of petri net languages
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
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
Soundness of resource-constrained workflow nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
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
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
| Hi-index | 5.23 |
We apply language theory to compare the expressive power of infinite-state models that extend Petri nets with features like coloured tokens and/or whole place operations. Specifically, we consider extensions of Petri nets in which tokens carry pure names dynamically generated with special @n-transitions (@n-PN) and compare their expressiveness with transfer and reset nets with black indistinguishable tokens (Affine Well-Structured Nets), and nets in which tokens carry data taken from a linearly ordered domain (Data nets and CMRS). All these models are well-structured transition systems. In order to compare these models we consider the families of languages they recognize, using coverability as the accepting condition. With this criterion, we prove that @n-PNs are in between AWNs and Data Nets/CMRS, but equivalent to an extension of @n-PN with whole-place operations. These results extend the currently known classification of the expressive power of well-structured transition systems. Finally, we study several problems regarding (coverability) languages of AWN and @n-PN.