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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
Barnat, J.: Distributed Memory LTL Model Checking. PhD Thesis, Faculty of Informatics, Masaryk University Brno (2004)
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)
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)
Ben-Ari, M., Pnueli, A., Manna, Z.: The Temporal Logic of Branching Time. Acta Informatica 20(3), 207–226 (1983)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
Büchi, J.R.: Regular Canonical Systems. Arch. Math. Logik u. Grundlagenforschung 6, 91–111 (1964)
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)
Caucal, D.: On the Regular Structure of Prefix Rewriting. Theor. Comput. Sci. 106, 61–86 (1992)
Č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)
Č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)
Cherkassky, B.V., Goldberg, A.V.: Negative-Cycle Detection Algorithms. Mathematical Programming 85, 277–311 (1999)
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)
Dolev, D., Yao, A.: On the Security of Public Key Protocols. IEEE Transactions on Information Theory 29(2), 198–208 (1983)
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)
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)
Esparza, J.: Decidability of Model Checking for Infinite-State Concurrent Systems. Acta Informatica 2, 85–107 (1997)
Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.): Formal and Natural Computing. LNCS, vol. 2300. Springer, Heidelberg (2002)
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)
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)
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)
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)
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)
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)
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)
Holzmann, G.J.: The Spin Model Checker: Primer and Reference Manual. Addison Wesley, London (2003)
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)
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)
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)
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)
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)
Jančar, P., Kučera, A., Mayr, R.: Deciding Bisimulation-Like Equivalences with Finite-State Processes. Theor. Comput. Sci. 258, 409–433 (2001)
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)
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)
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)
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)
Lipton, R.: The Reachability Problem is Exponential-Space Hard. Technical Report 62, Department of Computer Science, Yale University (1976)
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)
Mayr, E.W.: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal on Computing 13(3), 441–460 (1984)
Mayr, R.: Decidability and Complexity of Model Checking Problems for Infinite-State Systems. PhD thesis, Technische Universität München (1998)
Mayr, R.: Process Rewrite Systems. Information and Computation 156(1), 264–286 (2000)
Moller, F.: Pushdown Automata, Multiset Automata and Petri Nets. In: MFCS Workshop on concurrency. ENTCS, vol. 18 (1998)
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)
Muller, D., Schupp, P.: The Theory of Ends, Pushdown Automata, and Second-Order Logic. Theor. Comput. Sci. 37, 51–75 (1985)
Pnueli, A.: The Temporal Logic of Programs. In: Proc. 18th IEEE Symposium on the Foundations of Computer Science, pp. 46–57 (1977)
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)
Reif, J.: Depth-First Search is Inherently Sequential. Information Proccesing Letters 20(5), 229–234 (1985)
Saraswat, V.A., Rinard, M.: Concurrent Constraint Programming. In: Proc. of 17th POPL, USA, pp. 232–245. ACM Press, New York (1990)
Srba, J.: Roadmap of Infinite Results. EATCS 78, 163–175 (2002)
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)
Strejček, J.: Rewrite Systems with Constraints. In: Proc. of EXPRESS’01. ENTCS, vol. 52 (2002)
Strejček, J.: Linear Temporal Logic: Expressiveness and Model Checking. PhD thesis, Faculty of Informatics, Masaryk University in Brno (2004)
Tarjan, R.: Depth First Search and Linear Graph Algorithms. SIAM Journal on Computing, 146–160 (January 1972)
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)
Author information
Authors and Affiliations
Editor information
Rights 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)