Unreliable channels are easier to verify than perfect channels
Information and Computation
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
On the Expressiveness of Mobile Synchronizing Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Acta Informatica
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
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
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 apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we consider extensions of Petri nets with transfer and reset operations defined for black indistinguishable tokens (Affine Well-Structured Nets), extensions in which tokens carry pure names dynamically generated with special ν-transitions (ν-APN), and extensions in which tokens carry data taken from a linearly ordered domain (Data nets and CMRS). These models are well-structured transitions systems. In order to compare these models we consider the families of languages they recognize, using coverability as accepting condition. With this criterion, we prove that ν-APNs are in between AWNs and Data Nets/CMRS. Moreover, we prove that the family of languages recognized by ν-APNs satisfies a good number of closure properties, being a semi-full AFL. These results extend the currently known classification of the expressive power of well-structured transition systems with new closure properties and new relations between extensions of Petri nets.