12 search results - page 2 / 3 » Generating Checking Sequences for Partial Reduced Finite Sta... |
TC
2002
14 years 11 months ago
2002
-- Here the method proposed in [13] for constructing minimal-length checking sequences based on distinguishing sequences is improved. The improvement is based on optimizations of t...
ISCIS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα of α –sequences and ...
117
click to vote
SPIN
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
106
click to vote
IJCAI
2003
15 years 1 months ago
2003
This paper addresses the formal verification of diagnosis systems. We tackle the problem of diagnosability: given a partially observable dynamic system, and a diagnosis system obs...
113
click to vote
GFKL
2007
Springer
15 years 3 months ago
2007
Springer
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...