4,217 research outputs found
Transforming opacity verification to nonblocking verification in modular systems
We consider the verification of current-state and K-step opacity for systems
modeled as interacting non-deterministic finite-state automata. We describe a
new methodology for compositional opacity verification that employs
abstraction, in the form of a notion called opaque observation equivalence, and
that leverages existing compositional nonblocking verification algorithms. The
compositional approach is based on a transformation of the system, where the
transformed system is nonblocking if and only if the original one is
current-state opaque. Furthermore, we prove that -step opacity can also be
inferred if the transformed system is nonblocking. We provide experimental
results where current-state opacity is verified efficiently for a large
scaled-up system
Complexity of Timeline-Based Planning over Dense Temporal Domains: Exploring the Middle Ground
In this paper, we address complexity issues for timeline-based planning over
dense temporal domains. The planning problem is modeled by means of a set of
independent, but interacting, components, each one represented by a number of
state variables, whose behavior over time (timelines) is governed by a set of
temporal constraints (synchronization rules). While the temporal domain is
usually assumed to be discrete, here we consider the dense case. Dense
timeline-based planning has been recently shown to be undecidable in the
general case; decidability (NP-completeness) can be recovered by restricting to
purely existential synchronization rules (trigger-less rules). In this paper,
we investigate the unexplored area of intermediate cases in between these two
extremes. We first show that decidability and non-primitive recursive-hardness
can be proved by admitting synchronization rules with a trigger, but forcing
them to suitably check constraints only in the future with respect to the
trigger (future simple rules). More "tractable" results can be obtained by
additionally constraining the form of intervals in future simple rules:
EXPSPACE-completeness is guaranteed by avoiding singular intervals,
PSPACE-completeness by admitting only intervals of the forms [0,a] and
[b,[.Comment: In Proceedings GandALF 2018, arXiv:1809.0241
On Factor Universality in Symbolic Spaces
The study of factoring relations between subshifts or cellular automata is
central in symbolic dynamics. Besides, a notion of intrinsic universality for
cellular automata based on an operation of rescaling is receiving more and more
attention in the literature. In this paper, we propose to study the factoring
relation up to rescalings, and ask for the existence of universal objects for
that simulation relation. In classical simulations of a system S by a system T,
the simulation takes place on a specific subset of configurations of T
depending on S (this is the case for intrinsic universality). Our setting,
however, asks for every configurations of T to have a meaningful interpretation
in S. Despite this strong requirement, we show that there exists a cellular
automaton able to simulate any other in a large class containing arbitrarily
complex ones. We also consider the case of subshifts and, using arguments from
recursion theory, we give negative results about the existence of universal
objects in some classes
Reachability of Communicating Timed Processes
We study the reachability problem for communicating timed processes, both in
discrete and dense time. Our model comprises automata with local timing
constraints communicating over unbounded FIFO channels. Each automaton can only
access its set of local clocks; all clocks evolve at the same rate. Our main
contribution is a complete characterization of decidable and undecidable
communication topologies, for both discrete and dense time. We also obtain
complexity results, by showing that communicating timed processes are at least
as hard as Petri nets; in the discrete time, we also show equivalence with
Petri nets. Our results follow from mutual topology-preserving reductions
between timed automata and (untimed) counter automata.Comment: Extended versio
HYPE with stochastic events
The process algebra HYPE was recently proposed as a fine-grained modelling
approach for capturing the behaviour of hybrid systems. In the original
proposal, each flow or influence affecting a variable is modelled separately
and the overall behaviour of the system then emerges as the composition of
these flows. The discrete behaviour of the system is captured by instantaneous
actions which might be urgent, taking effect as soon as some activation
condition is satisfied, or non-urgent meaning that they can tolerate some
(unknown) delay before happening. In this paper we refine the notion of
non-urgent actions, to make such actions governed by a probability
distribution. As a consequence of this we now give HYPE a semantics in terms of
Transition-Driven Stochastic Hybrid Automata, which are a subset of a general
class of stochastic processes termed Piecewise Deterministic Markov Processes.Comment: In Proceedings QAPL 2011, arXiv:1107.074
- âŠ