Bounded-Time Nonblocking Supervisory Control of Timed Discrete-Event Systems (2403.08781v2)
Abstract: Recently an automaton property of quantitative nonblockingness was proposed in supervisory control of untimed discrete-event systems (DES), which quantifies the standard nonblocking property by capturing the practical requirement that all tasks be completed within a bounded number of steps. However, in practice tasks may be further required to be completed in specific time. To meet this new requirement, in this paper we introduce the concept of bounded-time nonblockingness, which extends the concept of quantitative nonblockingness from untimed DES to timed DES. This property requires that each task must be completed within a bounded time counted by the number of ticks, rather than bounded number of transition steps in quantitative nonblockingness. Accordingly, we formulate a new bounded-time nonblocking supervisory control problem (BTNSCP) of timed DES, and characterize its solvability in terms of a new concept of bounded-time language completability. Then we present an approach to compute the maximally permissive solution to the new BTNSCP.
- P. Ramadge and W. Wonham, “Supervisory control of a class of discrete event processes,” SIAM Journal on Control and Optimization, vol. 25, no. 1, pp. 206–230, 1987.
- W. Wonham and P. Ramadge, “On the supremal controllable sublanguage of a given language,” SIAM Journal on Control and Optimization, vol. 25, no. 3, pp. 637–659, 1987.
- P. Ramadge and W. Wonham, “The control of discrete event systems,” The Proceedings of IEEE, vol. 77, no. 1, pp. 81–98, 1989.
- W. Wonham, K. Cai, and K. Rudie, “Supervisory control of discrete-event systems: a brief history,” Annual Reviews in Control, vol. 45, pp. 250–256, 2018.
- B. Brandin and W. Wonham, “Supervisory control of timed discrete-event systems,” IEEE Transactions on Automatic Control, vol. 39, no. 2, pp. 329–342, 1994.
- R. Kumar and M. Shayman, “Non-blocking supervisory control of deterministic discrete event systems,” in Proc. 1994 American Control Conference, 1994, pp. 1089–1093.
- M. Fabian and R. Kumar, “Mutually nonblocking supervisory control of discrete event systems,” in Proc. 36th IEEE Conference on Decision and Control, 1997, pp. 2970–2975.
- C. Ma and W. Wonham, “Nonblocking supervisory control of state tree structures,” IEEE Transactions on Automatic Control, vol. 51, no. 5, pp. 782–793, 2006.
- R. Malik and R. Leduc, “Generalised nonblocking,” in Proc. 9th International Workshop on Discrete Event Systems, 2008, pp. 340–345.
- S. Balemi, G. Hoffmann, P. Gyugyi, H. Wong-Toi, and G. Franklin, “Supervisory control of a rapid thermal multiprocessor,” IEEE Transactions on Automatic Control, vol. 38, no. 7, pp. 1040–1059, 1993.
- B. Brandin and F. Charbonnier, “The supervisory control of the automated manufacturing system of the aip,” in Proc. Rensselaer’s 4th Int. Conf. Computer Integrated Manufacturing and Automation Technology, 1994, pp. 319–324.
- P. Malik, “From supervisory control to nonblocking controllers for discrete event systems,” Ph.D. dissertation, University of Kaiserslautern, 2003.
- R. Zhang, Z. Wang, and K. Cai, “N-step nonblocking supervisory control of discrete-event systems,” in Proc. 2021 60th IEEE Conference on Decision and Control (CDC), Austin, Texas, December 13-15 2021, pp. 339–344.
- R. Zhang, J. Wang, Z. Wang, and K. Cai, “Quantitatively nonblocking supervisory control of discrete-event systems,” Tech. Rep., 2022, available at https://arxiv.org/abs/2108.00721.
- B. Bonakdarpour and S. Kulkarni, “Complexity issues in automated addition of time-bounded liveness properties,” Department of Computer Science and Engineering, Michigan State University, Tech. Rep., 2006.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.