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

Abstract

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.