A supervisor synthesis tool for finite nondeterministic automata with data

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Supervisory control theory deals with automated synthesis of models of supervisory controllers based on the models of the unsupervised systems and the control requirements. The models of the supervisory controllers are referred to as supervisors. We present a supervisor synthesis tool for finite nondeterministic automata with data-based control requirements. The tool implements a process-theoretic approach to supervisory control theory, which employs the behavioral preorder partial bisimulation to characterize the notion of a supervisor. To illustrate the tool, we remodel an industrial case study dealing with coordination of maintenance procedures of a printing process of a high-tech printer. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Kirilov, A., Martinovikj, D., Mishevski, K., Petkovska, M., Trajcheska, Z., & Markovski, J. (2014). A supervisor synthesis tool for finite nondeterministic automata with data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8368 LNCS, pp. 101–112). Springer Verlag. https://doi.org/10.1007/978-3-319-05032-4_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free