493 search results - page 8 / 99 » Bounded LTL Model Checking with Stable Models |
CAV
2005
Springer
15 years 3 months ago
2005
Springer
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
KBSE
2003
IEEE
15 years 3 months ago
2003
IEEE
We propose a practical parallel on-the-fly algorithm for enumerative LTL model-checking. The algorithm is designed for a cluster of workstations communicating via MPI. The detect...
124
click to vote
STTT
2010
14 years 8 months ago
2010
Recent development in computer hardware has brought more wide-spread emergence of shared memory, multi-core systems. These architectures offer opportunities to speed up various ta...
102
click to vote
ATVA
2011
Springer
13 years 9 months ago
2011
Springer
We present the Self-Loop Aggregation Product (SLAP), a new hybrid technique that replaces the synchronized product used in the automata-theoretic approach for LTL model checking. T...
CHARME
2001
Springer
15 years 2 months ago
2001
Springer
We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wel...