Simple linear-time algorithms for minimal fixed points

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

Volumn 1443 LNCS, Issue , 1998, Pages 53-66

  Liu, Xinxin ^a   Smolka, Scott A ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CLUSTERING ALGORITHMS; MODEL CHECKING;

BOOLEAN GRAPHS; DEPENDENCY GRAPHS; FIXED-POINT COMPUTATION; GLOBAL ALGORITHMS; HORN FORMULAS; LINEAR TIME REDUCTION; LINEAR-TIME ALGORITHMS; LOCAL ALGORITHM;

GRAPHIC METHODS;

EID: 84878556800     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055040     Document Type: Conference Paper

References (20)

1. A. Arnold and P. Crubille. A linear algorithm to solve fixed-point equations on transition systems. Information Processing Letters, 29:57-66, September 1988.
2. H. R. Andersen. Model checking and boolean graphs. Theoretical Computer Science, 126(1), 1994.
3. G. S. Bhat and R. Cleaveland. Efficient model checking via the equational μ-calculus. In E. M. Clarke, editor, 11th Annual Symposium on Logic in Computer Science (LICS '96), pages 304-312, New Brunswick, NJ, July 1996. Computer Society Press.
4. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In D. Kozen, editor, Proceedings of the Workshop on Logic of Programs, Yorktown Heights, volume 131 of Lecture Notes in Computer Science, pages 52-71. Springer-Verlag, 1981.
5. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM TOPLAS, 8(2), 1986.
6. R. Cleaveland, M. Klein, and B. Steffen. Faster model checking for the modal mu-calculus. In G.v. Bochmann and D.K. Probst, editors, Proceedings of the Fourth International Conference on Computer Aided Verification (CAV '02), Vol. 663 of Lecture Notes in Computer Science, pages 410-422. Springer-Verlag, 1992.
7. R. Cleaveland. Tableau-based model checking in the propositional mu-calculus. Acta Informatica, 27:725-747, 1990.
8. R. Cleaveland and B. U. Steffen. A linear-time model checking algorithm for the alternation-free modal mu-calculus. Formal Methods in System Design, 2:121-147, 1993.
9. E. M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4), December 1996.
10. W. F. Dowling and J. H. Gallier. Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming, 3:267-284, 1984.
11. L. Henschen and L. Wos. Unit refutations and horn sets. Journal of the ACM, 21:590-605, 1974.
12. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
13. K.G. Larsen. Proof systems for Hennessy-Milner logic with recursion. Lecture Notes In Computer Science, Springer Verlag, 299, 1988. in Proceedings of 13th Colloquium on Trees in Algebra and Programming 1988.
14. K.G. Larsen. Efficient local correctness checking. Lecture Notes In Computer Science, Springer Verlag, 663, 1992. in Proceedings of the 4th Workshop on Computer Aided Verification, 1992.
15. X. Liu, C. R. Ramakrishnan, and S. A. Smolka. Fully local and efficient evaluation of alternating fixed points. In Proceedings of the Fourth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '08), Lecture Notes in Computer Science. Springer-Verlag, 1998.
16. V.R. Pratt. A decidable mu-calculus. In Proceedings of the 22nd IEEE Ann. Symp. on Foundations of Computer Science, Nashville, Tennessee, pages 421-427, 1981.
17. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, volume 137 of Lecture Notes in Computer Science, Berlin, 1982. Springer-Verlag.
18. S. K. Shukla, H. B. Hunt III, and D. J. Rosenkrantz. HORNSAT, model checking, verification and games. In R. Alur and T. A. Henzinger, editors, Computer Aided Verification (CAV '96), volume 1102 of Lecture Notes in Computer Science, pages 99-110, New Brunswick, New Jersey, July 1996. Springer-Verlag.
19. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. Theoretical Computer Science, 89(1), 1991.
20. B. Vergauwen and J. Lewi. Efficient local correctness checking for single and alternating boolean equation systems. In Proceedings of ICALP'94, pages 304-315. LNCS 820, 1994.