An Algorithm for Weak Synthesis Observation Equivalence for Compositional Supervisor Synthesis

Mohajerani, Sahar; Malik, Robi; Fabian, Martin

doi:10.3182/20121003-3-mx-4033.00040

Cited by 6 publications

(12 citation statements)

References 9 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, such a minimization is not the coarsest minimization possible with respect to the notion of controllability employed. Plant or supervisor abstraction (Flordal et al 2007;Su et al 2010;Schmidt and Cury 2012;Mohajerani et al 2012) are related techniques for (supervised) plant minimization that aim to optimize the synthesis procedure, typically employed in compositional, modular, or hierarchical synthesis. The former technique abstracts away local events during compositional synthesis that no longer play a role in the synthesis procedure and cannot ruin controllability.…”

Section: Related Workmentioning

confidence: 99%

Employing behavioral preorders to define controllability for nondeterministic discrete-event systems

Markovski

2014

Discrete Event Dyn Syst

View full text Add to dashboard Cite

Citation for published version (APA): Markovski, J. (2015). Employing behavioral preorders to define controllability for nondeterministic discrete-event systems. Discrete Event Dynamic Systems, 25(1-2), 227-250. DOI: 10.1007/s10626-014-0201-y DOI:10.1007/s10626-014-0201-y Document status and date:Published: 01/06/2015 Document Version:Publisher's PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication:• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the 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 rightsCopyright 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. Abstract We employ the behavioral preorder termed partial bisimulation to define controllability for nondeterministic discrete-event systems. The preorder induces a refinements relation between the models of the controlled and the original system, that captures a notion of controllability. We define a notion of a model of a deterministic supervisory controller and we compare our approach to existing ones in the literature. We show that the equivalence relation, induced by the partial bisimulation preorder, can be employed to minimize the model of the unsupervised system. We develop an efficient minimization algorithm, by characterizing the preorders as partition-relation pairs under stability conditions.

show abstract

Section: Related Workmentioning

confidence: 99%

Employing behavioral preorders to define controllability for nondeterministic discrete-event systems

Markovski

2014

Discrete Event Dyn Syst

View full text Add to dashboard Cite

show abstract

“…In order to investigate the effect of observation properties on control behavior, the observation equivalence is defined. However, the observation equivalence has been defined in [19] for nondeterministic automata, in this paper observation equivalence describes the equivalence of observation properties in decentralized (local) controllers and the monolithic supervisor. This definition considers the effect of observation restrictions on control behavior in decentralized (local) controllers.…”

Section: Introductionmentioning

confidence: 99%

Distributed supervisory control with partial observation

Saeidi

Afzalian

Gharavian

2016

2016 4th International Conference on Control, Instrumentation, and Automation (ICCIA)

View full text Add to dashboard Cite

Distributed supervisory control is a method to synthesize local controllers without any restriction on observation of the plant. Since the set algebra preserves relationships between variables and provides a simpler way to develop theories, the observation properties are redefined and corresponding propositions are proved by set algebra, in this paper. Moreover, we define new observation properties, i.e. local normality and local relative observability for the local controllers which constructed by any localization algorithm that preserves control equivalent to monolithic supervisor w.r.t. the plant. These properties enable us to investigate the observation problem from monolithic to distributed supervisory control. Furthermore, observation equivalence property is defined corresponding to the control equivalence in distributed supervisory control with partial observation. It is proved that, providing observation equivalence of the local controllers to the monolithic supervisor w.r.t. the plant, the control equivalence is satisfied, if and only if the intersection of local events sets is a subset or equal to the global observable events set.

show abstract

“…In [5], [14], [15], synthesis is considered in a nondeterministic setting, which leads to some problems when interpreting results and ensuring least restrictiveness. These problems are overcome to some extent by synthesis abstraction [16]- [19]. Several compositional synthesis methods require all automata and their abstraction results to be deterministic, which makes some desirable abstractions impossible.…”

Section: Introductionmentioning

confidence: 99%

“…This paper presents a compositional synthesis approach with abstraction methods that guarantee the preservation of the final synthesis result. A data structure called synthesis triple is intro-duced to combine abstraction methods [14], [16]- [19] together with renaming. This is a general framework intended for use with a variety of present and future means of abstraction.…”

Section: Introductionmentioning

confidence: 99%

“…This is a general framework intended for use with a variety of present and future means of abstraction. The implementation presented in this paper uses halfway synthesis, which is adapted from [14] and observation equivalencebased abstractions [18], [19], which have higher abstraction potential than methods based on natural projection [18]. These methods allow for the abstraction of observable events in such a way that abstracted events can still be used by supervisor components synthesised at a later stage.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Framework for Compositional Synthesis of Modular Nonblocking Supervisors

Mohajerani

Malik

Fabian

2014

IEEE Trans. Automat. Contr.

Self Cite

View full text Add to dashboard Cite

This paper describes a framework for compositional supervisor synthesis, which is applicable to all discrete event systems modelled as a set of deterministic automata. Compositional synthesis exploits the modular structure of the input model, and therefore works best for models consisting of a large number of small automata. The state-space explosion is mitigated by the use of abstraction to simplify individual components, and the property of synthesis equivalence guarantees that the final synthesis result is the same as it would have been for the non-abstracted model. The paper describes synthesis equivalent abstractions and shows their use in an algorithm to efficiently compute supervisors. The algorithm has been implemented in the DES software tool Supremica and successfully computes nonblocking modular supervisors, even for systems with more than 10 14 reachable states, in less than 30 seconds.

show abstract

An Algorithm for Weak Synthesis Observation Equivalence for Compositional Supervisor Synthesis

Cited by 6 publications

References 9 publications

Employing behavioral preorders to define controllability for nondeterministic discrete-event systems

Employing behavioral preorders to define controllability for nondeterministic discrete-event systems

Distributed supervisory control with partial observation

A Framework for Compositional Synthesis of Modular Nonblocking Supervisors

Contact Info

Product

Resources

About