105 search results - page 6 / 21 » In Vitro Implementation of Finite-State Machines |
COLING
1992
13 years 8 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...
ECBS
2004
IEEE
13 years 11 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...
ASE
2010
13 years 7 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...
ICCAD
1998
IEEE
13 years 11 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...
CONCUR
2000
Springer
14 years 4 hour 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...