We consider boolean circuits computing n-operators f : {0, 1}n {0, 1}n . As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operat...
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as mixed logical dy...
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
: Linear integral operators describing physical problems on symmetric domains often are equivariant, which means that they commute with certain symmetries, i.e., with a group of or...
We describe a new approach of the generalized Bezout identity for linear time-varying ordinary differential control systems. We also explain when and how it can be extended to line...
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, ...
Erik G. Boman, Bruce Hendrickson, Stephen A. Vavas...
For discrete-time linear time invariant systems with constraints on inputs and states, we develop an algorithm to determine explicitly, the state feedback control law which minimi...
Alberto Bemporad, Manfred Morari, Vivek Dua, Efstr...
: This paper investigates the accuracy of the linear model estimate that forms a part of an overall Hammerstein model structure. A key finding here is that the process of estimatin...
We study linear anti-windup augmentation for linear control systems with saturated linear plants in the special case when the anti-windup compensator can only modify the input and...