In this paper, we show that a generic r-tuple of m-input p-output linear systems is simultaneously pole assignable if r < m+ p and the McMillan degrees of the systems are not too different. We also obtain upper bounds for the degrees of the compensators which simultaneously assign the characteristic polynomials of the r-tuple of closed loop systems. The upper bounds are obtained for each of the...

We define a new, output-based encoding of the λ-calculus into the asynchronous π-calculus – enriched with pairing – that has its origin in mathematical logic, and show that this encoding respects one-step spine-reduction up to substitution, and that normal substitution is respected up to similarity. We will also show that it fully encodes lazy reduction of closed terms, in that termsubstitution...

This paper studies a method of shifting poles of linear constant systems via LQ optimal feedback. By making use of a solution to the so-called inverse regulator problem, this method enables us to shift poles successively by pairs while maintaining the well-known advantages of LQ regulators. Polynomial fractional representation is effectively used both to characterize the maximal pole-assignable...

This paper studies normalization of typeable terms and the relation between approximation semantics and filter models for Combinator Systems. It presents notions of approximants for terms, intersection type assignment, and reduction on type derivations; the last will be proved to be strongly normalizable. With this result, it is proved that every typeable term has an approximant with the same t...

A novel method of parallel switching power with different capacity in a controllable current sharing method is presented in this paper. It achieves proportional current sharing and stable output DC voltage by using controllable current sharing modes which output assignable feedback signals to the paralleling buck DC-DC converters. The validity and effectiveness are verified through comprehensiv...

Ghost variables are assignable variables that appear in program annotations but do not correspond to physical entities. They are used to facilitate specification and verification, e.g., by using a ghost variable to count the number of iterations of a loop, and also to express extra-functional behaviours. In this paper we give a formal model of ghost variables and show how they can be eliminated...

We study the π-calculus, enriched with pairing, and define a notion of type assignment that uses the type constructor →. We encode the terms of the calculus X into this variant of π, and show that all reduction (cut -elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculu LK, this implies that all proofs in LK have a representation in π...