Skip to main content
SpringerLink
Log in

Practical Efficient Modular Linear-Time Model-Checking

  • Conference paper
Automated Technology for Verification and Analysis (ATVA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5311))

Abstract

This paper shows how the modular structure of composite systems can guide the state-space exploration in explicit-state linear-time model-checking and make it more efficient in practice. Given a composite system where every module has input and output variables — and variables of different modules can be connected — a total ordering according to which variables are generated is determined, through heuristics based on graph-theoretical analysis of the modular structure. The technique is shown to outperform standard exploration techniques (that do not take the modular structure information into account) by several orders of magnitude in experiments with Spin models of MTL formulas.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2000)

    Google Scholar 

  2. Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 996–1072. Elsevier Science, Amsterdam (1990)

    Google Scholar 

  3. Furia, C.A., Spoletini, P.: Practical efficient modular linear-time model-checking (July 2008); (extended version), http://home.dei.polimi.it/furia/

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  5. Harel, D., Pnueli, A.: On the development of reactive systems. In: Logics and Models of Concurrent Systems, pp. 477–498 (1985)

    Google Scholar 

  6. Holzmann, G.J.: The SPIN Model Checker: Primer and Reference Manual (2003)

    Google Scholar 

  7. Kupferman, O., Vardi, M.Y.: An automata-theortetic approach to modular model checking. ACM TOPLAS 22(1), 87–128 (2000)

    Article  Google Scholar 

  8. Kupferman, O., Vardi, M.Y., Wolper, P.: Module checking. Information and Computation 164(2), 322–344 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Morzenti, A., Pradella, M., San Pietro, P., Spoletini, P.: Model-checking TRIO specifications in SPIN. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 542–561. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Parnas, D.L.: On the criteria to be used in decomposing systems into modules. Communications of the ACM 15(12), 1053–1058 (1972)

    Article  Google Scholar 

  11. Pradella, M., San Pietro, P., Spoletini, P., Morzenti, A.: Practical model checking of LTL with past. In: ATVA 2003, pp. 135–146 (2003)

    Google Scholar 

  12. Spoletini, P.: Verification of Temporal Logic Specification via Model Checking. PhD thesis, DEI, Politecnico di Milano (May 2005)

    Google Scholar 

  13. Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 133–164. Elsevier Science, Amsterdam (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEI, Politecnico di Milano, Milano, Italy

    Carlo A. Furia

  2. DSCPI, Università degli Studi dell’Insubria, Como, Italy

    Paola Spoletini

Authors
  1. Carlo A. Furia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paola Spoletini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Information & Communication, Division of Computer and Communication Engineering, Korea University, Anam-Dong, Seongbuk-Gu, 136-701, Seoul, South Korea

    Sungdeok (Steve) Cha

  2. Departmnet of Computer Science and Engineering, Korea University, Anam-Dong, Seongbuk-Gu, 136-702, Seoul, South Korea

    Jin-Young Choi

  3. KAIST, Department of Computer Science, Guseong-Dong, Yuseong-Gu, 305-701, Daejon, South Korea

    Moonzoo Kim

  4. School of Engineering and Applied Science, Department of Computer and Information Science,, University of Pennsylvania, Levine Hall, Room 602, 3330 Walnut Street, PA 19104-6389, Philadelphia, USA

    Insup Lee

  5. Thomas M. Siebel Center , University of Illinois at Urbana-Champaign, 201 N. Goodwin Avenue, IL 61801-2302, Urbana, USA

    Mahesh Viswanathan

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Furia, C.A., Spoletini, P. (2008). Practical Efficient Modular Linear-Time Model-Checking. In: Cha, S.(., Choi, JY., Kim, M., Lee, I., Viswanathan, M. (eds) Automated Technology for Verification and Analysis. ATVA 2008. Lecture Notes in Computer Science, vol 5311. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88387-6_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88387-6_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88386-9

  • Online ISBN: 978-3-540-88387-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation