Learn More
Distributed systems consist of an interconnection of two or more subsystems. Control of such systems is structured by two or more controllers, each receiving an observation stream from a local subsystem and providing an input to the local subsystem. Coordinated distributed systems are defined for linear systems, for Gaussian systems, and for discrete-event(More)
— Modular supervisory control of discrete-event systems (DES), where the global DES is composed of local components that run concurrently, is considered. For supervisory control of large-scale modular DES the possibility of performing control-related computations locally (in components) is of utmost importance to computational complexity. Recently we have(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)
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)
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)