Sciweavers

71 search results - page 1 / 15
» Partial Order Reduction for Probabilistic Branching Time
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 4 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
FSTTCS
2006
Springer
13 years 8 months ago
On Reduction Criteria for Probabilistic Reward Models
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
Marcus Größer, Gethin Norman, Christel ...
FSTTCS
1998
Springer
13 years 9 months ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim
ACSD
2010
IEEE
261views Hardware» more  ACSD 2010»
13 years 2 months ago
Partial Order Reduction for Branching Security Protocols
We extend the partial order reduction algorithm of Clarke et al. [CJM00] to handle branching security protocols, such as optimistic fair exchange protocols. Applications of the pro...
Wan Fokkink, Mohammad Torabi Dashti, Anton Wijs
CONCUR
2009
Springer
13 years 11 months ago
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
Sergio Giro, Pedro R. D'Argenio, Luis María...