Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Computer Science

SOFSEM 2007: SOFSEM 2007: Theory and Practice of Computer Science pp 9–28Cite as

Model-Checking Large Finite-State Systems and Beyond

  • Conference paper

  • 1666 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4362))

Abstract

With the increase in the complexity of computer systems, it becomes even more important to develop formal methods for ensuring their quality. Early detection of errors requires application of advanced analysis, verification and validation techniques for modelling resources, temporal properties, datatype invariants, and security properties. Various techniques for automated and semi-automated analysis and verification of computer systems have been proposed.

This work has been partially supported by the Grant Agency of Czech Republic grant No. 201/06/1338 and the Academy of Sciences grant No. 1ET408050503.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bao, T., Jones, M.: Time-Efficient Model Checking with Magnetic Disks. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 526–540. Springer, Heidelberg (2005)

    Google Scholar 

  2. Barnat, J., Brim, L., Chaloupka, J.: Parallel Breadth-First Search LTL Model-Checking. In: 18th IEEE International Conference on Automated Software Engineering, pp. 106–115. IEEE Computer Society Press, Los Alamitos (2003)

    Chapter  Google Scholar 

  3. Barnat, J., Brim, L.: Distributed LTL Model-Checking in SPIN. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 200–216. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Barnat, J., Forejt, V., Leucker, M., Weber, M.: DivSPIN – A SPIN Compatible Distributed Model Checker. In: Proc. 4th International Workshop on Parallel and Distributed Methods in Verification, pp. 95–100 (2005)

    Google Scholar 

  5. Barnat, J.: Distributed Memory LTL Model Checking. PhD Thesis, Faculty of Informatics, Masaryk University Brno (2004)

    Google Scholar 

  6. Behrmann, G., Hune, T.S., Vaandrager, F.W.: Distributed Timed Model Checking – How the Search Order Matters. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 216–231. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Bell, A., Haverkort, B.R.: Sequential and Distributed Model Checking of Petri Net Specifications. Int. J. Softw. Tools Technol. Transfer 7(1), 43–60 (2005)

    Article  Google Scholar 

  8. Ben-Ari, M., Pnueli, A., Manna, Z.: The Temporal Logic of Branching Time. Acta Informatica 20(3), 207–226 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  9. Blom, S., Orzan, S.: A Distributed Algorithm for Strong Bisimulation Reduction Of State Spaces. Int. J. Softw. Tools Technol. Transfer 7(1), 74–86 (2005)

    Article  Google Scholar 

  10. Bollig, B., Leucker, M., Weber, M.: Parallel Model Checking for the Alternation Free μ-Calculus. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031, pp. 543–558. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Bouajjani, A., Echahed, R., Habermehl, P.: On the Verification Problem of Nonregular Properties for Nonregular Processes. In: Proc. of LICS’95, pp. 123–133. IEEE Computer Society Press, Los Alamitos (1995)

    Google Scholar 

  12. Bouajjani, A., Esparza, J., Maler, O.: Reachability Analysis of Pushdown Automata: Application to Model-Checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135–150. Springer, Heidelberg (1997)

    Google Scholar 

  13. Bouajjani, A., Habermehl, P.: Constrained Properties, Semilinear Systems, and Petri Nets. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 481–497. Springer, Heidelberg (1996)

    Google Scholar 

  14. Bouajjani, A., Strejček, J., Touili, T.: On Symbolic Verification of Weakly Extended PAD. In: EXPRESS 2006, Electronic Notes in Theoretical Computer Science, Elsevier Science, to appear (2006)

    Google Scholar 

  15. Bouajjani, A., Touili, T.: Reachability Analysis of Process Rewrite Systems. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 74–87. Springer, Heidelberg (2003)

    Google Scholar 

  16. Bozzelli, L.: Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties. In: Cousot, R. (ed.) Verification, Model Checking, and Abstract Interpretation. 6th International Conference, VMCAI 2005, Paris, France, January 17-19, 2005. LNCS, vol. 3385, pp. 282–297. Springer, Berlin Heidelberg New York (2005)

    Google Scholar 

  17. Bozzelli, L., Křetínský, M., Řehák, V., Strejček, J.: On Decidability of LTL Model Checking for Process Rewrite Systems. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 248–259. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  18. Brim, L., Černá, I., Krčál, P., Pelánek, R.: Distributed LTL Model Checking Based on Negative Cycle Detection. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 96–107. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  19. Brim, L., Černá, I., Moravec, P., Šimša, J.: Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 352–366. Springer, Heidelberg (2004)

    Google Scholar 

  20. Brim, L., Černá, I., Moravec, P., Šimša, J.: How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors. In: 4th International Workshop on Parallel and Distributed Methods in verifiCation, PDMC’05 (July 2005)

    Google Scholar 

  21. Büchi, J.R.: Regular Canonical Systems. Arch. Math. Logik u. Grundlagenforschung 6, 91–111 (1964)

    Article  MATH  Google Scholar 

  22. Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on Infinite Structures. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 545–623. Elsevier, Amsterdam (2001)

    Chapter  Google Scholar 

  23. Caucal, D.: On the Regular Structure of Prefix Rewriting. Theor. Comput. Sci. 106, 61–86 (1992)

    Article  MathSciNet  Google Scholar 

  24. Černá, I., Pelánek, R.: Distributed Explicit Fair Cycle Detection (Set Based Approach). In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 49–73. Springer, Heidelberg (2003)

    Google Scholar 

  25. Černá, I., Pelánek, R.: Relating Hierarchy of Temporal Properties to Model Checking. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 318–327. Springer, Heidelberg (2003)

    Google Scholar 

  26. Cherkassky, B.V., Goldberg, A.V.: Negative-Cycle Detection Algorithms. Mathematical Programming 85, 277–311 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  27. Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design 1, 275–288 (1992)

    Article  Google Scholar 

  28. Dolev, D., Yao, A.: On the Security of Public Key Protocols. IEEE Transactions on Information Theory 29(2), 198–208 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  29. Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Property Specification Patterns for Finite-State Verification. In: Proc. Workshop on Formal Methods in Software Practice, USA, pp. 7–15. ACM Press, New York (1998)

    Chapter  Google Scholar 

  30. Edelkamp, S., Jabbar, S.: Large-Scale Directed Model Checking LTL. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol. 3925, pp. 1–18. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  31. Esparza, J.: Decidability of Model Checking for Infinite-State Concurrent Systems. Acta Informatica 2, 85–107 (1997)

    Article  MathSciNet  Google Scholar 

  32. Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.): Formal and Natural Computing. LNCS, vol. 2300. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  33. Esparza, J., Kiehn, A.: On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 353–366. Springer, Heidelberg (1995)

    Google Scholar 

  34. Fisler, K., Fraer, R., Vardi, G.Y., Yang, Z.-J.: Is There a Best Symbolic Cycle-Detection Algorithm? In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031, pp. 420–434. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  35. Garavel, H., Mateescu, R., Smarandache, I.M.: Parallel State Space Construction for Model-Checking. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 217–234. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  36. Grumberg, O., Heyman, T., Ifergan, N., Schuster, A.: Achieving Speedups in Distributed Symbolic Reachability Analysis through Asynchronous Computation. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 129–145. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  37. Grumberg, O., Heyman, T., Schuster, A.: Distributed Model Checking for μ-Calculus. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 350–362. Springer, Heidelberg (2001)

    Google Scholar 

  38. Habermehl, P.: On the Complexity of the Linear-Time μ-Calculus for Petri Nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 102–116. Springer, Heidelberg (1997)

    Google Scholar 

  39. Haverkort, B.R., Bell, A., Bohnenkamp, H.C.: On the Efficient Sequential and Distributed Generation of Very Large Markov Chains From Stochastic Petri Nets. In: Proc. 8th Int. Workshop on Petri Net and Performance Models, pp. 12–21. IEEE Computer Society Press, Los Alamitos (1999)

    Google Scholar 

  40. Holzmann, G.J.: The Spin Model Checker: Primer and Reference Manual. Addison Wesley, London (2003)

    Google Scholar 

  41. Holzmann, G.J., Peled, D., Yannakakis, M.: On Nested Depth First Search. In: Proc. SPIN Workshop on Model Checking of Software, pp. 23–32. American Mathematical Society, Providence (1996)

    Google Scholar 

  42. Hüttel, H., Srba, J.: Recursion vs. Replication in Simple Cryptographic Protocols. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 178–187. Springer, Heidelberg (2005)

    Google Scholar 

  43. Jabbar, S., Edelkamp, S.: Parallel External Directed Model Checking with Linear I/O. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 237–251. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  44. Jančar, P.: High Undecidability of Weak Bisimilarity for Petri Nets. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 349–363. Springer, Heidelberg (1995)

    Google Scholar 

  45. Jančar, P., Moller, F.: Checking Regular Properties of Petri Nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 348–362. Springer, Heidelberg (1995)

    Google Scholar 

  46. Jančar, P., Kučera, A., Mayr, R.: Deciding Bisimulation-Like Equivalences with Finite-State Processes. Theor. Comput. Sci. 258, 409–433 (2001)

    Article  MATH  Google Scholar 

  47. Křetínský, M., Řehák, V., Strejček, J.: Extended Process Rewrite Systems: Expressiveness and Reachability. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 355–370. Springer, Heidelberg (2004)

    Google Scholar 

  48. Křetínský, M., Řehák, V., Strejček, J.: On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit. ENTCS 98, 75–88 (2004)

    Google Scholar 

  49. Křetínský, M., Řehák, V., Strejček, J.: Reachability of Hennessy-Milner Properties for Weakly Extended PRS. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 213–224. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  50. Kučera, A., Schnoebelen, P.: A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 371–386. Springer, Heidelberg (2004)

    Google Scholar 

  51. Lipton, R.: The Reachability Problem is Exponential-Space Hard. Technical Report 62, Department of Computer Science, Yale University (1976)

    Google Scholar 

  52. Lugiez, D., Schnoebelen, P.: The Regular Viewpoint on PA-Processes. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 50–66. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  53. Mayr, E.W.: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal on Computing 13(3), 441–460 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  54. Mayr, R.: Decidability and Complexity of Model Checking Problems for Infinite-State Systems. PhD thesis, Technische Universität München (1998)

    Google Scholar 

  55. Mayr, R.: Process Rewrite Systems. Information and Computation 156(1), 264–286 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  56. Moller, F.: Pushdown Automata, Multiset Automata and Petri Nets. In: MFCS Workshop on concurrency. ENTCS, vol. 18 (1998)

    Google Scholar 

  57. Muller, D., Saoudi, A., Schupp, P.: Alternating Automata, the Weak Monadic Theory of Trees and Its Complexity. Theor. Comput. Sci. 97(1–2), 233–244 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  58. Muller, D., Schupp, P.: The Theory of Ends, Pushdown Automata, and Second-Order Logic. Theor. Comput. Sci. 37, 51–75 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  59. Pnueli, A.: The Temporal Logic of Programs. In: Proc. 18th IEEE Symposium on the Foundations of Computer Science, pp. 46–57 (1977)

    Google Scholar 

  60. Ravi, K., Bloem, R., Somenzi, F.: A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 143–160. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  61. Reif, J.: Depth-First Search is Inherently Sequential. Information Proccesing Letters 20(5), 229–234 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  62. Saraswat, V.A., Rinard, M.: Concurrent Constraint Programming. In: Proc. of 17th POPL, USA, pp. 232–245. ACM Press, New York (1990)

    Google Scholar 

  63. Srba, J.: Roadmap of Infinite Results. EATCS 78, 163–175 (2002)

    MathSciNet  Google Scholar 

  64. Stern, U., Dill, D.L.: Using Magnetic Disc Instead of Main Memory in the murϕ Verifier. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 172–183. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  65. Strejček, J.: Rewrite Systems with Constraints. In: Proc. of EXPRESS’01. ENTCS, vol. 52 (2002)

    Google Scholar 

  66. Strejček, J.: Linear Temporal Logic: Expressiveness and Model Checking. PhD thesis, Faculty of Informatics, Masaryk University in Brno (2004)

    Google Scholar 

  67. Tarjan, R.: Depth First Search and Linear Graph Algorithms. SIAM Journal on Computing, 146–160 (January 1972)

    Google Scholar 

  68. Vardi, M.Y., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: IEEE Symposium on Logic in Computer Science, pp. 322–331. Computer Society Press, Los Alamitos (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Informatics, Masaryk University, Brno, Czech Republic

    Luboš Brim & Mojmír Křetínský

Authors
  1. Luboš Brim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mojmír Křetínský
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen Giuseppe F. Italiano Wiebe van der Hoek Christoph Meinel Harald Sack František Plášil

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Brim, L., Křetínský, M. (2007). Model-Checking Large Finite-State Systems and Beyond. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds) SOFSEM 2007: Theory and Practice of Computer Science. SOFSEM 2007. Lecture Notes in Computer Science, vol 4362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69507-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69507-3_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69506-6

  • Online ISBN: 978-3-540-69507-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation