19 search results - page 1 / 4 » Net Reductions for LTL Model-Checking |
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...
APN
2000
Springer
15 years 1 months ago
2000
Springer
One of the most efficient analysis technique is to reduce an original model into a simpler one such that the reduced model has the same properties than the original one. G. Berthel...
LPNMR
2001
Springer
15 years 1 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
STTT
2010
14 years 4 months ago
2010
Abstract. We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-...
APN
2004
Springer
15 years 2 months ago
2004
Springer
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...