Efficient computation of nested fix-points, with applications to model checking

  • B. Vergauwen
  • J. Lewi
  • I. Avau
  • A. Poté
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 827)


The paper presents a general algorithm for computing nested fix-points over complete lattices of finite height. The method presented relies on techniques familiar from the realm of functional programming languages, such as e.g. lazy evaluation. The algorithm is constructed in a stepwise fashion: We start with a schema based on some simple facts of fix-point theory. As such this schema is easily seen to be correct. It is, however, rather inefficient. We then trace the sources of inefficiency and refine the basic schema resulting in a correct and more efficient algorithm. After presenting the general algorithm, we apply it, by means of illustration, to the field of model checking.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A1]
    Andersen, H. R.: Model Checking and Boolean Graphs, ESOP'92, LNCS 582, 1992Google Scholar
  2. [A2]
    Andersen, H. R.: Verification of Temporal Properties of Concurrent Systems, PhD thesis, Aarhus University, DAIMI PB — 445, 1993Google Scholar
  3. [AC]
    Arnold, A., Crubille, P.: A linear algorithm to solve fixed-points equations on transition systems, Information Processing Letters, vol.29, 57–66, 1988Google Scholar
  4. [CES]
    Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Progr. Languages and Systems, Vol.8, No. 2, pp. 244–263, April 1986Google Scholar
  5. [C]
    Cleaveland, R.: Tableau-based model checking in the propositional mucalculus, Acta Informatica, 1990Google Scholar
  6. [CKS]
    Cleaveland, R., Klein, M., Steffen, B.: Faster Model Checking for the Modal MuCalculus, CAV'92, LNCS 663Google Scholar
  7. [CS1]
    Cleaveland, R., Steffen, B.: Computing Behavioural Relations, Logically, ICALP 91, pp. 127–138, LNCS 510Google Scholar
  8. [CS2]
    Cleaveland, R. and Steffen, B.: A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus, CAV'91, LNCS 575, 1992Google Scholar
  9. [EL]
    Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional μ-calculus, LICS, 267–278, 1986Google Scholar
  10. [K]
    Kozen, D.: Results on the propositional mu-calculus, TCS 17, 1983Google Scholar
  11. [L1]
    Larsen, K.G.: Efficient Local Correctness Checking, CAV'92, LNCS 663Google Scholar
  12. [L2]
    Larsen, K.G.: Proof systems for Hennessy-Milner logic with recursion, CAAP, 1988, see also TCS, 72, 1990Google Scholar
  13. [LP]
    Lichtenstein, O., Pnueli, A.: Checking that finite state concurrent programs satisfy their linear specification, (Proc.) 12th ACM annual Symposium on Principles of Programming Languages, pp. 97–107, 1985Google Scholar
  14. [SW]
    Stirling, C., Walker, D.: Local model checking in the modal mu-calculus, TCS, October 1991, see also LNCS 351, 369–383, CAAP 1989Google Scholar
  15. [S]
    Stirling, C.: Modal and Temporal Logics, in Handbook of Logic in Computer Sciences, Volume 2. Edited by S. Abramsky, M. Gabbay and T.S.E. Maibaum; Oxford Science Publications, 1992Google Scholar
  16. [T]
    Tarski, A.: A Lattice-Theoretical Fixpoint Theorem and its Applications, Pacific Journal of Mathematics, 5: 285–309, 1955Google Scholar
  17. [VL1]
    Vergauwen, B., Lewi, J.: A linear algorithm for solving fixed points equations on transition systems, CAAP'92, LNCS 581, 322–341Google Scholar
  18. [VL2]
    Vergauwen, B., Lewi, J.: A Linear Local Model Checking Algorithm for CTL, CONCUR'93, LNCS 715Google Scholar
  19. [W]
    Winskel, G.: A note on model checking the modal nu-calculus, ICALP, LNCS 372, 1989, see also TCS 83, 1991Google Scholar
  20. [X]
    Xinxin, L.: Specification and Decomposition in Concurrency, PhD thesis, Aalborg University, 1992, R 92-2005Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • B. Vergauwen
    • 1
  • J. Lewi
    • 1
  • I. Avau
    • 1
  • A. Poté
    • 1
  1. 1.Department of Computer ScienceK.U.LeuvenLeuvenBelgium

Personalised recommendations