283 search results - page 12 / 57 » A New DNA Implementation of Finite State Machines |
111
click to vote
SICHERHEIT
2010
14 years 9 months ago
2010
Intrusion-tolerant replication enables the construction of systems that tolerate a finite number of malicious faults. An arbitrary number of faults can be tolerated during system ...
COLING
1992
15 years 27 days 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...
CONCUR
2000
Springer
15 years 4 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...
ISLPED
1998
ACM
15 years 4 months ago
1998
ACM
- The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in Finite State Machines (FSMs). Using a Markov chain model for the...
115
click to vote
ASPDAC
2001
ACM
15 years 3 months ago
2001
ACM
Abstract-- Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based ...