100 research outputs found
Efficient Solution of Language Equations Using Partitioned Representations
A class of discrete event synthesis problems can be reduced to solving
language equations f . X ⊆ S, where F is the fixed component and S the
specification. Sequential synthesis deals with FSMs when the automata for F and
S are prefix closed, and are naturally represented by multi-level networks with
latches. For this special case, we present an efficient computation, using
partitioned representations, of the most general prefix-closed solution of the
above class of language equations. The transition and the output relations of
the FSMs for F and S in their partitioned form are represented by the sets of
output and next state functions of the corresponding networks. Experimentally,
we show that using partitioned representations is much faster than using
monolithic representations, as well as applicable to larger problem instances.Comment: Submitted on behalf of EDAA (http://www.edaa.com/
Adaptive Homing is in P
Homing preset and adaptive experiments with Finite State Machines (FSMs) are
widely used when a non-initialized discrete event system is given for testing
and thus, has to be set to the known state at the first step. The length of a
shortest homing sequence is known to be exponential with respect to the number
of states for a complete observable nondeterministic FSM while the problem of
checking the existence of such sequence (Homing problem) is PSPACE-complete. In
order to decrease the complexity of related problems, one can consider adaptive
experiments when a next input to be applied to a system under experiment
depends on the output responses to the previous inputs. In this paper, we study
the problem of the existence of an adaptive homing experiment for complete
observable nondeterministic machines. We show that if such experiment exists
then it can be constructed with the use of a polynomial-time algorithm with
respect to the number of FSM states.Comment: In Proceedings MBT 2015, arXiv:1504.0192
Deterministic Timed Finite State Machines: Equivalence Checking and Expressive Power
There has been a growing interest in defining models of automata enriched
with time. For instance, timed automata were introduced as automata extended
with clocks. In this paper, we study models of timed finite state machines
(TFSMs), i.e., FSMs enriched with time, which accept timed input words and
generate timed output words. Here we discuss some models of TFSMs with a single
clock: TFSMs with timed guards, TFSMs with timeouts, and TFSMs with both timed
guards and timeouts. We solve the problem of equivalence checking for all three
models, and we compare their expressive power, characterizing subclasses of
TFSMs with timed guards and of TFSMs with timeouts that are equivalent to each
other.Comment: In Proceedings GandALF 2014, arXiv:1408.556
Security checking experiments with mobile services
In this paper, we continue to investigate th
- …