A graph-theoretic optimal control problem for terminating discrete event processes

DOI10.1007/BF01797725zbMath0777.90072MaRDI QIDQ1201754

Raja Sengupta, Stéphane Lafortune

Publication date: 17 January 1993

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

zbMATH Keywords

discrete event supervisory controlfinite acyclic directed graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Related Items (4)

Network connectivity value ⋮ Supervisory control of discrete event systems ⋮ SPACETIME DISCOUNTED VALUE OF NETWORK CONNECTIVITY ⋮ Recursive computation of limited lookahead supervisory controls for discrete event systems

Cites Work

• Stabilization of discrete-event processes
• The infimal closed controllable superlanguage and its application in supervisory control
• Supervisory Control of a Class of Discrete Event Processes

This page was built for publication: A graph-theoretic optimal control problem for terminating discrete event processes