Sciweavers

499 search results - page 11 / 100
» LTL satisfiability checking
Sort
View
179
Voted
FMCAD
2004
Springer
15 years 11 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»
15 years 11 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
147
Voted
FOSSACS
2010
Springer
16 years 1 months ago
Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
Anthony Widjaja To, Leonid Libkin
145
Voted
FOSSACS
2010
Springer
16 years 1 months ago
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable
Stéphane Demri, Arnaud Sangnier