Learn More
Control of discrete-event systems with partial observations is treated by concepts and results of coalgebra and coinduction. Coalgebra is part of abstract algebra and enables a generalization of the computer science concept of bisimulation. It can be applied to automata theory and then provides a powerful algebraic tool to treat problems of supervisory(More)
The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for the verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also(More)
Jan H. van Schuppen CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands Email J.H.van.Schuppen@cwi.nl Olivier Boutin CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands Email olivier.research@gmail.com Pia L. Kempker Department of Mathematics, VU University Amsterdam, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands Email p.l.kempker@vu.nl Jan(More)
For supervisory control of large-scale modular DES the possibility of performing control-related computation locally (in components) is of utmost importance to computational complexity. Unlike our previous results, where the specification language is decomposable into local specification languages, this paper concerns the case of general specification(More)
Coalgebraic techniques are applied to the supervisory control of discrete-event systems with partial observations. Classical notions from concurrency theory are specialized to control theory. The concept of weak transitions enables the relational characterization of observability and gives rise to a coalgebraic formulation of the necessary and sufficient(More)
Coalgebraic methods provide new results and insights for modular supervisory control of discrete-event systems (DES), where the overall system is composed of subsystems that are themselves partially observed DES. It is well known that the computation of supremal normal sublanguages is computationally very difficult. The attention of this paper is focused on(More)
Most of the large scale state transition (also called discrete-event) systems are formed as parallel compositions of many small subsystems (modules). Control of modular and distributed discrete-event systems appears as an approach to handle computational complexity of synthesizing supervisory controllers for large scale systems. For both modular and(More)
The paper presents sufficient conditions for modular (supervisory) control synthesis to equal global control synthesis. In modular control synthesis a supervisory control is synthesized for each module separately and the supervisory control consists of the parallel composition of the modular supervisory controls. The general case of the specification that(More)
Supervisory control of distributed DES with a global specification and local supervisors is a difficult problem. For global specifications the equivalent conditions for local control synthesis to equal global control synthesis may not be met. This paper formulates and solves a control synthesis problem for a generator with a global specification and with a(More)