Deciding Structural Liveness of Petri Nets

DOI10.1007/978-3-319-51963-0_8zbMath1425.68295arXiv1608.02327OpenAlexW2556868555MaRDI QIDQ2971127

Petr Jančar

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items

Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable

Uses Software

• Easychair

Cites Work

• Unnamed Item
• Existence of home states in Petri nets is decidable
• The covering and boundedness problems for vector addition systems
• Algorithmic analysis of programs with well quasi-ordered domains.
• Semigroups, Presburger formulas, and languages
• Forward Analysis for WSTS, Part II: Complete WSTS
• Entscheidbarkeit bei Petri Netzen
• An Algorithm for the General Petri Net Reachability Problem
• Demystifying Reachability in Vector Addition Systems
• Understanding Petri Nets
• Presburger Vector Addition Systems
• Well-structured transition systems everywhere!