Coverability trees for Petri nets with unordered data

DOI10.1007/978-3-662-49630-5_26zbMATH Open1475.68208OpenAlexW2237589178MaRDI QIDQ2811357FDOQ2811357

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

Recommendations

• Nets with tokens which carry data
• Decidability and complexity of Petri nets with unordered data
• Nets with Tokens Which Carry Data
• The complexity of coverability in \(\nu\)-Petri nets
• Accelerations for the coverability set of Petri nets with names

Mathematics Subject Classification ID

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

Cites Work

• Parallel program schemata
• 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.
• Complexity hierarchies beyond elementary
• Model Checking Coverability Graphs of Vector Addition Systems
• Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Well-structured transition systems everywhere!
• A structure to decide reachability in Petri nets
• Nets with tokens which carry data
• Decidability and complexity of Petri nets with unordered data
• On selective unboundedness of VASS
• The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
• Demystifying Reachability in Vector Addition Systems
• Automata theory in nominal sets
• The Power of Well-Structured Systems
• Forward Analysis for WSTS, Part II: Complete WSTS
• Title not available (Why is that?)

Cited In (9)

• Title not available (Why is that?)
• Nets with Tokens Which Carry Data
• WQO dichotomy for 3-graphs
• Solvability of orbit-finite systems of linear equations
• Nets with tokens which carry data
• Handling infinitely branching well-structured transition systems
• Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
• Ordinal recursive complexity of unordered data nets
• Title not available (Why is that?)

This page was built for publication: Coverability trees for Petri nets with unordered data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811357)