Related papers: Bisimulation Finiteness of Pushdown Systems Is Ele…
As an alternative to Kripke models, simplicial complexes are a versatile semantic primitive on which to interpret epistemic logic. Given a set of vertices, a simplicial complex is a downward closed set of subsets, called simplexes, of the…
We provide analytical lower and upper bounds for entanglement of formation for bipartite systems, which give a direct relation between the bounds of entanglement of formation and concurrence, and improve the previous results. Detailed…
We consider the model of parametrized asynchronous shared-memory pushdown systems, as introduced in [Hague'11]. In a series of recent papers it has been shown that reachability in this model is PSPACE-complete [Esparza, Ganty, Majumdar'13]…
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…
We study the separability of permutationally symmetric quantum states. We show that for bipartite symmetric systems most of the relevant entanglement criteria coincide. However, we provide a method to generate examples of bound entangled…
This paper formulates and studies the concepts of approximate (alternating) bisimulation relations characterizing equivalence relations between interconnected systems and their abstractions. These equivalence relations guarantee that the…
Massive gravity may be viewed as a suitable limit of bimetric gravity. The limiting procedure can lead to an interesting interplay between the "background" and "foreground" metrics in a cosmological context. The fact that in bimetric…
Establishing equivalences between programs or systems is crucial both for verifying correctness of programs, by establishing that two implementations are equivalent, and for justifying optimisations and program transformations, by…
Register automata are a basic model of computation over infinite alphabets. Fresh-register automata extend register automata with the capability to generate fresh symbols in order to model computational scenarios involving name creation.…
We consider the deformation of the Whitham systems in the case when the initial system is close to linear one. It appears that the deformation procedure should be modified in this special case to make all the constructions stable in the…
In this paper, ordinary and exponential dichotomies are defined in differential equations with equations with piecewise constant argument of general type. We prove the asymptotic equivalence between the bounded solutions of a linear system…
Visibly pushdown transducers form a subclass of pushdown transducers that (strictly) extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations. In this paper, we prove…
In this paper we present an abstraction algorithm that produces a finite bisimulation quotient for an autonomous discrete-time linear system. We assume that the bisimulation quotient is required to preserve the observations over an…
Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory,…
A classical theorem states that the set of languages given by a pushdown automaton coincides with the set of languages given by a context-free grammar. In previous work, we proved the pendant of this theorem in a setting with interaction:…
The reachability problem in vector addition systems is a central question, not only for the static verification of these systems, but also for many inter-reducible decision problems occurring in various fields. The currently best known…
We introduce a data-driven approach to computing finite bisimulations for state transition systems with very large, possibly infinite state space. Our novel technique computes stutter-insensitive bisimulations of deterministic systems,…
This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et al. collapses: it is expressively equivalent to dense-timed PDA with timeless…
The well-known Schmidt decomposition, or equivalently, the complex singular value decomposition, states that a pure quantum state of a bipartite system can always be brought into a "diagonal" form using local unitary transformations. In…
Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the n-th level of the hierarchy is over an…