Related papers: Bisimulation Finiteness of Pushdown Systems Is Ele…
We study pushdown systems where control states, stack alphabet, and transition relation, instead of being finite, are first-order definable in a fixed countably-infinite structure. We show that the reachability analysis can be addressed…
Bisimulation metrics provide a robust and accurate approach to study the behavior of nondeterministic probabilistic processes. In this paper, we propose a logical characterization of bisimulation metrics based on a simple probabilistic…
The unbounded knapsack problem with bounded weights is a variant of the well-studied variant of the traditional binary knapsack problem; key changes being the relaxation of the binary constraint and allowing the unit weights of each item to…
We introduce a formal notion of masking fault-tolerance between probabilistic transition systems using stochastic games. These games are inspired in bisimulation games, but they also take into account the possible faulty behavior of…
This paper constructs a finite state abstraction of a possibly continuous-time and infinite state model in two steps. First, a finite external signal space is added, generating a so called $\Phi$-dynamical system. Secondly, the strongest…
A bipartite quantum state (for two systems in any dimensions) can be decomposed as a superposition of many components. For a superposition of more than two components we prove that there is a bound of the entanglement of the superposition…
We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…
Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A…
A simple relation is introduced for concurrence to describe how much the entanglement of bipartite system is at least left if either (or both) subsystem undergoes an arbitrary physical process. This provides a lower bound for concurrence of…
In this paper, we propose a concept of approximate bisimulation relation for feedforward neural networks. In the framework of approximate bisimulation relation, a novel neural network merging method is developed to compute the approximate…
We consider the model of one-dimensional Pushdown Vector Addition Systems (1-PVAS), a fundamental computational model simulating both recursive and concurrent behaviours. Our main result is decidability of the reachability problem for…
We present an approach to approximate reachable sets for linear systems with bounded L-infinity controls in finite time. Our first approach investigates the boundaries of these sets and reveals an exact characterization for single-input,…
This article proposes a universal simulation platform for simulating systems undergoing duress. In other words, this paper introduces a total simulation package which includes a number of methods of simulating the flexibility of a given…
A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of the loop body. In this paper we consider the problem of…
An affine model of computation is defined as a subset of iterated immediate-snapshot runs, capturing a wide variety of shared-memory systems, such as wait-freedom, t-resilience, k-concurrency, and fair shared-memory adversaries. The…
In this paper, we present a comprehensive system for the treatment of the topic of limits--conceptually, computationally, and formally. The system addresses fundamental linguistic flaws in the standard presentation of limits, which attempts…
We show that the minimization of visibly pushdown automata is NP-complete. This result is obtained by introducing immersions, that recognize multiple languages (over a usual, non-visible alphabet) using a common deterministic transition…
We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…
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…
Finite state machines are widely used as a sound mathematical formalism that appropriately describes large scale, distributed and complex systems. Multiple interactions of finite state machines in complex systems are well captured by the…