Coverability trees for Petri nets with unordered data

DOI10.1007/978-3-662-49630-5_26MaRDI QIDQ2811357zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3582425 (Why is no real title available?)
• A structure to decide reachability in Petri nets
• A well-structured framework for analysing Petri net extensions
• Accelerations for the coverability set of Petri nets with names
• Algorithmic analysis of programs with well quasi-ordered domains.
• Automata theory in nominal sets
• Complexity hierarchies beyond elementary
• Decidability and complexity of Petri nets with unordered data
• Demystifying Reachability in Vector Addition Systems
• Forward analysis for WSTS. I: Completions
• Forward analysis for WSTS. II: Complete WSTS
• Model Checking Coverability Graphs of Vector Addition Systems
• Nets with tokens which carry data
• On selective unboundedness of VASS
• Parallel program schemata
• Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
• The covering and boundedness problems for vector addition systems
• The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets
• The power of well-structured systems
• Well-structured transition systems everywhere!

Cited in

(11)

• Forward analysis for WSTS. III: Karp-Miller trees
• Decidability and complexity of Petri nets with unordered data
• 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
• Linear equations with ordered data
• What makes Petri nets harder to verify: stack or data?
• Ordinal recursive complexity of unordered data nets

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)