Related papers: Algebraic Laws for True Concurrency
Probabilistic concurrent systems are foundational models for modern mobile computing. In this paper, a unifying approach to probabilistic testing equivalences is proposed. With the help of a new distribution-based semantics for…
We formulate a general approach to higher concurrencies in general and neural codes in particular, and suggest how the higher order aspects may be dealt with in using topology.
We construct a counter example showing, for the quadratic quantization, the identity $(\Gamma(T))^*= \Gamma(T^*)$ is not necessarily true. We characterize all operators on the one-particle algebra whose quadratic quantization are…
Modern distributed systems often rely on so called weakly-consistent databases, which achieve scalability by sacrificing the consistency guarantee of distributed transaction processing. Such databases have been formalised in two different…
We perform a canonical analysis of the bimetric theory in the metric formulation, computing the constraints and their algebra explicitly. In particular, we compute a secondary constraint, that has been argued to exist earlier, and show that…
An algebraic telic problem is a decision problem in $\textsf{NP}_\mathbb{R}$ formalizing finite-time reachability questions for one-dimensional dynamical systems. We prove that the existence of "natural" mapping reductions between algebraic…
A collection of converse theorems for integral quadratic constraints (IQCs) is established for linear time-invariant systems. It is demonstrated that when a system interconnected in feedback with an arbitrary system satisfying an IQC is…
A metric algebra is a metric variant of the notion of $\Sigma$-algebra, first introduced in universal algebra to deal with algebras equipped with metric structures such as normed vector spaces. In this paper, we showed metric versions of…
We initiate the study of parallel algorithms for fairly allocating indivisible goods among agents with additive preferences. We give fast parallel algorithms for various fundamental problems, such as finding a Pareto Optimal and EF1…
We discuss the deal of imperfectness of atomic actions in reality with the background of process algebras. And we show the applications of the imperfect actions in verification of computational systems.
This thesis addresses the theory of topological spaces and the foundations of persistence theory. We will discuss chain complexes and the associated simplicial homology groups, as well as their relationship with singular homology theory.…
An associative $*$-algebra is introduced (containing a $TTR$-algebra as a subalgebra) that implements the form factor axioms, and hence indirectly the Wightman axioms, in the following sense: Each $T$-invariant linear functional over the…
Constraint Handling Rules is an effective concurrent declarative programming language and a versatile computational logic formalism. CHR programs consist of guarded reactive rules that transform multisets of constraints. One of the main…
We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and…
Absolute model companionship (AMC) is a strict strengthening of model companionship defined as follows: For a theory $T$, $T_{\exists\vee\forall}$ denotes the logical consequences of $T$ which are boolean combinations of universal…
One of the few available complete methods for checking the satisfiability of sets of polynomial constraints over the reals is the cylindrical algebraic covering (CAlC) method. In this paper, we propose an extension for this method to…
A new algorithm to compute cylindrical algebraic decompositions (CADs) is presented, building on two recent advances. Firstly, the output is truth table invariant (a TTICAD) meaning given formulae have constant truth value on each cell of…
We define a game on distributed Petri nets, where several players interact with each other, and with an environment. The players, or users, have perfect knowledge of the current state, and pursue a common goal. Such goal is expressed by…
It is shown that operations of equivalence cannot serve for building algebras which would induce orthomodular lattices as the operations of implication can. Several properties of equivalence operations have been investigated. Distributivity…
We prove that the classification problem for graphs and several types of algebraic lattices (distributive, congruence and modular) up to isomorphism contains the classification problem for pairs of matrices up to simultaneous similarity.