Skip to main content
SpringerLink
Log in

Efficient local correctness checking for single and alternating boolean equation systems

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

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

Included in the following conference series:

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. Andersen, H. R.: Model Checking and Boolean Graphs, ESOP'92, LNCS 582, 1992.

    Google Scholar 

  2. Andersen, H. R.: Verification of Temporal Properties of Concurrent Systems, PhD thesis, Aarhus University, DAAMI PB-445, 1993.

    Google Scholar 

  3. Arnold, A., Crubille, P.: A linear algorithm to solve fixed-points equations on transition systems, Information Processing Letters, vol.29, 57–66, 1988.

    Google Scholar 

  4. Cleaveland, R.: Tableau-Based Model Checking in the Propositional Mu-Calculus, Acta Informatica, 1990.

    Google Scholar 

  5. Cleaveland, R., Steffen, B.: A Linear-Time Model Checking Algorithm for the Alternation-Free Modal Mu-Calculus, CAV'91, LNCS 575, 1991.

    Google Scholar 

  6. Cleaveland, R., Klein, M., Steffen, B.: Faster Model Checking for the Modal Mu-Calculus, CAV'92, Forthcoming.

    Google Scholar 

  7. Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional μ-calculus, LICS, 267–278, 1986.

    Google Scholar 

  8. Larsen, K.G.: Efficient local correctness checking, CAV'92, Forthcoming.

    Google Scholar 

  9. Stirling, C., Walker, D.: Local model checking in the modal mu-calculus, TCS, October 1991, see also LNCS 351, 369–383, CAAP 1989.

    Google Scholar 

  10. Tarski, A.: A Lattice-Theoretical Fixpoint Theorem and its Applications, Pacific Journal of Mathematics, Vol. 5, 1955.

    Google Scholar 

  11. van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics (extended abstract), in Information Processing 89, North-Holland, 1989.

    Google Scholar 

  12. Vergauwen, B., Lewi, J.: A linear algorithm for solving fixed points equations on transition systems, CAAP'92, LNCS 581.

    Google Scholar 

  13. Vergauwen, B., Lewi, J.: A Linear Local Model Checking Algorithm for CTL, CONCUR'93, LNCS 715.

    Google Scholar 

  14. Winskel, G.: A note on model checking the modal ν-calculus, ICALP, LNCS 372, 1989, see also TCS 83, 1991.

    Google Scholar 

  15. Xinxin, L.: Specification and Decomposition in Concurrency, PhD thesis, Aalborg University, 1992. R 92-2005.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, K.U.Leuven, Celestijnenlaan 200A, B-3001, Leuven, Belgium

    B. Vergauwen & J. Lewi

Authors
  1. B. Vergauwen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Lewi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Serge Abiteboul Eli Shamir

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vergauwen, B., Lewi, J. (1994). Efficient local correctness checking for single and alternating boolean equation systems. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-58201-0_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58201-4

  • Online ISBN: 978-3-540-48566-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation