On the Computation of Natural Observers for Extended Finite Automata

Shoaei, Mohammad Reza; Feng, Lei; Lennartson, Bengt

doi:10.3182/20140824-6-za-1003.02178

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several synthesis algorithms for EFSMs have been proposed [10,14,17,28], which explore the full system state space, including all possible combinations of variable values. The resulting complexity can be avoided to some extent using symbolic representation [14] or abstraction [22,23,28].…”

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

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