Abstract:
Abstract. This paper continues research on the stubborn set method that constructs on-the- y a reduced LTS that is CFFD-equivalent to the parallel composition of given LTSs. In particular, minimization of the number of successor states of a given state is reconsidered. The earlier suggested and/or-graph approach requires solving #P-complete counting problems in order to get the weights for the vertices of the and/or-graph. The \branch-and-bound " decision problem corresponding to the minimization of the sum of the computed weights is \only " NP-complete. Unfortunately, #P-complete counting does not seem easily avoidable in the general case because it is PP-complete to check whether a given stubborn set produces at most as many successor states as another given stubborn set. Instead of solving each of the subproblems, one could think of computing approximate solutions in such a way that the total eect of the approximations is a useful approximation itself. General approximation algorithms for propositional logic problems essentially suce for the purpose.
Citations
|
1258
|
Randomized Algorithms
– Motwani, Raghavan
- 1997
|
|
496
|
The complexity of theorem-proving procedures
– Cook
- 1971
|
|
409
|
Approximation Algorithms for NP-hard Problems
– Hochbaum
- 1997
|
|
248
|
The complexity of enumeration and reliability problems
– Valiant
- 1979
|
|
209
|
Computational complexity of probabilistic Turing machines
– Gill
- 1977
|
|
73
|
Monte-Carlo approximation algorithms for enumeration problems
– Karp, Luby, et al.
- 1989
|
|
71
|
On Some Central Problems in Computational Complexity
– Simon
- 1975
|
|
53
|
Computationally related problems
– Sahni
- 1974
|
|
31
|
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
– Hochbaum, Megiddo, et al.
- 1993
|
|
22
|
Stubborn set methods for process algebras
– Valmari
- 1997
|
|
21
|
On approximation preserving reductions: Complete problems and robust measures
– Orponen, Mannila
- 1987
|
|
21
|
Compositional failure-based semantics models for basic LOTOS. FAC
– Valmari, Tiernari
- 1995
|
|
20
|
Polynomially bounded minimization problems that are hard to approximate
– Kann
- 1994
|
|
13
|
A bounded approximation for the minimum cost 2-Sat problem, Algorithmica 8
– Gusfield, Pitt
- 1992
|
|
10
|
Complexity Theory
– Papadimitriou
- 1994
|
|
3
|
Stable Models for Stubborn Sets
– Varpaaniemi
- 1999
|
|
2
|
Preorders and Compositional Veri for Linear Time Temporal Logic and Concurrent Systems, Doctoral Thesis
– Kaivola
- 1996
|
|
2
|
Alleviating State Explosion during Veri of Behavioural Equivalence
– Valmari
- 1992
|
|
1
|
Related information is available via http://www.nada.kth.se/theory/compendium/wwwcompendium.html
– Ausiello, Crescenzi, et al.
- 1999
|
|
1
|
Tight Lower Bounds on the Approximability of Some NPOPB-Complete
– Jonsson
- 1997
|
|
1
|
Minimizing the Number of Successor States
– Varpaaniemi
- 2002
|
|
