52 search results - page 9 / 11 » Explicit State Model Checking with Hopper |
66
Voted
JUCS
2006
14 years 9 months ago
2006
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
103
click to vote
TACAS
2001
Springer
15 years 1 months ago
2001
Springer
Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dyn...
78
Voted
IJCAI
1997
14 years 10 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
69
Voted
SYNTHESE
2008
14 years 9 months ago
2008
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
DBPL
2007
Springer
15 years 3 months ago
2007
Springer
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...