Decentralized Supervision and Coordination of Concurrent Discrete Event Systems under LTL Constraints

Sakakibara, Ami; Ushio, Toshimitsu

doi:10.1016/j.ifacol.2018.06.271

Cited by 8 publications

(5 citation statements)

References 9 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

“…For this reason, linear temporal logic (LTL) [3] is paid much attention to as a formal specification language for control problems, thanks to its rich expressiveness. Controller synthesis problems with temporal logic specifications are widely studied for many types of system models [4]- [8]. It is practically acceptable to restrict the specification language to a subclass of LTL like syntactically co-safe LTL (scLTL), for which synthesis problems can be solved in much less complexity than for the case of the general LTL [9].…”

Section: Introductionmentioning

confidence: 99%

On-Line Permissive Supervisory Control of Discrete Event Systems for scLTL Specifications

Sakakibara

Ushio

2020

IEEE Control Syst. Lett.

Self Cite

View full text Add to dashboard Cite

We propose an on-line supervisory control scheme for discrete event systems (DESs), where a control specification is described by a fragment of linear temporal logic. On the product automaton of the DES and an acceptor for the specification, we define a ranking function that returns the minimum number of steps required to reach an accepting state from each state. In addition, we introduce a permissiveness function that indicates a time-varying permissive level. At each step during the online control scheme, the supervisor refers to the permissiveness function as well as the ranking function in order to guarantee the control specification while handling the tradeoff between its permissiveness and acceptance of the specification. The proposed scheme is demonstrated in a surveillance problem for a mobile robot.Index Terms-On-line supervisory control, discrete event systems, syntactically co-safe linear temporal logic, ranking function.

show abstract

“…Moreover, its analysis and controlling are much complicated and sometimes remain NP-hard. The decentralized supervision of DES has been studied for automata models as a well-explored topic by a deluge of researchers; many contributions can be found in Cai and Wonham (2009); Giua et al (2017); Mannani and Gohari (2008); Miranbeigi et al (2017); Qamsane et al (2016); Sakakibara and Ushio (2018); Stursberg and Hillmann (2017); Tebekaemia and Wijesekerab (2019); Tong et al (2018); Wong and Lee (2002); and Yoo and Lafortune (2005). However, few contributions can be found using Petri nets paradigm.…”

Section: Introductionmentioning

confidence: 99%

Optimal enforcement of liveness for decentralized systems of flexible manufacturing systems using Petri nets

Bashir

2020

Transactions of the Institute of Measurement and Control

View full text Add to dashboard Cite

The decentralized supervisory structure has drawn much attention in recent years. Many studies are reported in the paradigm of automata while few can be found in the Petri net model. This paper proposes a new method for decentralized supervisory control using the Petri net paradigm. Two efficient Algorithms are developed in the proposed method. Algorithm 1 is used to compute decentralized working zones from the given LS3PR Petri net model for flexible manufacturing systems. Algorithm 2 is used to compute the decentralized controllers that enforced liveness to the decentralized working zones. The sequential assembling is used to reconnect and controlled the working zones via decentralized controllers. The decentralized controller is added to the decentralized working zones that have common elements, that is, common transitions. The proposed method has the following advantages: (i) it can be applied to a complex Petri net model for flexible manufacturing systems, (ii) the proposed methods has less computational complexity when compared with the previous methods, (iii) the proposed method can obtain a minimal number of decentralized controllers that enforce liveness of the uncontrolled Petri net model. Experimental examples are presented to explore the applicability of the proposed methods.

show abstract

Decentralized Supervision and Coordination of Concurrent Discrete Event Systems under LTL Constraints

Cited by 8 publications

References 9 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

On-Line Permissive Supervisory Control of Discrete Event Systems for scLTL Specifications

Optimal enforcement of liveness for decentralized systems of flexible manufacturing systems using Petri nets

Contact Info

Product

Resources

About