Time based deadlock prevention for Petri nets

DOI10.1016/j.automatica.2021.110119zbMath1482.93373OpenAlexW4206581661MaRDI QIDQ2071966

Qian Xing, Hanifa Boucheneb, KuangZe Wang, Zhiwu Li, Kamel Barkaoui, Gaiyun Liu

Publication date: 31 January 2022

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2021.110119

zbMATH Keywords

supervisory controlPetri netdeadlock preventiontime Petri nettime based deadlock prevention

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03)

Cites Work

• Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs
• Delay-dependent partial order reduction technique for real time systems
• Linear parametric model checking of timed automata
• Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
• TCTL Model Checking of Time Petri Nets
• An Approach to Improve Permissiveness of Supervisors for GMECs in Time Petri Net Systems
• Efficient Reachability Analysis for Time Petri Nets
• On Multi-enabledness in Time Petri Nets
• Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case

This page was built for publication: Time based deadlock prevention for Petri nets