Modular supervisor synthesis for extended finite-state machines subject to controllability

Malik, Robi; Teixeira, Marcelo

doi:10.1109/wodes.2016.7497831

Cited by 12 publications

(23 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2) A motivating gap in using SpFSA models: Despite possible modeling advantages brought by the easy way conditions and behaviors are expressed, SpFSA are entities that do not fully exploit modularization. There are variable abstraction techniques [9] that work modularly [7] by removing unnecessary variables from control synthesis, chosen according to the role they play in control. This reduces a lot the computational effort needed to process the SpFSA-based synthesis.…”

Section: Parameterization Of Statesmentioning

confidence: 99%

See 1 more Smart Citation

Combining Advantages from Parameters in Modeling and Control of Discrete Event Systems

Southier

Mazzetto

Casanova

et al. 2019

2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

Self Cite

View full text Add to dashboard Cite

Although Finite-State Automata (FSA) have been successfully used in modeling and control of Discrete Event Systems (DESs), they are limited to represent complex and advanced features of DESs, such as context recognition and switching. The literature has suggested that a FSA can nevertheless be enriched with parameters properly collected from the modeled system, so that this favors design and control. A parameter can be embedded either on transitions or states. However, each approach is structured within a specific framework, so that their comparison and integration are not straightforward and they may lead to different control solutions, modeled, computed and implemented using distinct strategies. In this paper, we show how to combine advantages from parameters in modeling and control of DESs. Each approach is structured and their advantages are identified and exemplified. Then, we propose a conversion method that allows to translate a design-friendly model into a synthesisefficient structure. Examples illustrate the approach.

show abstract

Section: Parameterization Of Statesmentioning

confidence: 99%

“…complex systems. Advanced features of flexible DES, such as context recognition and switching, are difficult to be expressed through ordinary FSA and they are usually associated with complex models, both in terms of modeling and processing [2], [7], [8]. Parameterized FSA allow to address complexity issues in modeling and control of DESs.…”

Section: Introductionmentioning

confidence: 99%

Combining Advantages from Parameters in Modeling and Control of Discrete Event Systems

Southier

Mazzetto

Casanova

et al. 2019

2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

Self Cite

View full text Add to dashboard Cite

show abstract

“…8. Suppose that the reference event set is Σ = {1, 2,3,4,6,8,10,12,14,16,18,20,22}, the observable event set is Σ 0 = {2, 3, 8,16,18,20,22} and the controllable event set is Σ c = {1, 3}. Thus, by definition of the natural projection P : Σ Ã →Σ Ã 0 , where P is natural observer for L m (G) and is QOCC for L(G), the projection of the plant is given in Fig.…”

Section: Optimal Non-blocking Decentralized Supervisory Control Bmentioning

confidence: 99%

Optimal non‐blocking decentralized supervisory control with unobservable controllable events

Saeidi

Afzalian

Gharavian

2018

Asian Journal of Control

View full text Add to dashboard Cite

Paranormality is an observation property of a language, in which the occurrence of unobservable events never exits the closure of the language. In this paper, a synthesis method is proposed to construct a paranormal supervisor. We propose a method to construct a controllable language such that the occurrence of unobservable events does not exit the closure of the controllable language. Moreover, a new observation property, that is, Quasi Output Control Consistency (QOCC) is defined to construct the optimal (least restrictive) non-blocking decentralized supervisory control in the presence of unobservable controllable events. Using QOCC and natural observer properties, we propose a method to construct a normal supervisor such that an arbitrary pair of lookalike strings are initiated and terminated with identical observable and uncontrollable events. It is assumed that one of these strings has unobservable controllable events. An OCC property is defined in the literature as a special case of QOCC property, where none of the lookalike strings has unobservable controllable events.

show abstract

“…Recently, a modular approach for the synthesis of least restrictive and controllable supervisors from plants modelled with EFSMs has been proposed [12], which generalises earlier work on modular synthesis without variables [1,2]. The approach considers only prefix-closed behaviours, and the system model consists of several interacting plant and specification components.…”

Section: Introductionmentioning

confidence: 99%

“…In this case, synthesis can be performed separately for each specification EFSM, and the results can be combined to form a modular supervisor. For each specification, the algorithm [12] iteratively selects plant components to be included in synthesis until a least restrictive controllable solution is found. The obtained modular supervisors, in combination, achieve the least restrictive controllable behaviour for the entire system.…”

Section: Introductionmentioning

confidence: 99%

Synthesis of least restrictive controllable supervisors for extended finite-state machines with variable abstraction

Malik

Teixeira

2020

Discrete Event Dyn Syst

Self Cite

View full text Add to dashboard Cite

This paper presents an algorithm that combines modular synthesis for extended finite-state machines (EFSM) with abstraction of variables by symbolic manipulation, in order to compute least restrictive controllable supervisors. Given a modular EFSM system consisting of several components, the proposed algorithm synthesises a separate supervisor for each specification component. To synthesise each supervisor, the algorithm iteratively selects components (plants and variables) from a synchronous composition until a least restrictive controllable solution is obtained. This improves on previous results of the authors where abstraction is only performed by the selection of components and not variables. The paper explains the theory of EFSM synthesis and abstraction and its algorithms. An example of a flexible manufacturing system illustrates how the proposed algorithm works to compute a modular supervisor.

show abstract

Modular supervisor synthesis for extended finite-state machines subject to controllability

Cited by 12 publications

References 13 publications

Combining Advantages from Parameters in Modeling and Control of Discrete Event Systems

Combining Advantages from Parameters in Modeling and Control of Discrete Event Systems

Optimal non‐blocking decentralized supervisory control with unobservable controllable events

Synthesis of least restrictive controllable supervisors for extended finite-state machines with variable abstraction

Contact Info

Product

Resources

About