Faster model checking for the modal mu-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 663 LNCS, Issue , 1993, Pages 410-422

  Cleaveland, Ranee ^a   Klein, Marion ^b   Steffen, Bernhard ^b  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER AIDED ANALYSIS; TEMPORAL LOGIC;

ALTERNATING FIXPOINTS; BEST-KNOWN ALGORITHMS; EQUATIONAL SYSTEMS; INTERMEDIATE RESULTS; MODAL MU CALCULUS; SUBLOGICS; WORST-CASE COMPLEXITY;

MODEL CHECKING;

EID: 85029409336     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56496-9_32     Document Type: Conference Paper

References (21)

1. Andersen, H. “Model Checking and Boolean Graphs.” Proc. of ESOP’92, LNCS 582,1992.
2. Arnold, A., and P. Crubille. “A Linear Algorithm To Solve Fixed-Point Equations on Transition Systems.” Information Processing Letters, v. 29, 30 September 1988, pp. 57-66.
3. Clarke, E.M., E.A. Emerson and A.P. Sistla. “Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications.” A CM Transactions on Programming Languages and System, v. 8, n. 2, 1986, pp. 244-263.
4. Cleaveland, R. “Tableau-Based Model Checking in the Propositional Mu-Calculus.” Acta Informatica, v. 27, 1990, pp. 725-747.
5. Cleaveland, R., M. Klein and B. Steffen. “Faster Model Checking for the Modal Mu-Calculus.” In Technical Report RWTH Aachen Nr. 91-29, Fachgruppe der Informatik, 1991.
6. Cleaveland, R., J. Parrow and B. Steffen. “The Concurrency Workbench.” In Proceedings CAV'89, LNCS 407, 1989.
7. Cleaveland, R., J. Parrow and B. Steffen. “A Semantics-based Verification Tool for Finite-State Systems”, In Proceedings of the Ninth International Symposium on Protocol Specification, Testing, and Verification. North-Holland, 1989.
8. Cleaveland, R. and B. Steffen. “Computing Behavioural Relations, Logically.” In Proceedings ICALP '91, LNCS 510,1991.
9. Cleaveland, R. and B. Steffen. “A Linear-Time Model Checking Algorithm for the Alternation-Free Modal Mu-Calculus.” In Proceedings CAV’91, LNCS 575, 1991.
10. Emerson, E.A. and C.-L. Lei. “Efficient Model Checking in Fragments of the Propositional Mu-Calculus.” In Proceedings of LICS, 1986, pp. 267-278.
11. Fernandez, J.-C. Aldébaran: Une Système de Vérification par Réduction de Processus Communicants. Ph.D. Thesis, Université de Grenoble, 1988.
12. Kleene, S. C. “Introduction to Metamathematics”, North Holland, 1952.
13. Kozen, D. “Results on the Propositional μ-Calculus.” TCS, v. 27, 1983, pp. 333-354.
14. Larsen, K.G. “Proof Systems for Hennessy-Milner Logic with Recursion.” In Proceedings of CAAP, 1988.
15. Malhotra, J., Smolka, S.A., Giacalone, A. and Shapiro, R. “Winston: A Tool for Hierarchical Design and Simulation of Concurrent Systems.” In Proceedings of the Workshop on Specification and Verification of Concurrent Systems, Univ. of Stirling, Scotland, 1988.
16. Richier, J., Rodriguez, C., Sifakis, J. and Voiron, J.. “Verification in XESAR of the Sliding Window Protocol.” In Proceedings of the Seventh IFIP Symposium on Protocol Specification, Testing, and Verification, 1987, North-Holland.
17. Roy, V. and R. de Simone. “Auto/Autograph.” In Proceedings, CAV’90, LNCS 531, 1990.
18. Steifen, B.U. “Characteristic Formulae." In Proceedings ICALP, LNCS 372, 1989.
19. Steffen, B.U., and A. Ingölfsdöttir. “Characteristic Formulae for CCS with Divergence.” To appear in Information and Computation.
20. Stirling, C. and D. Walker. “Local Model Checking in the Modal Mu-Calculus.” In Proceedings of TAPSOFT '89, LNCS 351, 1989.
21. Tarski, A. “A Lattice-Theoretical Fixpoint Theorem and its Applications.” Pacific Journal of Mathematics, v. 5, 1955.