Skip to main content
SpringerLink
Log in

Simple linear-time algorithms for minimal fixed points

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1443))

Included in the following conference series:

Abstract

We present global and local algorithms for evaluating minimal fixed points of dependency graphs, a general problem in fixed-point computation and model checking. Our algorithms run in linear-time, matching the complexity of the best existing algorithms for similar problems, and are simple to understand. The main novelty of our global algorithm is that it does not use the counter and “reverse list” data structures commonly found in existing linear-time global algorithms. This distinction plays an essential role in allowing us to easily derive our local algorithm from our global one. Our local algorithm is distinguished from existing linear-time local algorithms by a combination of its simplicity and suitability for direct implementation.

We also provide linear-time reductions from the problems of computing minimal and maximal fixed points in Boolean graphs to the problem of minimal fixed-point evaluation in dependency graphs. This establishes dependency graphs as a suitable framework in which to express and compute alternation-free fixed points.

Finally, we relate HORNSAT, the problem of Horn formula satisfiability, to the problem of minimal fixed-point evaluation in dependency graphs. In particular, we present straightforward, linear-time reductions between these problems for both directions of reducibility. As a result, we derive a linear-time local algorithm for HORNSAT, the first of its kind as far as we are aware.

Research supported in part by NSF grants CCR-9505562 and CCR-9705998, and AFOSR. grants F49620-95-1-0508 and F49620-9C-1-0087.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  MATH  MathSciNet  Google Scholar 

  2. H. R. Andersen. Model checking and boolean graphs. Theoretical Computer Science, 126(1), 1994.

    Google Scholar 

  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.

    Google Scholar 

  4. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skele-tons 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.

    Google Scholar 

  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.

    Google Scholar 

  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 '92), Vol. 663 of Lecture Notes in Computer Science, pages 410–422. Springer-Verlag, 1992.

    Google Scholar 

  7. R. Cleaveland. Tableau-based model checking in the propositional mu-calculus.Acta Informatica, 27:725–747, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  Google Scholar 

  9. E. M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4), December 1996.

    Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  11. L. Henschen and L. Wos. Unit refutations and horn sets. Journal of the ACM, 21:590–605, 1974.

    Article  MATH  MathSciNet  Google Scholar 

  12. D. Kozen. Results on the propositional /gm-calculus. Theoretical Computer Science, 27:333–354, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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 '98), Lecture Notes in Computer Science. Springer-Verlag, 1998.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  19. C. Stirling and D. Walker. Local model checking in the modal mu-calculus.Theoretical Computer Science, 89(1), 1991.

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York at Stony Brook, 11794, Stony Brook, NY, USA

    Xinxin Liu & Scott A. Smolka

Authors
  1. Xinxin Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Scott A. Smolka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, X., Smolka, S.A. (1998). Simple linear-time algorithms for minimal fixed points. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055040

Download citation

  • DOI: https://doi.org/10.1007/BFb0055040

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

  • Online ISBN: 978-3-540-68681-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation