Minimizing the number of successor states in the stubborn set method

Fundamenta Informaticae

Volumn 51, Issue 1-2, 2002, Pages 215-234

  Varpaaniemi, Kimmo ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

And or graphs; CFFD equivaience; CSP equivalence; LTSs; Stubborn sets

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FUNCTIONS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

STUBBORN SETS;

INFORMATION SCIENCE;

EID: 0036601073     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. PROD 3.3.09 - An advanced tool for efficient reachability analysis
2. GraphViz 1.7 - Open source graph drawing software
3. Partial-order methods for the verification of concurrent systems - An approach to the state-explosion problem
4. A calculus of communicating systems
5. lsts2dot - A translator from TVT LSTS files to the input file language of GraphViz
6. All from one, one for all: On model checking using representatives
7. Partial order methods in verification
8. Improving partial order reductions for universal branching time properties
9. Stubborn sets for model checking the EF/AG fragment of CTL
10. Smodels-2.26 - A system for answer set programming
11. Heuristics for lazy state space generation speeds up analysis of concurrent systems
12. TVT 2.0 - Tampere verification tool
13. Compositional failure-based semantic models for basic LOTOS
14. Stable models for stubborn sets