Sciweavers

1753 search results - page 53 / 351
» State Machines
Sort
View
SIGOPS
2008
95views more  SIGOPS 2008»
14 years 10 months ago
Virtual machine time travel using continuous data protection and checkpointing
Virtual machine (VM) time travel enables reverting a virtual machine's state, both transient and persistent, to past points in time. This capability can be used to improve vi...
Paula Ta-Shma, Guy Laden, Muli Ben-Yehuda, Michael...
COLING
1994
14 years 11 months ago
Two Parsing Algorithms by Means of Finite State Transducers
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
Emmanuel Roche
CONCUR
2000
Springer
15 years 1 months ago
Reachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
DDECS
2007
IEEE
106views Hardware» more  DDECS 2007»
15 years 4 months ago
A Proposal for ASM++ Diagrams
– Algorithmic State Machines are a 40-year old tool for the design of digital circuits. They are a good alternative to Finite State Machines, where only states can be properly de...
Santiago De Pablo, Santiago Cáceres, Jes&ua...
ASE
2010
126views more  ASE 2010»
14 years 10 months ago
Generating a checking sequence with a minimum number of reset transitions
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...
Robert M. Hierons, Hasan Ural