Sciweavers

936 search results - page 111 / 188
» FSM-Hume is finite state
Sort
View
ISCIS
2005
Springer
14 years 2 months ago
Generalizing Redundancy Elimination in Checking Sequences
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 ...
K. Tuncay Tekle, Hasan Ural, M. Cihan Yalcin, H&uu...
DATE
1997
IEEE
99views Hardware» more  DATE 1997»
14 years 1 months ago
Fast controllers for data dominated applications
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...
Andre Hertwig, Hans-Joachim Wunderlich
LATIN
1992
Springer
14 years 1 months ago
On Reversible Automata
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...
Jean-Eric Pin
JELIA
1990
Springer
14 years 1 months ago
Action Logic and Pure Induction
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 ...
Vaughan R. Pratt
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
14 years 1 months ago
Input design using Markov chains for system identification
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...
Chiara Brighenti, Bo Wahlberg, Cristian R. Rojas