2467 search results - page 93 / 494 » Finite State Machines |
164
Voted
TC
1998
15 years 5 months ago
1998
ion Techniques for Validation Coverage Analysis and Test Generation Dinos Moundanos, Jacob A. Abraham, Fellow, IEEE, and Yatin V. Hoskote —The enormous state spaces which must be...
147
click to vote
COLING
1992
15 years 6 months ago
1992
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
139
click to vote
FATES
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
155
click to vote
ASWEC
2007
IEEE
15 years 12 months ago
2007
IEEE
This paper explains some analyses that can be performed on a hierarchical finite state machine to validate that it performs as intended. Such a hierarchical state machine has tra...
133
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...