40 search results - page 2 / 8 » Partial Order Reductions for Bisimulation Checking |
SNPD
2008
13 years 6 months ago
2008
Testing cannot cover all execution schedules in concurrent software. Model checking, however, is capable of verifying the outcome of all possible executions. It has been applied s...
ACTA
2010
13 years 5 months ago
2010
SPIN
2005
Springer
13 years 10 months ago
2005
Springer
We describe an improvement of the partial-order reduction algorithm for breadth-first search which was introduced in Spin version 4.0. Our improvement is based on the algorithm by...
FM
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
CONCUR
2009
Springer
13 years 12 months ago
2009
Springer
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...