Supervisory Control of Fair Discrete-Event Systems: A Canonical Temporal Logic Foundation

Seow, Kiam Tian

doi:10.1109/tac.2020.3037156

Cited by 8 publications

(12 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Our approach remedies the shortcoming that ω−nonblockingness is not guaranteed in the infinite behavior obtained by the Thistle's approach [3]- [5]. Moreover, our approach imposes no additional restrictions compared with the Seow's approach [6].…”

Section: )mentioning

confidence: 98%

“…3) To depict livelock-freeness from the perspective of languages, we propose the definition of markability of a given ω−language to ensure that the infinite strings will always visit some marker states. This definition differs from the marker states in the definition of M−directingness [6], where the marker states are similar to states in the Büchi acceptance criterion. Moreover, properties and computation approaches related to markability are also presented.…”

Section: )mentioning

confidence: 99%

“…In [1] and references therein, both the closed language and marker language are utilized to analyze the controlled behavior of the plant. The existence and synthesis results of state feedback for marker-progressive control of fair DES are presented in [6], where the supervisory control problem is formulated in linear-time temporal logic. In [7], an obliging game is employed to solve the supervisory control problem over non-terminating processes modeled as ω−regular automata.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

$ω-$nonblocking supervisory control of discrete-event systems with infinite behavior

Jiao¹,

Zhang²,

Cai³

2021

Preprint

View full text Add to dashboard Cite

In the supervisory control framework of discreteevent systems (DES) with infinite behavior initiated by Thistle and Wonham, a supervisor satisfying the minimal acceptable specification and the maximal legal specification is synthesized. However, this supervisor may incur livelocks as it cannot ensure that the infinite behavior under supervision will always visit some marker states. To tackle this problem, we propose the definition of markability by requiring that all infinite cycles include at least one marker state. Then we formulate the problem of ω−nonblocking supervisory control of DES with infinite behavior to synthesize an ω−nonblocking (i.e. nonblocking, deadlock-free and livelock-free) supervisor. An algorithm is proposed to achieve ω−nonblockingness by computing the supremal * −controllable, * −closed, ω−controllable and markable sublanguage. We utilize the example of a robot as a running example.

show abstract

Section: )mentioning

confidence: 98%

Section: )mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

$ω-$nonblocking supervisory control of discrete-event systems with infinite behavior

Jiao¹,

Zhang²,

Cai³

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…However, in general, it is difficult to convert the desired property into a formal language precisely. To overcome this issue, temporal logic has been leveraged [15]- [18]. It has been developed in computer engineering fields as a formalism of formal specifications [19], [20].…”

Section: Introductionmentioning

confidence: 99%

“…Proof: We choose an optimal directed controller SV d * arbitrarily. To establish (18), it is sufficient to show that, for any s ∈ S ⊗ and any ρ ∈ Inf P ath Proposition 2: Given a product SDES D ⊗ associated with an LTL formula ϕ and the reward function R defined as (4), for any optimal directed controller SV d * and any state s ∈ S ⊗ , the following equation holds.…”

mentioning

confidence: 99%

Bounded Synthesis and Reinforcement Learning of Supervisors for Stochastic Discrete Event Systems with LTL Specifications

Oura¹,

Ushio²,

Sakakibara³

2021

Preprint

View full text Add to dashboard Cite

In this paper, we consider supervisory control of stochastic discrete event systems (SDESs) under linear temporal logic specifications. Applying the bounded synthesis, we reduce the supervisor synthesis into a problem of satisfying a safety condition. First, we consider a synthesis problem of a directed controller using the safety condition. We assign a negative reward to the unsafe states and introduce an expected return with a statedependent discount factor. We compute a winning region and a directed controller with the maximum satisfaction probability using a dynamic programming method, where the expected return is used as a value function. Next, we construct a permissive supervisor via the optimal value function. We show that the supervisor accomplishes the maximum satisfaction probability and maximizes the reachable set within the winning region. Finally, for an unknown SDES, we propose a two-stage modelfree reinforcement learning method for efficient learning of the winning region and the directed controllers with the maximum satisfaction probability. We also demonstrate the effectiveness of the proposed method by simulation.

show abstract

Offline supervisory control synthesis: taxonomy and recent developments

Fokkink,

Goorden

2024

Discrete Event Dyn Syst

View full text Add to dashboard Cite

This paper surveys recent advances in supervisory control theory since its 30th anniversary in 2017. We performed a systematic literature search and selected 272 relevant papers, with a focus on automata-based approaches. These were fitted into coherent narratives, based in part on a taxonomy of supervisor synthesis methods. The obtained papers show the fast and vast progress of the field, where recent research covers a wide range of new synthesis optimization techniques, different aspects such as fault tolerance, security, and timing, and new and diverse application domains. This survey refrains from in-depth descriptions of techniques, instead focusing on high-level contributions of recent works, how they relate to each other, and future directions for research.

show abstract

Supervisory Control of Fair Discrete-Event Systems: A Canonical Temporal Logic Foundation

Cited by 8 publications

References 43 publications

$ω-$nonblocking supervisory control of discrete-event systems with infinite behavior

$ω-$nonblocking supervisory control of discrete-event systems with infinite behavior

Bounded Synthesis and Reinforcement Learning of Supervisors for Stochastic Discrete Event Systems with LTL Specifications

Offline supervisory control synthesis: taxonomy and recent developments

Contact Info

Product

Resources

About