670 search results - page 50 / 134 » Real Time Model Checking Using Timed Concurrent State Machin... |
103
click to vote
CONCUR
2000
Springer
15 years 4 months ago
2000
Springer
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...
115
Voted
DLT
2007
15 years 2 months ago
2007
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the input. In this paper, we consider VPA with two stacks, namely 2...
107
Voted
FM
2006
Springer
15 years 4 months ago
2006
Springer
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
83
Voted
FM
2009
Springer
15 years 7 months ago
2009
Springer
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
113
Voted
TPDS
2008
15 years 13 days ago
2008
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...