476 research outputs found
Independent Set Reconfiguration in Cographs
We study the following independent set reconfiguration problem, called
TAR-Reachability: given two independent sets and of a graph , both
of size at least , is it possible to transform into by adding and
removing vertices one-by-one, while maintaining an independent set of size at
least throughout? This problem is known to be PSPACE-hard in general. For
the case that is a cograph (i.e. -free graph) on vertices, we show
that it can be solved in time , and that the length of a shortest
reconfiguration sequence from to is bounded by , if such a
sequence exists.
More generally, we show that if is a graph class for which (i)
TAR-Reachability can be solved efficiently, (ii) maximum independent sets can
be computed efficiently, and which satisfies a certain additional property,
then the problem can be solved efficiently for any graph that can be obtained
from a collection of graphs in using disjoint union and complete join
operations. Chordal graphs are given as an example of such a class
Adaptable processes
We propose the concept of adaptable processes as a way of overcoming the
limitations that process calculi have for describing patterns of dynamic
process evolution. Such patterns rely on direct ways of controlling the
behavior and location of running processes, and so they are at the heart of the
adaptation capabilities present in many modern concurrent systems. Adaptable
processes have a location and are sensible to actions of dynamic update at
runtime; this allows to express a wide range of evolvability patterns for
concurrent processes. We introduce a core calculus of adaptable processes and
propose two verification problems for them: bounded and eventual adaptation.
While the former ensures that the number of consecutive erroneous states that
can be traversed during a computation is bound by some given number k, the
latter ensures that if the system enters into a state with errors then a state
without errors will be eventually reached. We study the (un)decidability of
these two problems in several variants of the calculus, which result from
considering dynamic and static topologies of adaptable processes as well as
different evolvability patterns. Rather than a specification language, our
calculus intends to be a basis for investigating the fundamental properties of
evolvable processes and for developing richer languages with evolvability
capabilities
- …