936 search results - page 67 / 188 » FSM-Hume is finite state |
CAV
2006
Springer
14 years 19 days ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
PTS
2000
13 years 10 months ago
2000
We discuss a case study of automatic test generation and test execution based on formal methods. The case is the Conference Protocol, a simple, chatbox-like protocol, for which (fo...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We prove that optimal strategies exist in perfect-information stochastic games with finitely many states and actions and tail winning conditions.
CPC
2004
13 years 8 months ago
2004
Using representation theory, we obtain a necessary and sufficient condition for a discrete
FMCAD
2000
Springer
14 years 15 days ago
2000
Springer
We take a fresh look at the problem of how to check safety properties of finite state machines. We are particularly interested in checking safety properties with the help of a SAT-...