Abstract
Supervisory control ensures safe coordination of the discrete-event behavior of the components of a given system. Models of supervisory control software are automatically synthesized based on formal models of the unsupervised system and the coordination requirements. To provide for a greater modeling convenience and to better the expressivity of the model-based systems and software engineering framework, several extensions of supervisory control theory with variables have been proposed. Supervisory control theory studies automated synthesis of supervisory controllers, where the central notion of controllability characterizes the notion of a model of a supervisory controller. One of the most prominent extensions of the theory with data is implemented by means of extended finite automata with variables. We revisit the notion of controllability for these models and we show that the relations that capture existing notions of controllability for finite automata with variables do not have desirable algebraic properties, i.e., they are not a preorders. We propose an alternative notion of controllability based on a behavioral relation termed partial bisimulation. We show that the proposed extension of partial bisimulation for finite automata with variables subsumes existing notions and we discuss its role in a proposed model-based engineering framework.
The work presented in this paper is supported by the Dutch NWO project ProThOS, no. 600.065.120.11.
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
References
Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science, vol. 50. Cambridge University Press, Cambridge (2010)
Baeten, J.C.M., van Beek, D.A., Luttik, B., Markovski, J., Rooda, J.E.: A process-theoretic approach to supervisory control theory. In: Proceedings of ACC 2011, pp. 4496–4501. IEEE (2011)
Baeten, J., van Beek, D., van Hulst, A., Markovski, J.: A process algebra for supervisory coordination. In: Proceedings of PACO 2011. EPTCS, vol. 60, pp. 36–55. Open Publishing Association (2011)
Cassandras, C., Lafortune, S.: Introduction to Discrete Event Systems. Kluwer Academic Publishers, Dordrecht (2004)
Chen, Y.L., Lin, F.: Modeling of discrete event systems using finite state machines with parameters. In: Proceedings of CCA 2000, pp. 941–946 (2000)
Eshuis, R., Fokkinga, M.M.: Comparing refinements for failure and bisimulation semantics. Fund. Inform. 52(4), 297–321 (2002)
Fabian, M., Lennartson, B.: On non-deterministic supervisory control. In: Proceedings of the 35th IEEE Decision and Control, vol. 2, pp. 2213–2218 (1996)
Gaudin, B., Deussen, P.: Supervisory control on concurrent discrete event systems with variables. In: Proceedings of ACC 2007, pp. 4274–4279 (2007)
van Glabbeek, R.J.: The linear time-branching time spectrum I. In: Bergstra, J.A., et al. (eds.) Handbook of Process Algebra, Chap. 1, pp. 3–99. Elsevier, Amsterdam (2001)
Kirilov, A., Martinovikj, D., Mishevski, K., Petkovska, M., Trajcheska, Z., Markovski, J.: A supervisor synthesis tool for finite nondeterministic automata with data. In: Counsell, S., Núñez, M. (eds.) SEFM 2013. LNCS, vol. 8368, pp. 101–112. Springer, Heidelberg (2014)
Leveson, N.: The challenge of building process-control software. IEEE Softw. 7(6), 55–62 (1990)
Ma, C., Wonham, W.M.: Nonblocking Supervisory Contr. LNCIS, vol. 317, pp. 1–9. Springer, Heidelberg (2005)
Markovski, J.: Coarsest controllability-preserving plant minimization. In: Proceedings of WODES 2012, pp. 251–258. IFAC (2012)
Markovski, J.: Communicating processes with data for supervisory coordination. In: Proceedings of FOCLASA 2012. EPTCS, vol. 91, pp. 97–111. Open Publishing Association (2012)
Markovski, J., van Beek, D.A., Theunissen, R.J.M., Jacobs, K.G.M., Rooda, J.E.: A state-based framework for supervisory control synthesis and verification. In: Proceedings of CDC 2010, pp. 3481–3486. IEEE (2010)
Miremadi, S., Akesson, K., Lennartson, B.: Extraction and representation of a supervisor using guards in extended finite automata. In: Proceedings of WODES 2008, pp. 193–199. IEEE (2008)
Overkamp, A.: Supervisory control using failure semantics and partial specifications. IEEE Trans. Autom. Control 42(4), 498–510 (1997)
Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete-event processes. SIAM J. Control Optim. 25(1), 206–230 (1987)
Rutten, J.J.M.M.: Coalgebra, concurrency, and control. In: Proceedings of WODES 2000, pp. 31–38. Kluwer Academic Publishers, Dordrecht (2000)
Schiffelers, R.R.H., Theunissen, R.J.M., van Beek, D.A., Rooda, J.E.: Model-based engineering of supervisory controllers using CIF. Electron. Commun. EASST 21, 1–10 (2009)
Skoldstam, M., Akesson, K., Fabian, M.: Modeling of discrete event systems using finite automata with variables. In: Proceedings of CDC 2007, pp. 3387–3392. IEEE (2007)
Woodcock, J., Larsen, P.G., Bicarregui, J., Fitzgerald, J.: Formal methods: practice and experience. ACM Comput. Surv. 41(4), 1–36 (2009)
Zhou, C., Kumar, R., Jiang, S.: Control of nondeterministic discrete-event systems for bisimulation equivalence. IEEE Trans. Autom. Control 51(5), 754–765 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Markovski, J. (2014). Controllability for Nondeterministic Discrete-Event Systems with Data. In: Cordeiro, J., van Sinderen, M. (eds) Software Technologies. ICSOFT 2013. Communications in Computer and Information Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44920-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-662-44920-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44919-6
Online ISBN: 978-3-662-44920-2
eBook Packages: Computer ScienceComputer Science (R0)