Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net
DOI10.1016/j.ejcon.2023.100831zbMath1521.93105OpenAlexW4379802728MaRDI QIDQ6053940
Dimitri Lefebvre, Oussama Hayane
Publication date: 27 September 2023
Published in: European Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejcon.2023.100831
stochastic Petri netsscheduling problemsdiscrete event systemstimed Petri netstimed reachability graphs
Discrete-time control/observation systems (93C55) Discrete event control/observation systems (93C65) Stochastic systems in control theory (general) (93E03) Attainable sets, reachability (93B03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A Petri net based approach for multi-robot path planning
- Model checking of time Petri nets using the state class timed automaton
- Petri nets for modeling of dynamic systems -- a survey
- A theory of timed automata
- Approximated timed reachability graphs for the robust control of discrete event systems
- A genetic algorithm for the flexible job-shop scheduling problem
- State Estimation and Fault Diagnosis of Labeled Time Petri Net Systems With Unobservable Transitions
- The Price of Robustness
- Recoverability of Communication Protocols--Implications of a Theoretical Study
- A Survey of Scheduling Rules
- Reactive scheduling in a dynamic and stochastic FMS environment
- A Clustering Approach to Approximate the Timed Reachability Graph for a Class of Time Petri Nets
- Formal Modeling and Analysis of Timed Systems
This page was built for publication: Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net
