Related papers: Bisimulation for Impure Simplicial Complexes
We study a separability problem suggested by mathematical description of bipartite quantum systems. We consider Hermitian 2-forms on the tensor product $H=K\otimes L$, where $K,L$ are finite dimensional complex spaces. Inspired by quantum…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
Epistemic protocol specifications allow programs, for settings in which multiple agents act with incomplete information, to be described in terms of how actions are related to what the agents know. They are a variant of the knowledge-based…
This paper describes the homology of various simplicial complexes associated to set families from combinatorial number theory, including primitive sets, pairwise coprime sets, product-free sets, and coprime-free sets. We present a condition…
Biological systems are generally complicated and/or complex. In the former approach, one sets up a model with a large number of parameters to describe the system in detail. The latter approach focuses on understanding the universal aspects…
The compactness lemma in programming language theory states that any recursive function can be simulated by a finite unrolling of the function. One important use case it has is in the logical relations proof technique for proving properties…
We study two notions of expressiveness, which have appeared in abstraction theory for model checking, and find them incomparable in general. In particular, we show that according to the most widely used notion, the class of Kripke Modal…
Checking whether two pushdown automata with restricted silent actions are weakly bisimilar was shown decidable by S\'enizergues (1998, 2005). We provide the first known complexity upper bound for this famous problem, in the equivalent…
The paper investigates algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames or classes of finite Kripke frames. Precise complexity bounds for monadic logics of classes of Kripke frames with…
In complete analogy with the classical situation (which is briefly reviewed) it is possible to define bi-Hamiltonian descriptions for Quantum systems. We also analyze compatible Hermitian structures in full analogy with compatible Poisson…
A central problem in topological data analysis is that of computing the homology of a given simplicial complex. Said complexes can have arbitrary large number of simplices, as can happen, for example, if the space is the Rips-Vietoris or…
Reactive systems \`a la Leifer and Milner, an abstract categorical framework for rewriting, provide a suitable framework for deriving bisimulation congruences. This is done by synthesizing interactions with the environment in order to…
We define an (r,s)-coloring of an abstract simplicial complex to be a coloring using r colors of the vertices so that in any simplex at most s vertices have the same color. We translate the problem of finding an (r,s)-coloring of a given…
In this paper we inititate the study of abstract simplicial complexes which are initial segments of qualitative probability orders. This is a natural class that contains the threshold complexes and is contained in the shifted complexes, but…
We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal $\mu$-calculus where the application of the least fixpoint operator $\mu p.\varphi$ is restricted to…
We extend the theory of labeled Markov processes with internal nondeterminism, a fundamental concept for the further development of a process theory with abstraction on nondeterministic continuous probabilistic systems. We define…
The prime simplicial complex $\Pi(G)$ of a finite group $G$ is composed of all sets of primes $S$ where $G$ has an element of order the product of primes in $S$, with the subsets partially ordered by inclusion. This complex was introduced…
We construct a model structure on the category of ordered simplicial complexes, Quillen equivalent to the standard model structure on simplicial sets. This shows that simplicial complexes, which are fully combinatorial in nature, provide a…
Finite-state models of control systems were proposed by several researchers as a convenient mechanism to synthesize controllers enforcing complex specifications. Most techniques for the construction of such symbolic models have two main…
The classical simulation of physical processes using standard models of computation is fraught with problems. On the other hand, attempts at modelling real-world computation with the aim of isolating its hypercomputational content have…