Related papers: An abstract characterization for projections in op…
Quasi-interpretations are a technique to guarantee complexity bounds on first-order functional programs: with termination orderings they give in particular a sufficient condition for a program to be executable in polynomial time, called…
A complete contraction on a C*-algebra A, which preserves all closed two sided ideals J, can be approximated pointwise by elementary complete contractions if and only if the induced map on the tensor product of B with A/J is contractive for…
Given an Archimedean order unit space (V,V^+,e), we construct a minimal operator system OMIN(V) and a maximal operator system OMAX(V), which are the analogues of the minimal and maximal operator spaces of a normed space. We develop some of…
We prove the existence of tight frames whose elements lie on an arbitrary ellipsoidal surface within a real or complex separable Hilbert space H, and we analyze the set of attainable frame bounds. In the case where H is real and has finite…
A sequence of scalars is said to be admissible for a positive operator A on a Hilbert space if it is the diagonal of VAV* for some partial isometry V having as domain the closure of the range of A. When A is a projection, the celebrated…
Static program analysis by abstract interpretation is an efficient method to determine properties of embedded software. One example is value analysis, which determines the values stored in the processor registers. Its results are used as…
In this paper, we consider the problem of verifying pre-opacity for discrete-time control systems. Pre-opacity is an important information-flow security property that secures the intention of a system to execute some secret behaviors in the…
In this paper we study the convergence of an iterative algorithm for finding zeros with constraints for not necessarily monotone set-valued operators in a reflexive Banach space. This algorithm, which we call the proximal-projection method…
To each projection $p$ in a $C^*$-algebra $A$ we associate a family of derivations on $A$, called $p$-derivations, and relate them to the space of triple derivations on $p A (1-p)$. We then show that every derivation on a ternary ring of…
In this work, the operator-sum representation of a quantum process is extended to the probability representation of quantum mechanics. It is shown that each process admitting the operator-sum representation is assigned a kernel, convolving…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
An operator set is functionally incomplete if it can not represent the full set $\lbrace \neg,\vee,\wedge,\rightarrow,\leftrightarrow\rbrace$. The verification for the functional incompleteness highly relies on constructive proofs. The…
Heap data is potentially unbounded and seemingly arbitrary. As a consequence, unlike stack and static memory, heap memory cannot be abstracted directly in terms of a fixed set of source variable names appearing in the program being…
Most ideas about what an algorithm is are very similar. Basic operations are used for transforming objects. The evaluation of internal and external states by relations has impact on the further process. A more precise definition can lead to…
Static program analysis is a valuable tool for any programming language that people write programs in. The prevalence of scripting languages in the world suggests programming language interpreters are relatively easy to write. Users of…
We construct projective limit of projective sequence in the following categories: Archimedean order unit spaces with unital positive maps and operator systems with unital completely positive maps. We prove that inductive limit and…
A key question that arises in rigorous analysis of cyberphysical systems under attack involves establishing whether or not the attacked system deviates significantly from the ideal allowed behavior. This is the problem of deciding whether…
Observability of complex systems/networks is the focus of this paper, which is shown to be closely related to the concept of contraction. Indeed, for observable network tracking it is necessary/sufficient to have one node in each…
In this paper, we give a generic algorithm of the transition operators between Hermitian Young projection operators corresponding to equivalent irreducible representations of SU(N), using the compact expressions of Hermitian Young…
A symmetry of a dynamical system is a map that transforms one trajectory to another trajectory. We introduce a new type of abstraction for hybrid automata based on symmetries. The abstraction combines different modes in a concrete automaton…