Abstractions for nonblocking supervisory control of Extended Finite Automata

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

doi:10.1109/coase.2012.6386446

Cited by 6 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The straightforward synthesis algorithms explore the full system state space, including all possible combinations of variable values, and this can result in prohibitively many states. This complexity can be avoided to some extent using symbolic representation [5] or abstraction [7], [8].…”

Section: Introductionmentioning

confidence: 99%

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

Malik

Teixeira

2016

2016 13th International Workshop on Discrete Event Systems (WODES)

View full text Add to dashboard Cite

This paper proposes an algorithm for the synthesis of modular supervisors using extended finite-state machines, i.e., state machines with variables and guards on the transitions. Synthesis is performed by iteratively selecting components from a synchronous composition until a least restrictive controllable solution is obtained. This method is usually faster and produces smaller supervisors than standard monolithic synthesis, while offering the modelling benefits of variables. An example of manufacturing system control illustrates the approach.

show abstract

Section: Introductionmentioning

confidence: 99%

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

Malik

Teixeira

2016

2016 13th International Workshop on Discrete Event Systems (WODES)

View full text Add to dashboard Cite

show abstract

“…Even when restricting ourselves to only BDD-based supervisor synthesis of EFA, there is no consensus in literature on how to express the supervisor synthesis effort. Several metrics are used, such as: wall clock time, peak random access memory and state space sizes [6], [8], [14], [16], [17]. These metrics give some intuitive indication on the supervisor synthesis effort, but there is no exact method on how to interpret them.…”

Section: Computational Effort Of Bdd-based Supervisor Synthesis Of Exmentioning

confidence: 99%

“…In this paper, we present peak used BDD nodes and BDD operation count as deterministic, platform independent metrics that provide a quantitative indication of the supervisor synthesis effort. Peak used BDD nodes has been used to express supervisor synthesis effort [12], [16]- [18]. The contribution of BDD operation count is novel in this context.…”

Section: Computational Effort Of Bdd-based Supervisor Synthesis Of Exmentioning

confidence: 99%

Computational Effort of BDD-based Supervisor Synthesis of Extended Finite Automata

Thuijsman

Hendriks²,

Theunissen³

et al. 2019

2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)

View full text Add to dashboard Cite

DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

show abstract

“…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

Abstractions for nonblocking supervisory control of Extended Finite Automata

Cited by 6 publications

References 25 publications

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

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

Computational Effort of BDD-based Supervisor Synthesis of Extended Finite Automata

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

Contact Info

Product

Resources

About