Sciweavers

499 search results - page 11 / 100
» LTL satisfiability checking
Sort
View
FMCAD
2004
Springer
14 years 3 months ago
Simple Bounded LTL Model Checking
We present a new and very simple translation of the bounded model checking problem which is linear both in the size of the formula and the length of the bound. The resulting CNF-fo...
Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A...
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
14 years 3 months ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker