936 search results - page 111 / 188 » FSM-Hume is finite state |
158
click to vote
ISCIS
2005
Springer
15 years 12 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 ...
163
click to vote
DATE
1997
IEEE
15 years 10 months ago
1997
IEEE
A target structure for implementing fast edge-triggered control units is presented. In many cases, the proposed controller is faster than a one-hot encoded structure as its correc...
133
click to vote
LATIN
1992
Springer
15 years 10 months ago
1992
Springer
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
147
click to vote
JELIA
1990
Springer
15 years 10 months ago
1990
Springer
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions ...
179
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...