Model checking and boolean graphs

Theoretical Computer Science

Volumn 126, Issue 1, 1994, Pages 3-30

  Andersen, Henrik Reif ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL MODELS;

ASSERTION LANGUAGE; BOOLEAN GRAPH; GLOBAL MODEL CHECKING ALGORITHM; LOCAL ALGORITHMS; MODAL Μ-CALCULUS; MODEL CHECKING; TIME COMPLEXITY; TRANSITION SYSTEM;

ALGORITHMS;

EID: 0028413632     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)90266-6     Document Type: Article

References (24)

1. Local computation of alternating fixed-points
2. Local computation of simultaneous fixed-points
3. Compositional checking of satisfaction
4. A linear algorithm to solve fixed-point equations on transitions systems
5. Definable operations in general algebras, and the theory of automata and flow charts
6. Tableau-based model checking in the propositional mu-calculus
7. The Concurrency Workbench: A semantics based tool for the verification of concurrent systems
8. ∗ into the modal μ-calculus
9. Linear-time algorithms for testing the satisfiability of propositional Horn formulae
10. Efficient model checking in fragments of the propositional mu-calculus
11. Results on the propositional mu-calculus
12. Proof systems for Hennessy-Milner logic with recursion
13. Efficient local correctness checking
14. TAV — Tools for Automatic Verification
15. Compositionality through an operational semantics of contexts
16. Local model checking in the modal mu-calculus
17. A lattice-theoretical fixpoint theorem and its applications
18. A linear algorithm for solving fixed-point equations on transition systems
19. A note on model checking the modal v-calculus