98 search results - page 1 / 20 » LTL Model Checking for Modular Petri Nets |
APN
2004
Springer
13 years 10 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...
CHARME
2001
Springer
13 years 9 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...
LPNMR
2001
Springer
13 years 9 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...
APN
2001
Springer
13 years 9 months ago
2001
Springer
APN
2000
Springer
13 years 9 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...