Abstract
In the supervisory control theory of discrete event systems, since the supremal supervisor incorporates transition constrains of both the plant and the specification, the state size of the supervisor is usually large and the control logic is difficult to understand. Thus, computing for reduced supervisors with small sizes is meaningful both for designing and implementation. We propose an algorithm that a reduced supervisor can be separated from the supremal supervisor if a sufficient condition is satisfied. The algorithm for checking the sufficient condition is also presented. In the case that the sufficient condition is satisfied, a reduced supervisor can be computed in a complexity of O(m.n), where the integers m and n are the state number of the supremal supervisor and the cardinality of the event set, respectively. And the state size of the reduced supervisor is equal or less than that of the specification. Some examples are presented to illustrate the proposed approach.
This work was supported in part by the National Natural Science Foundation of China under Grant 61966008, National Natural Science Foundation of GuangXi Province, China under Grant Nos. 2018GXNSFAA294052, 2020GXNSFBA159069 and 2019JJA170060, Guangxi Science and Technology Planning Project Grant No. AB18126063, Guangxi Key Laboratory of Trusted Software (Nokx201926), and Young and Middle-aged Scientific Research Basic Ability Promotion Project of Guangxi under Grant No. 2020KY02031.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete event processes. SIAM J. Control Optim. 25(1), 206–230 (1987)
Wonham, W.M., Cai, K.: Supervisory Control of Discrete-Event Systems. Springer, Cham (2019)
Zhang, H., Feng, L., Li, Z.: A learning-based synthesis approach to the supremal nonblocking supervisor of discrete-event systems. IEEE Trans. Autom. Control 63(10), 3345–3360 (2018)
Zhang, H., Feng, L., Li, Z.: Control of black-box embedded systems by integrating automaton learning and supervisory control theory of discrete-event systems. IEEE Trans. Autom. Sci. Eng. 17(1), 361–374 (2018)
Zhang, H., Feng, L., Wu, N., Li, Z.: Control of black-box embedded systems by integrating automaton learning and supervisory control theory of discrete-event systems. IEEE Trans. Autom. Sci. Eng. 15(1), 2–15 (2018)
Vaz, A.F., Wonham, W.M.: On supervisor reduction in discrete-event systems. Int. J. Control 44(2), 475–491 (1986)
Su, R., Wonham, W.M.: Supervisor reduction for discrete-event systems. Discrete Event Dyn. Syst. 14(1), 31–53 (2004)
Su, R., Wonham, W.M.: What information really matters in supervisor reduction? Automatica 95, 368–377 (2018)
Cai, K., Wonham, W.M.: Supervisor localization: a top-down approach to distributed control of discrete-event systems. IEEE Trans. Autom. Control 55(3), 605–618 (2010)
Liu, Y., Cai, K., Li, Z.: On scalable supervisory control of multi-agent discrete-event systems. Automatica 108, 605–618 (2019)
Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems. Springer Science & Business Media, New York (2008)
Feng, L., Wonham, W. M.: TCT: a computation tool for supervisory control synthesis. In: Proceedings of the 8th International Workshop on Discrete Event Systems, pp. 388–389. IEEE, Ann Arbor (2006)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Zhang, H., Feng, L., Xie, W., Yu, F. (2020). An Approach for Supervisor Reduction of Discrete-Event Systems. In: Ben Hedia, B., Chen, YF., Liu, G., Yu, Z. (eds) Verification and Evaluation of Computer and Communication Systems. VECoS 2020. Lecture Notes in Computer Science(), vol 12519. Springer, Cham. https://doi.org/10.1007/978-3-030-65955-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-65955-4_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-65954-7
Online ISBN: 978-3-030-65955-4
eBook Packages: Computer ScienceComputer Science (R0)