Hierarchical Control of Concurrent Discrete Event Systems with Linear Temporal Logic Specifications

Sakakibara, Ami; Ushio, Toshimitsu

doi:10.1587/transfun.e101.a.313

Cited by 4 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The presence of uncontrollable events in DES control problems is often considered through Rabin games, where the uncontrollable events are modeled as an adversary player [35], [36], [37]. The control specification can be modeled by both finite automata and LTL formulas.…”

Section: Introductionmentioning

confidence: 99%

Reducing the Learning Time of Reinforcement Learning for the Supervisory Control of Discrete Event Systems

et al. 2023

View full text Add to dashboard Cite

Reinforcement learning (RL) can obtain the supervisory controller for discrete-event systems modeled by finite automata and temporal logic. The published methods often have two limitations. First, a large number of training data are required to learn the RL controller. Second, the RL algorithms do not consider uncontrollable events, which are essential for supervisory control theory (SCT). To address the limitations, we first apply SCT to find the supervisors for the specifications modeled by automata. These supervisors remove illegal training data violating these specifications and hence reduce the exploration space of the RL algorithm. For the remaining specifications modeled by temporal logic, the RL algorithm is applied to search for the optimal control decision within the confined exploration space. Uncontrollable events are considered by the RL algorithm as uncertainties in the plant model. The proposed method can obtain a nonblocking supervisor for all specifications with less learning time than the published methods.

show abstract

Section: Introductionmentioning

confidence: 99%

Reducing the Learning Time of Reinforcement Learning for the Supervisory Control of Discrete Event Systems

et al. 2023

View full text Add to dashboard Cite

show abstract

“…Within the SCT community, non-terminating processes have gained more and more attention in recent years. They have, for example, been considered for using different specification languages such as linear temporal logic (LTL) [17], computational tree logic (CTL) [18], epistemic temporal logic [19], or modal logic [20]. Further, within abstraction-based controller design the resulting abstractions are typically nonterminating, motivating the use of these procedures, as, e.g., in [21].…”

Section: Introductionmentioning

confidence: 99%

Supervisory Controller Synthesis for Non-terminating Processes is an Obliging Game

Majumdar¹,

Schmuck²

2020

Preprint

View full text Add to dashboard Cite

We present a new algorithm to solve the supervisory control problem over non-terminating processes modeled as ωregular automata. A solution to the problem was obtained by Thistle in 1995 which uses complex manipulations of automata. This algorithm is notoriously hard to understand and, to the best of our knowledge, has never been implemented. We show a new solution to the problem through a reduction to reactive synthesis.A naive, and incorrect, approach reduces the supervisory control problem to a reactive synthesis problem that asks for a control strategy which ensures the given specification if the plant behaves in accordance to its liveness properties. This is insufficient. A correct control strategy might not fulfill the specification but force the plant to invalidate its liveness property. To prevent such solutions, supervisory control additionally requires that the controlled system is non-conflicting: any finite word compliant with the supervisor should be extendable to a word satisfying the plants' liveness properties.To capture this additional requirement, our solution goes through obliging games instead. An obliging game has two requirements: a strong winning condition as in reactive synthesis and a weak winning condition. A strategy is winning if it satisfies the strong condition and additionally, every partial play can be extended to satisfy the weak condition. Obliging games can be reduced to ω-regular reactive synthesis, for which symbolic algorithms exist. We reduce supervisor synthesis to obliging games. The strong condition is an implication: if the plant behaves in accordance with its liveness properties, the specification should also hold. The weak condition is the plants' liveness property.The reduction to obliging games gives a conceptually simple algorithm for supervisor synthesis over non-terminating processes. Moreover, it allows symbolic implementations of the involved constructions using symbolic tools from reactive synthesis.

show abstract

A Reactive Synthesis Approach to Supervisory Control of Terminating Processes

2020

View full text Add to dashboard Cite

Hierarchical Control of Concurrent Discrete Event Systems with Linear Temporal Logic Specifications

Cited by 4 publications

References 15 publications

Reducing the Learning Time of Reinforcement Learning for the Supervisory Control of Discrete Event Systems

Reducing the Learning Time of Reinforcement Learning for the Supervisory Control of Discrete Event Systems

Supervisory Controller Synthesis for Non-terminating Processes is an Obliging Game

A Reactive Synthesis Approach to Supervisory Control of Terminating Processes

Contact Info

Product

Resources

About