Sciweavers

133 search results - page 3 / 27
» Petri Nets, Traces, and Local Model Checking
Sort
View
LPNMR
2001
Springer
13 years 12 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
13 years 11 months ago
Pre- and Post-agglomerations for LTL Model Checking
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...
Denis Poitrenaud, Jean-François Pradat-Peyr...
APN
1995
Springer
13 years 11 months ago
Modular State Space Analysis of Coloured Petri Nets
State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem of state space analysis is the size of the state spaces. Several ways to reduce ...
Søren Christensen, Laure Petrucci
FORMATS
2008
Springer
13 years 9 months ago
Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
Abstract. In this paper, we propose a new framework for the parametric verification of time Petri nets with stopwatches controlled by inhibitor arcs. We first introduce an extensio...
Louis-Marie Traonouez, Didier Lime, Olivier H. Rou...
FOSSACS
2005
Springer
14 years 1 months ago
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Samy Abbes, Albert Benveniste