Abstract

In this paper, we study the problem of supervisor synthesis for a class of discrete event systems for optimal throughput based on the timed discrete event modelling formalism. First, a language-based definition for the concept of throughput is presented. Then, we formulate the supervisor synthesis problem with both logic correctness and time-related optimal performance objective, namely throughput. After we show the existence of supremal controllable sublanguage with maximum throughput and minimum transient makespan, an algorithm is provided to compute such a supervisor.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call