Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture

DOI10.1007/978-3-319-39086-4_3zbMath1346.68137MaRDI QIDQ2822649

Sławomir Lasota

Publication date: 4 October 2016

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39086-4_3

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Unnamed Item, Unnamed Item, Soundness Verification of Data-Aware Process Models with Variable-to-Variable Conditions, Linear equations for unordered data vectors in $[D^k\to{}Z^d$], WQO dichotomy for 3-graphs, A Non-Deterministic Multiset Query Language, Data and process resonance. Identifier soundness for models of information systems, Nondeterministic and co-nondeterministic implies deterministic, for data languages

Uses Software

• NLambda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decidability and complexity of Petri nets with unordered data
• System modelling with high-level Petri nets
• Coloured Petri nets and the invariant-method
• A survey of homogeneous structures
• Coverability Trees for Petri Nets with Unordered Data
• Automata theory in nominal sets
• Towards nominal computation
• The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
• Verification of Timed-Arc Petri Nets
• Nets with Tokens Which Carry Data
• Finitely constrained classes of homogeneous directed graphs
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Turing Machines with Atoms
• LOIS: syntax and semantics
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Countable homogeneous relational structures and ℵ₀-categorical theories
• Ordering by Divisibility in Abstract Algebras
• Well-structured transition systems everywhere!