On Petri Nets with Hierarchical Special Arcs

DOI10.4230/LIPIcs.CONCUR.2017.40zbMath1442.68122arXiv1707.01157OpenAlexW2962843301MaRDI QIDQ5111656

Vishal Jagannath, S. Akshay, Sai Sandeep, Supratik Chakraborty, Ankush Das

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1707.01157

zbMATH Keywords

reachabilitypositivityPetri netsterminationhierarchycoverability

Mathematics Subject Classification ID

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

Related Items

Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues, Unnamed Item, On Petri Nets with Hierarchical Special Arcs, A lazy query scheme for reachability analysis in Petri nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity results for 1-safe nets
• On the Termination of Integer Loops
• Model Checking Vector Addition Systems with one zero-test
• The Reachability Problem for Vector Addition System with One Zero-Test
• Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
• An Algorithm for the General Petri Net Reachability Problem
• Reachability in Petri Nets with Inhibitor Arcs
• On Petri Nets with Hierarchical Special Arcs
• Positivity Problems for Low-Order Linear Recurrence Sequences
• Well-structured transition systems everywhere!