105 search results - page 6 / 21 » In Vitro Implementation of Finite-State Machines |
121
click to vote
COLING
1992
15 years 5 months ago
1992
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
145
Voted
ECBS
2004
IEEE
15 years 7 months ago
2004
IEEE
If a software implementation is to be generated fully automatically from a model, then the model must be detailed and totally complete. For the definition of software implementing...
123
click to vote
ASE
2010
15 years 4 months ago
2010
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
135
click to vote
ICCAD
1998
IEEE
15 years 7 months ago
1998
IEEE
This paper presents efficient reencoding and resynthesis algorithms for cycle-time minimization of multilevel implementations of synchronous finite state machines (FSMs) under a fi...
137
click to vote
CONCUR
2000
Springer
15 years 8 months ago
2000
Springer
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...