Coverability Trees for Petri Nets with Unordered Data

DOI10.1007/978-3-662-49630-5_26zbMath1475.68208OpenAlexW2237589178MaRDI QIDQ2811357

Ranko Lazić, Sławomir Lasota, Patrick Totzke, Piotr Hofman, Jérôme Leroux, Sylvain Schmitz

Publication date: 10 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/75834/7/WRAP_main.pdf

Mathematics Subject Classification ID

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

Related Items (6)

Handling infinitely branching well-structured transition systems ⋮ Unnamed Item ⋮ Ordinal recursive complexity of unordered data nets ⋮ WQO dichotomy for 3-graphs ⋮ Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On selective unboundedness of VASS
• Decidability and complexity of Petri nets with unordered data
• A structure to decide reachability in Petri nets
• The covering and boundedness problems for vector addition systems
• A well-structured framework for analysing Petri net extensions
• Algorithmic analysis of programs with well quasi-ordered domains.
• Parallel program schemata
• Complexity Hierarchies beyond Elementary
• The Power of Well-Structured Systems
• Automata theory in nominal sets
• The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
• Model Checking Coverability Graphs of Vector Addition Systems
• Forward Analysis for WSTS, Part II: Complete WSTS
• Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
• Demystifying Reachability in Vector Addition Systems
• Well-structured transition systems everywhere!

This page was built for publication: Coverability Trees for Petri Nets with Unordered Data