Maximally permissive controller synthesis for time Petri nets

DOI10.1080/00207179.2012.743038zbMath1278.93114OpenAlexW2058408326MaRDI QIDQ2871733

Hanifa Boucheneb, Parisa Heidari

Publication date: 9 January 2014

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207179.2012.743038

zbMATH Keywords

time Petri netssafety propertiescontroller synthesison-the-fly algorithmreachability propertiesmaximally permissive controllers

Mathematics Subject Classification ID

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

Related Items (4)

Least-cost transition sequence estimation in labelled time Petri net systems with unobservable transitions ⋮ State estimation in labeled time Petri net systems using observed modified state class graph ⋮ An approach for enforcing a class of GMECs on time Petri nets with uncontrollable transitions ⋮ Approximated timed reachability graphs for the robust control of discrete event systems

Cites Work

• Unnamed Item
• TCTL Model Checking of Time Petri Nets
• Supervisory Control of a Class of Discrete Event Processes
• Synthesis of controllers for symmetric systems
• Automated Technology for Verification and Analysis
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Maximally permissive controller synthesis for time Petri nets