Universal safety for timed Petri nets is PSPACE-complete

DOI10.4230/LIPIcs.CONCUR.2018.6OpenAlexW2962907036MaRDI QIDQ5009418

Mohamed Faouzi Atig, Patrick Totzke, Radu Ciobanu, Richard Mayr, Parosh Aziz Abdulla

Publication date: 4 August 2021

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

zbMATH Keywords

Petri netscoverabilitysafety checkingtimed networks

Mathematics Subject Classification ID

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

Related Items (2)

Timed Basic Parallel Processes ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• PSPACE-completeness of majority automata networks
• A theory of timed automata
• Algorithmic analysis of programs with well quasi-ordered domains.
• Liveness of Parameterized Timed Networks
• Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
• Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Well-structured transition systems everywhere!

This page was built for publication: Universal safety for timed Petri nets is PSPACE-complete