Sciweavers

Share
98 search results - page 1 / 20
» LTL Model Checking for Modular Petri Nets
Sort
View
APN
2004
Springer
12 years 5 months ago
LTL Model Checking for Modular Petri Nets
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...
Timo Latvala, Marko Mäkelä
CHARME
2001
Springer
105views Hardware» more  CHARME 2001»
12 years 4 months ago
Net Reductions for LTL Model-Checking
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...
Javier Esparza, Claus Schröter
LPNMR
2001
Springer
12 years 4 months ago
Bounded LTL Model Checking with Stable Models
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...
Keijo Heljanko, Ilkka Niemelä
APN
2000
Springer
12 years 4 months ago
Pre- and Post-agglomerations for LTL Model Checking
One of the most eļ¬ƒcient 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...
Denis Poitrenaud, Jean-François Pradat-Peyr...
books