Skip to main content
SpringerLink
Log in

Compositional proof systems for model checking infinite state processes

  • Session: Model Checking I
  • Conference paper
  • First Online:
CONCUR '95: Concurrency Theory (CONCUR 1995)

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

Included in the following conference series:

Abstract

We present the first compositional proof system for checking processes against formulas in the modal μ-calculus which is capable of handling general infinite-state processes. The proof system is obtained in a systematic way from the operational semantics of the underlying process algebra. A non-trivial proof example is given, and the proof system is shown to be sound in general, and complete for finite-state processes.

Partially supported by ESPRIT BRA project 8130 LOMAPS.

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. R. Amadio and M. Dam. Reasoning about higher-order processes. SICS Research report RR:94-18, 1994. To appear in Proc. CAAP'95.

    Google Scholar 

  2. H. Andersen, C. Stirling, and G. Winskel. A compositional proof system for the modal μ-calculus. In Proc. LICS'94, 1994.

    Google Scholar 

  3. J. Bradfield and C. Stirling. Local model checking for infinite state spaces. Theoretical Computer Science, 96:157–174, 1992.

    Article  Google Scholar 

  4. R. Cleaveland, M. Dreimüller, and B. Steffen. Faster model checking for the modal mu-calculus. In Proc. CAV'92, Lecture Notes in Computer Science, 663:383–394, 1992.

    Google Scholar 

  5. M. Dam. Model checking mobile processes (full version). SICS report RR 94:1, 1994. Prel. version appeared in Proc. Concur'93, LNCS 715, pp. 22–36.

    Google Scholar 

  6. E. A. Emerson and C. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Proc. LICS'86, pages 267–278, 1986.

    Google Scholar 

  7. J. Esparza. Decidability of model checking for infinite-state concurrent systems. Manuscript, 1995.

    Google Scholar 

  8. H. Hungar. Model checking of macro processes. In Proc. CAV'94, Lecture Notes in Computer Science, 818:169–181, 1994.

    Google Scholar 

  9. K. G. Larsen. Efficient local correctness checking. In Proc. CAV'92, Lecture Notes in Computer Science, 663, 1992.

    Google Scholar 

  10. K. G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. Journal of Logic and Computation, 1:761–795, 1991.

    Google Scholar 

  11. R. Milner. Communication and Concurrency. Prentice Hall International, 1989.

    Google Scholar 

  12. A. Simpson. Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS. Manuscript. To appear in Proc. LICS'95, 1995.

    Google Scholar 

  13. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. Theoretical Computer Science, 89:161–177, 1991.

    Article  Google Scholar 

  14. R. S. Streett and E. A. Emerson. An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation, 81:249–264, 1989.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SICS, Box 1263, S-164 28, Kista, Sweden

    Mads Dam

Authors
  1. Mads Dam
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Insup Lee Scott A. Smolka

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dam, M. (1995). Compositional proof systems for model checking infinite state processes. In: Lee, I., Smolka, S.A. (eds) CONCUR '95: Concurrency Theory. CONCUR 1995. Lecture Notes in Computer Science, vol 962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60218-6_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-60218-6_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60218-7

  • Online ISBN: 978-3-540-44738-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation