Related papers: On the Axiomatisability of Parallel Composition
The exact stationary state of an asymmetric exclusion process with fully parallel dynamics is obtained using the matrix product Ansatz. We give a simple derivation for the deterministic case by a physical interpretation of the dimension of…
The problem of Bayesian filtering and smoothing in nonlinear models with additive noise is an active area of research. Classical Taylor series as well as more recent sigma-point based methods are two well-known strategies to deal with these…
In this paper, we propose a compositional approach to construct opacity-preserving finite abstractions (a.k.a symbolic models) for networks of discrete-time nonlinear control systems. Particularly, we introduce new notions of simulation…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
We say that one point process on the line $\mathbb{R}$ mimics another at a bandwidth $B$ if for each $n \ge 1$ the two point processes have $n$-level correlation functions that agree when integrated against all bandlimited test functions on…
We introduce a sound and complete equational theory capturing equivalence of discrete probabilistic programs, that is, programs extended with primitives for Bernoulli distributions and conditioning, to model distributions over finite sets…
Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies.…
We define a notion of Lambda-simulation for coalgebraic modal logics, parametric on the choice Lambda of predicate liftings for a functor T. We show this notion is adequate in several ways: i) it preserves truth of positive formulas, ii)…
In this work, generalizations of some inequalities for continuous $h$-synchronous ($h$-asynchronous) functions of linear bounded selfadjoint operators under positive linear maps in Hilbert spaces are proved.
After substantial progress over the last 15 years, the "algebraic CSP-dichotomy conjecture" reduces to the following: every local constraint satisfaction problem (CSP) associated with a finite idempotent algebra is tractable if and only if…
In this paper the spectrum of composition operators on the space of real analytic functions is investigated. In some cases it is completely determined while in some other cases it is only estimated.
In the paper, we investigate weighted composition operators on Bergman spaces of a half-plane. We characterize weighted composition operators which are hermitian and those which are complex symmetric with respect to a family of…
A finite element method is presented to compute time harmonic microwave fields in three dimensional configurations. Nodal-based finite elements have been coupled with an absorbing boundary condition to solve open boundary problems. This…
Utilizing the Birkhoff--James orthogonality, we present some characterizations of the norm-parallelism for elements of $\mathbb{B}(\mathscr{H})$ defined on a finite dimensional Hilbert space, elements of a Hilbert $C^*$-module over the…
In this paper, we study composition operators on Hilbert space of complex-valued harmonic functions. In particular, we explore isometries, the type of self-map that generate bounded composition operator, and characterize the boundedness of…
Building on the work of \.{I}nan and of Almahariq--Peters--Vergili, we develop an axiomatic framework for approximate algebra based on an algebra-compatible closure operator $\Phi^{\!*}$ on a unital ring. The operator is assumed to be…
This paper presents a bicomplex version of the Spectral Decomposition Theorem on infinite dimensional bicomplex Hilbert spaces. In the process, the ideas of bounded linear operators, orthogonal complements and compact operators on bicomplex…
For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…
In this paper we present an alternative approach to formalize the theory of logic programming. In this formalization we allow existential quantified variables and equations in queries. In opposite to standard approaches the role of answer…
After recalling the definitions of atomic and molecular logics, we show how notions of bisimulation can be automatically defined from the truth conditions of the connectives of any of these logics. Then, we prove a generalization of van…