Sciweavers

936 search results - page 54 / 188
» FSM-Hume is finite state
Sort
View
CONCUR
2000
Springer
14 years 1 months ago
Formal Models for Communication-Based Design
Concurrency is an essential element of abstract models for embedded systems. Correctness and e ciency of the design depend critically on the way concurrency is formalized and imple...
Alberto L. Sangiovanni-Vincentelli, Marco Sgroi, L...
ASE
2006
123views more  ASE 2006»
13 years 9 months ago
Separating sequence overlap for automated test sequence generation
Finite state machines have been used to model a number of classes of system and there has thus been much interest in the automatic generation of test sequences from finite state m...
Robert M. Hierons
FOSSACS
2008
Springer
13 years 10 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
ITC
1998
IEEE
126views Hardware» more  ITC 1998»
14 years 13 days ago
A comprehensive approach to the partial scan problem using implicit state enumeration
This paper presents a novel technique to evaluate the noncontrollability measures of state registers for partial scan design. Our model uses implicit techniques for finite state ma...
Priyank Kalla, Maciej J. Ciesielski
SIGCSE
2006
ACM
134views Education» more  SIGCSE 2006»
14 years 2 months ago
jFAST: a java finite automata simulator
Visualization and interactivity are valuable active learning techniques that can improve mastery of difficult concepts. In this paper we describe jFAST, an easy-to-use graphical s...
Timothy M. White, Thomas P. Way