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)
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)
In this paper, we revise and further investigate the coordination control approach proposed for supervisory control of distributed discrete-event systems with synchronous communication based on the Ramadge-Wonham automata framework. The notions of conditional decomposability, conditional controllability, and conditional closedness ensuring the existence of(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)
  • Jan Komenda, Jan H Van Schuppen, Email: {jan Komenda, J H Van Schuppen}@cwi, Nl
  • 2003
Coalgebraic methods provide new results and insights for the supervisory control of discrete-event systems (DES). In this paper a coalgebraic framework for the decentralized control of DES is proposed. The paper is based on the formalism developed for the supervisory control of DES in the partial observation case, the notion of bisim-ulation, and its(More)
Synthesis of normal or controllable and normal sublanguages of global specification languages without computation of the global modular plant is a difficult problem. In this paper, these sublanguages are computed using a coordinator. We recall the notion of conditional controllability, introduce a notion of conditional normality, and prove necessary and(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)