3,145 research outputs found
O-Minimal Hybrid Reachability Games
In this paper, we consider reachability games over general hybrid systems,
and distinguish between two possible observation frameworks for those games:
either the precise dynamics of the system is seen by the players (this is the
perfect observation framework), or only the starting point and the delays are
known by the players (this is the partial observation framework). In the first
more classical framework, we show that time-abstract bisimulation is not
adequate for solving this problem, although it is sufficient in the case of
timed automata . That is why we consider an other equivalence, namely the
suffix equivalence based on the encoding of trajectories through words. We show
that this suffix equivalence is in general a correct abstraction for games. We
apply this result to o-minimal hybrid systems, and get decidability and
computability results in this framework. For the second framework which assumes
a partial observation of the dynamics of the system, we propose another
abstraction, called the superword encoding, which is suitable to solve the
games under that assumption. In that framework, we also provide decidability
and computability results
Foundations for a theory of emergent quantum mechanics and emergent classical gravity
Quantum systems are viewed as emergent systems from the fundamental degrees
of freedom. The laws and rules of quantum mechanics are understood as an
effective description, valid for the emergent systems and specially useful to
handle probabilistic predictions of observables. After introducing the
geometric theory of Hamilton-Randers spaces and reformulating it using Hilbert
space theory, a Hilbert space structure is constructed from the Hilbert space
formulation of the underlying Hamilton-Randers model and associated with the
space of wave functions of quantum mechanical systems. We can prove the
emergence of the Born rule from ergodic considerations. A geometric mechanism
for a natural spontaneous collapse of the quantum states based on the
concentration of measure phenomena as it appears in metric geometry is
discussed.We show the existence of stable vacua states for the quantized matter
Hamiltonian. Another consequence of the concentration of measure is the
emergence of a weak equivalence principle for one of the dynamics of the
fundamental degrees of freedom. We suggest that the reduction of the quantum
state is driven by a gravitational type interaction.
Such interaction appears only in the dynamical domain when localization of
quantum observables happens, it must be a classical interaction. We discuss the
double slit experiment in the context of the framework proposed, the
interference phenomena associated with a quantum system in an external
gravitational potential, a mechanism explaining non-quantum locality and also
provide an argument in favour of an emergent interpretation of every
macroscopic time parameter. Entanglement is partially described in the context
of Hamilton-Randers theory and how naturally Bell's inequalities should be
violated.Comment: Extensive changes in chapter 1 and chapter 2; minor changes in other
chapters; several refereces added and others update; 192 pages including
index of contents and reference
Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems
A complete classification of the computational complexity of the fixed-point
existence problem for boolean dynamical systems, i.e., finite discrete
dynamical systems over the domain {0, 1}, is presented. For function classes F
and graph classes G, an (F, G)-system is a boolean dynamical system such that
all local transition functions lie in F and the underlying graph lies in G. Let
F be a class of boolean functions which is closed under composition and let G
be a class of graphs which is closed under taking minors. The following
dichotomy theorems are shown: (1) If F contains the self-dual functions and G
contains the planar graphs then the fixed-point existence problem for (F,
G)-systems with local transition function given by truth-tables is NP-complete;
otherwise, it is decidable in polynomial time. (2) If F contains the self-dual
functions and G contains the graphs having vertex covers of size one then the
fixed-point existence problem for (F, G)-systems with local transition function
given by formulas or circuits is NP-complete; otherwise, it is decidable in
polynomial time.Comment: 17 pages; this version corrects an error/typo in the 2008/01/24
versio
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems
We present dichotomy theorems regarding the computational complexity of
counting fixed points in boolean (discrete) dynamical systems, i.e., finite
discrete dynamical systems over the domain {0,1}. For a class F of boolean
functions and a class G of graphs, an (F,G)-system is a boolean dynamical
system with local transitions functions lying in F and graphs in G. We show
that, if local transition functions are given by lookup tables, then the
following complexity classification holds: Let F be a class of boolean
functions closed under superposition and let G be a graph class closed under
taking minors. If F contains all min-functions, all max-functions, or all
self-dual and monotone functions, and G contains all planar graphs, then it is
#P-complete to compute the number of fixed points in an (F,G)-system; otherwise
it is computable in polynomial time. We also prove a dichotomy theorem for the
case that local transition functions are given by formulas (over logical
bases). This theorem has a significantly more complicated structure than the
theorem for lookup tables. A corresponding theorem for boolean circuits
coincides with the theorem for formulas.Comment: 16 pages, extended abstract presented at 10th Italian Conference on
Theoretical Computer Science (ICTCS'2007
Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems
A Boolean Finite Synchronous Dynamical System (BFDS, for short) consists of a finite number of objects that each maintains a boolean state, where after individually receiving state assignments, the objects update their state with respect to object-specific time-independent boolean functions synchronously in discrete time steps.
The present paper studies the computational complexity of determining, given a boolean finite synchronous dynamical system,
a configuration, which is a boolean vector representing the states
of the objects, and a positive integer t, whether there exists another configuration from which the given configuration can be reached in t steps. It was previously shown that this problem, which we call the t-Predecessor Problem, is NP-complete even for t = 1
if the update function of an object is either the conjunction of
arbitrary fan-in or the disjunction of arbitrary fan-in.
This paper studies the computational complexity of the t-Predecessor Problem for a variety of sets of permissible update functions as well as for polynomially bounded t. It also studies the t-Garden-Of-Eden Problem, a variant of the t-Predecessor Problem that asks whether a configuration has a t-predecessor, which itself has no predecessor. The paper obtains complexity theoretical characterizations of all but one of these problems
Patching task-level robot controllers based on a local µ-calculus formula
We present a method for mending strategies for
GR(1) specifications. Given the addition or removal of edges
from the game graph describing a problem (essentially transition
rules in a GR(1) specification), we apply a µ-calculus
formula to a neighborhood of states to obtain a “local strategy”
that navigates around the invalidated parts of an original
synthesized strategy. Our method may thus avoid global resynthesis
while recovering correctness with respect to the new
specification. We illustrate the results both in simulation and
on physical hardware for a planar robot surveillance task
- …