In [ 1) axioms and canonical form algorithms for proving equivalence for the theory of conditional forms are presented. These algorithms form the foundation of [2] where they are extended to enable proving the correctness of compilation. The algorithms are distinguished on the basis of whether or not strong or weak equivalence is desired. In the case of strong equivalence, an additional set of ...

The transfer functions of discrete-time SISO compartmental systems whose compartments are connected either in series or in parallel are characterized, and then the corresponding realization problem is studied. The obtained results are extended to the transfer matrix of N-periodic compartmental systems.

We consider discounted and undiscounted stochastic games with perfect information in the form of a natural BWR-model with positions of three types: VB Black, VW White, VR Random. These BWR-games lie in the complexity class NP∩CoNP and contain the well-known cyclic games (when VR is empty) and Markov decision processes (when VB or VW is empty). We show that the BWR-model is polynomial-time equiv...

The understanding of which Kronecker structures that are close to a given structure is revealed by the Kronecker structure hierarchy, i.e., the strati cation of the Kronecker canonical form. For a given matrix pencil A B, the Kronecker structure hierarchy shows all structures that are within the closure of orbit(A B), and each structure, whose orbit's closure contains A B. In order to gain new ...

In this contribution we consider the precision of the ̄oated and the ®xed GPS baseline for the case of weighted ionosphere. Canonical forms of the baseline variance matrices are developed for di€erent measurement scenarios. These forms make the relation between the various variance matrices transparent and thus present a simple way of studying their relative merits. It is also shown how these c...

This paper finds fundamental solutions to the backward Kolmogorov equations, usually interpretable as transition density functions for variables x that follow certain stochastic processes of the form dx = A(x, t)dt + cxγdX and dx = A(x, t)dt +α1 +α2x+α3xdX . This is achieved by first reducing the relevant PDEs that the density functions satisfy to their canonical form. These stochastic processe...

We give polynomial-time algorithms for satisfiability and enumeration of underspecified semantic representations in a canonical form. This canonical form brings several underspecification formalisms together into a uniform framework (Manshadi et al., 2008), so the algorithms can be applied to any underspecified representation that can be converted to this form. In particular, our algorithm can ...

This paper proposes two methods for nonlinear observer design which are based on a partial nonlinear observer canonical form (POCF). Observability and integrability existence conditions for the new POCF are weaker than the well-established nonlinear observer canonical form (OCF), which achieves exact error linearization. The proposed observers provide the global asymptotic stability of error dy...

When implementing a software, developers express conceptual knowledge (e.g. about a specific feature) not only in program language syntax and semantics but also in linguistic information stored in identifiers (e.g. method or class names) [6]. Based on this habit, Natural Language Program Analysis (NLPA) is used to improve many different areas in software engineering such as code recommendations...