Sciweavers

245 search results - page 9 / 49
» Using Finite State Automata for Sequence Mining
Sort
View
CAV
2006
Springer
133views Hardware» more  CAV 2006»
13 years 11 months ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
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...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...
SIGSOFT
2009
ACM
14 years 8 months ago
Automatic steering of behavioral model inference
Many testing and analysis techniques use finite state models to validate and verify the quality of software systems. Since the specification of such models is complex and timecons...
David Lo, Leonardo Mariani, Mauro Pezzè
DAC
1997
ACM
14 years 1 days ago
Sequence Compaction for Probabilistic Analysis of Finite-State Machines
- The objective of this paper is to provide an effective technique for accurate modeling of the external input sequences that affect the behavior of Finite State Machines (FSMs). T...
Diana Marculescu, Radu Marculescu, Massoud Pedram
EH
1999
IEEE
125views Hardware» more  EH 1999»
14 years 5 days ago
Improving Correctness of Finite-State Machine Synthesis from Multiple Partial Input/Output Sequences
Our previous work focused on the synthesis of sequential circuits based on a partial input/output sequence. As the behavioural description of the target circuit is not known the c...
Prabhas Chongstitvatana, Chatchawit Aporntewan
CAV
2004
Springer
130views Hardware» more  CAV 2004»
13 years 11 months ago
Global Model-Checking of Infinite-State Systems
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
Nir Piterman, Moshe Y. Vardi