Near-Optimal Scheduling for Petri Net Models With Forbidden Markings

DOI10.1109/TAC.2017.2767827MaRDI QIDQ4682303zbMATH OpenOpenAlexFDO

Authors Dimitri Lefebvre

Publication date 18 September 2018

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2017.2767827

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Stochastic scheduling theory in operations research (90B36) Discrete event control/observation systems (93C65)

Recommendations

• scientific article; zbMATH DE number 4074795
• scientific article; zbMATH DE number 3896317
• Timing constraint Petri nets and their schedulability analysis and verification
• Timing constraint Petri nets and their schedulability analysis and verification
• Optimal Petri net supervisor synthesis for forbidden state problems using marking mask
• scientific article; zbMATH DE number 2058666
• Extreme runtimes of schedules modelled by time Petri nets
• Petri net based scheduling
• COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION
• scientific article; zbMATH DE number 5499378

Cited in

(1)

• An approach for enforcing a class of GMECs on time Petri nets with uncontrollable transitions

This page was built for publication: Near-Optimal Scheduling for Petri Net Models With Forbidden Markings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682303)