Jan H. van Schuppen

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen

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 present a polynomial-time algorithm to extend the common alphabet so that the language becomes conditionally decomposable. A relationship of conditional decomposability to nonblockingness of modular discrete-event systems is also discussed in this paper in the general settings. It is shown that conditional decomposability is a weaker condition than nonblockingness.

Mihaly Petreczy, Laurent Bako, Jan H. van Schuppen

The paper presents realization theory of discrete-time linear switched systems. A discrete-time linear switched system is a hybrid system, such that the continuous sub-system associated with each discrete state is linear. In this paper we present necessary and sufficient conditions for an input-output map to admit a discrete-time linear switched state-space realization. The conditions are formulated as finite rank conditions of a generalized Hankel-matrix. In addition, we present a characterization of minimality of discrete-time linear switched systems in terms of reachability and observable.Further, we prove that minimal realizations are unique up to isomorphism. We also discuss procedures for converting a linear switched system to a minimal one and we present an algorithm for constructing a state-space representation from input-output data.The paper uses the theory rational formal power series in non-commutative variables. The latter theory was successfully applied to bilinear and state-affine systems in the past.

Kaihua Xi, Hai Xiang Lin, Chen Shen et al.

A consensus-control-based multi-level control law named Multi-Level Power-Imbalance Allocation Control (MLPIAC) is presented for a large-scale power system partitioned into two or more areas. Centralized control is implemented in each area while distributed control is implemented at the coordination level of the areas. Besides restoring nominal frequency with a minimal control cost, MLPIAC can improve the transient performance of the system through an accelerated convergence of the control inputs without oscillations. At the coordination level of the control areas, because the number of the areas is smaller than that of nodes, MLPIAC is more effective to obtain the minimized control cost than the purely distributed control law. At the level of the control in each area, because the number of nodes is much smaller than the total number of nodes in the whole network, the overheads in the communications and the computations are reduced compared to the pure centralized control. The asymptotic stability of MLPIAC is proven using the Lyapunov method and the performance is evaluated through simulations.

Jan Komenda, Feng Lin, Jan H. van Schuppen

In this paper, a uniform approach to maximal permissiveness in modular control of discrete-event systems is proposed. It is based on three important concepts of modular closed-loops: monotonicity, distributivity, and exchangeability. Monotonicity of various closed-loops satisfying a given property considered in this paper holds whenever the underlying property is preserved under language unions. Distributivity holds if the inverse projections of local plants satisfy the given property with respect to each other. Among new results, sufficient conditions are proposed for distributed computation of supremal relatively observable sublanguages.