Communicating sequential processes
Communicating sequential processes
Stubborn set methods for process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Stubborn sets for model checking the EF/AG fragment of CTL
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Improving Partial Order Reductions for Universal Branching Time Properties
Fundamenta Informaticae
Stable Models for Stubborn Sets
Fundamenta Informaticae
Towards Ambitious Approximation Algorithms in Stubborn Set Optimization
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
| Hi-index | 0.00 |
Combinatorial explosion which occurs in parallel compositions of LTSs can be alleviated by letting the stubborn set method construct on-the-fly a reduced LTS that is CFFD- or CSP-equivalent to the actual parallel composition. This article considers the problem of minimizing the number of successor states of a given state in the reduced LTS. The problem can be solved by constructing an and/or-graph with weighted vertices and by finding a set of vertices that satisfies a certain constraint such that no set of vertices satisfying the constraint has a smaller sum of weights. Without weights, the and/or-graph can be constructed in low-degree polynomial time w.r.t. the length of the input of the problem. However, since actions can be nondeterministic and transitions can share target states, it is not known whether the weights are generally computable in polynomial time. Consequently, it is an open problem whether minimizing the number of successor states is as ``easy'' as minimizing the number of successor transitions.