Approximated timed reachability graphs for the robust control of discrete event systems

DOI10.1007/s10626-019-00275-zzbMath1425.93034OpenAlexW2911498600WikidataQ128493158 ScholiaQ128493158MaRDI QIDQ2330041

Dimitri Lefebvre

Publication date: 18 October 2019

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-019-00275-z

zbMATH Keywords

discrete event systemcontrol designMarkov decision processreachability graphtime Petri net

Mathematics Subject Classification ID

Related Items (1)

Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact decomposition approaches for Markov decision processes: a survey
• Model checking of time Petri nets using the state class timed automaton
• Optimal legal firing sequence of Petri nets using linear programming
• Maximally permissive controller synthesis for time Petri nets
• Control Design for Trajectory Tracking With Untimed Petri Nets
• State Estimation and Fault Diagnosis of Labeled Time Petri Net Systems With Unobservable Transitions
• Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms
• Principles of Sequencing and Scheduling
• Recoverability of Communication Protocols--Implications of a Theoretical Study
• Asynchronous composition of high level Petri Nets: A quantitative approach
• Verification of Reachability Properties for Time Petri Nets
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Approximated timed reachability graphs for the robust control of discrete event systems