Near-Optimal Scheduling for Petri Net Models With Forbidden Markings

DOI10.1109/TAC.2017.2767827zbMath1423.93256OpenAlexW2765738866MaRDI QIDQ4682303

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

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

Related Items (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