An automata-theoretic approach to infinite-state systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6200 LNCS, Issue , 2010, Pages 202-259

  Kupferman, Orna ^a   Piterman, Nir ^b   Vardi, Moshe Y ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AMOUNT OF INFORMATION; AUTOMATA-THEORETIC APPROACH; FAIRNESS CONSTRAINTS; FINITE STATE SYSTEMS; FINITE-STATE AUTOMATA; INFINITE STATE SYSTEMS; INFINITE TREES; INFINITE-STATE; MODEL CHECKING PROBLEM; REALIZABILITY; SEQUENTIAL SYSTEMS; SINGLE PATH; SYNTHESIS PROBLEMS; TEMPORAL PROPERTY; TREE AUTOMATA;

CALCULATIONS; MODEL CHECKING; ROBOTS; SPECIFICATIONS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 77955020949     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13754-9_11     Document Type: Conference Paper

References (101)

1. Alur, R., Chaudhuri, S., Madhusudan, P.: Languages of nested trees. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.4144, pp. 329-342. Springer, Heidelberg (2006)
2. Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.2988, pp. 67-79. Springer, Heidelberg (2004)
3. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. In: Proc. 38th IEEE Symp. on Foundations of Computer Science, pp. 100-109 (1997)
4. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. 36th ACM Symp. on Theory of Computing. ACM press, New York (2004)
5. Alur, R., Madhusudan, P.: Adding nesting structure to words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.4036, pp. 1-13. Springer, Heidelberg (2006)
6. Alur, R., La Torre, S., Madhusudan, P.: Modular strategies for infinite games on recursive game graphs. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.2725, pp. 67-79. Springer, Heidelberg (2003)
7. Bojanczyk, M., Colcombet, T.: Tree-walking automata cannot be determinized. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.3142, pp. 246-256. Springer, Heidelberg (2004)
8. Bojanczyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. In: Proc. 37th ACM Symp. on Theory of Computing. ACM press, New York (2005)
9. 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)
10. Biesse, P., Leonard, T., Mokkedem, A.: Finding bugs in an alpha microprocessor using satisfiability solvers. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.2102, pp. 454-464. Springer, Heidelberg (2001)
11. B́aŕany, V., Löding, C., Serre, O.: Regularity problem for visibly pushdown languages. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.3884, pp. 420-431. Springer, Heidelberg (2006)
12. Bozzelli, L., Murano, A., Peron, A.: Pushdown module checking. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.3835, pp. 504-518. Springer, Heidelberg (2005)
13. Bozzelli, L.: Complexity results on branching-time pushdown model checking. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.3855, pp. 65-79. Springer, Heidelberg (2005)
14. Burkart, O., Quemener, Y.-M.: Model checking of infinite graphs defined by graph grammars. In: Proc. 1st Int. workshop on verification of infinite states systems. ENTCS, p. 15. Elsevier, Amsterdam (1996)
15. Ball, T., Rajamani, S.: Bebop: A symbolic model checker for boolean programs. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol.1885, pp. 113-130. Springer, Heidelberg (2000)
16. Ball, T., Rajamani, S.: The SLAM toolkit. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.2102, pp. 260-264. Springer, Heidelberg (2001)
17. Burkart, O., Steffen, B.:Model checking for context-free processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.630, pp. 123-137. Springer, Heidelberg (1992)
18. Burkart, O., Steffen, B.: Composition, decomposition and model checking of pushdown processes. Nordic J. Comut. 2, 89-125 (1995)
19. Bouquet, A.-J., Serre, O., Walukiewicz, I.: Pushdown games with unboundedness and regular conditions. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.2914, pp. 88-99. Springer, Heidelberg (2003)
20. Bozzelli, L., La Torre, S., Peron, A.: Verification of well-formed communicating recursive state machines. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.3855, pp. 412-426. Springer, Heidelberg (2005)
21. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. Int. Congress on Logic, Method, and Philosophy of Science, pp. 1-12. Stanford University Press, Stanford (1960)
22. Burkart, O.: Model checking rationally restricted right closures of recognizable graphs. In: Moller, F. (ed.) Proc. 2nd Int. workshop on verification of infinite states systems (1997)
23. Cachat, T.: Higher order pushdown automata, the caucal hierarchy of graphs and parity games. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.2719, pp. 556-569. Springer, Heidelberg (2003)
24. Caucal, D.: On infinite transition graphs having a decidable monadic theory. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.1099, pp. 194-205. Springer, Heidelberg (1996)
25. Caucal, D.: On infinite transition graphs having a decidable monadic theory. Theoretical Computer Science 290(1), 79-115 (2003)
26. Clarke, E.M., Emerson, E.A., Sistla,A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languagues and Systems 8(2), 244-263 (1986)
27. Copty, F., Fix, L., Fraer, R., Giunchiglia, E., Kamhi, G., Tacchella, A., Vardi, M.Y.: Benefits of bounded model checking at an industrial setting. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.2102, pp. 436-453. Springer, Heidelberg (2001)
28. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
29. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the Association for Computing Machinery 28(1), 114-133 (1981)
30. Chen, H.,Wagner, D.: Mops: an infrastructure for examining security properties of software. In: Proc. 9th ACM conference on Computer and Communications Security, pp. 235-244. ACM, New York (2002)
31. Carayol, A., Wöhrle, S.: The caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.2914, pp. 112-123. Springer, Heidelberg (2003)
32. de Alfaro, L., Henzinger, T.A., Majumdar, R.: From verification to control: dynamic programs for omega-regular objectives. In: Proc. 16th IEEE Symp. on Logic in Computer Science, pp. 279-290. IEEE Computer Society Press, Los Alamitos (2001)
33. Dam, M.: CTL*and ECTL*as fragments of the modal μ-calculus. Theoretical Computer Science 126, 77-96 (1994)
34. Dickhfer, M., Wilke, T.: Timed alternating tree automata: the automata-theoretic solution to the TCTL model checking problem. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.1644, pp. 281-290. Springer, Heidelberg (1999)
35. Esparza, J., Etessami, K.: Verifying probabilistic procedural programs. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.3328, pp. 16-31. Springer, Heidelberg (2004)
36. Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.1855, pp. 232-247. Springer, Heidelberg (2000)
37. Engelfriet, J., Hoggeboom, H.J., van Best, J.-P.: Trips on trees. Acta Cybernetica 14, 51-64 (1999)
38. Emerson, E.A., Jutla, C.: The complexity of tree automata and logics of programs. In: Proc. 29th IEEE Symp. on Foundations of Computer Science, pp. 328-337 (1988)
39. Emerson, E.A., Jutla, C.: Tree automata, μ-calculus and determinacy. In: Proc. 32nd IEEE Symp. on Foundations of Computer Science, pp. 368-377 (1991)
40. Emerson, E.A., Jutla, C., Sistla, A.P.: On model-checking for fragments of μ- calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.697, pp. 385-396. Springer, Heidelberg (1993)
41. Esparza, J., Kucera, A., Schwoon, S.:Model-checking LTL with regular valuations for pushdown systems. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.2215, pp. 316-339. Springer, Heidelberg (2001)
42. Esparza, J., Kiefer, S., Schwoon, S.: Abstraction refinement with craig interpolation and symbolic pushdown systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.3920, pp. 489-503. Springer, Heidelberg (2006)
43. Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional μ-calculus. In: Proc. 1st IEEE Symp. on Logic in Computer Science, pp. 267-278 (1986)
44. Emerson, E.A.: Automata, tableaux, and temporal logics. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.193, pp. 79-87. Springer, Heidelberg (1985)
45. Emerson, E.A.: Model checking and the μ-calculus. In: Immerman, N., Kolaitis, P.G. (eds.) Descriptive Complexity and Finite Models, pp. 185-214. American Mathematical Society, Providence (1997)
46. Esparza, J., Schwoon, S.: A BDD-based model checker for recursive programs. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.2102, pp. 324-336. Springer, Heidelberg (2001)
47. Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. Journal of Computer and Systems Science 18, 194-211 (1979)
48. Gimbert, H.: Explosion and parity games over context-free graphs. Technical Report 2003-015, Liafa, CNRS, Paris University 7 (2003)
49. Gastin, P., Oddoux, D.: Ltl with past and two-way very-weak alternating automata. In: Rovan, B., Vojt́aš, P. (eds.) MFCS 2003. LNCS, vol.2747, pp. 439-448. Springer, Heidelberg (2003)
50. Gerth, R., Peled, D., Vardi, M.Y., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. In: Dembiski, P., Sredniawa, M. (eds.) Protocol Specification, Testing, and Verification, pp. 3-18. Chapman & Hall, Boca Raton (1995)
51. Godefroid, P., Wolper, P.: A partial approach to model checking. Information and Computation 110(2), 305-326 (1994)
52. Hardin, R.H., Har'el, Z., Kurshan, R.P.: COSPAN. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.1102, pp. 423-427. Springer, Heidelberg (1996)
53. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: A user guide to HYTECH. In: TACAS 1995. LNCS, vol.1019, pp. 41-71. Springer, Heidelberg (1995)
54. Henzinger, T.A., Kupferman, O., Vardi, M.Y.: A space-efficient on-the-fly algorithm for real-time model checking. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.1119, pp. 514-529. Springer, Heidelberg (1996)
55. Holzmann, G.J.: The model checker SPIN. IEEE Transactions on Software Engineering 23(5), 279-295 (1997)
56. Jha, S., Schwoon, S., Wang, H., Reps, T.: Weighted pushdown systems and trustmanagement systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.3920, p. 126. Springer, Heidelberg (2006)
57. Janin, D., Walukiewicz, I.: Automata for the modal μ-calculus and related results. In: H́ajek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.969, pp. 552-562. Springer, Heidelberg (1995)
58. Kahlon, V., Gupta, A.: An automata theoretic approach for model checking threads for ltl properties. In: Proc. 21st IEEE Symp. on Logic in Computer Science, pp. 101-110. IEEE press, Los Alamitos (2006)
59. Kahlon, V., Gupta, A.: On the analysis of interacting pushdown systems. In: Proc. 34th ACM Symp. on Principles of Programming Languages (2007)
60. Kahlon, V., Gupta, A., Sinha, N.: Symbolic model checking of concurrent programs using partial orders and on-the-fly transactions. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.4144, pp. 286-299. Springer, Heidelberg (2006)
61. Kahlon, V., Ivanĉíc, F., Gupta, A.: Reasoning about threads communicating via locks. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.3576, pp. 505-518. Springer, Heidelberg (2005)
62. Knapik, T., Niwinski, D., Urzczyn, P.,Walukiewicz, I.: Unsafe grammars and panic automata. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.3580, pp. 1450-1461. Springer, Heidelberg (2005)
63. Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27, 333-354 (1983)
64. Kupferman, O., Pnueli, A.: Once and for all. In: Proc. 10th IEEE Symp. on Logic in Computer Science, pp. 25-35 (1995)
65. Kupferman, O., Piterman, N., Vardi, M.Y.: Model checking linear properties of prefix-recognizable systems. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.2404, pp. 371-385. Springer, Heidelberg (2002)
66. Kurshan, R.P.: Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, Princeton (1994)
67. Kupferman, O., Vardi, M.Y.: Modular model checking. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol.1536, pp. 381-401. Springer, Heidelberg (1998)
68. Kupferman, O., Vardi, M.Y.: Robust satisfaction. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.1664, pp. 383-398. Springer, Heidelberg (1999)
69. Kupferman, O., Vardi, M.Y.: An automata-theoretic approach to reasoning about infinite-state systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.1855, pp. 36-52. Springer, Heidelberg (2000)
70. Kupferman, O., Vardi, M.Y.: Synthesis with incomplete information. In: Advances in Temporal Logic, pp. 109-127. Kluwer Academic Publishers, Dordrecht (2000)
71. Kupferman, O., Vardi, M.Y.: On bounded specifications. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.2250, pp. 24-38. Springer, Heidelberg (2001)
72. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. Journal of the ACM 47(2), 312-360 (2000)
73. Löding, C., Madhusudan, P., Serre, O.: Visibly pushdown games. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.3328, pp. 408-420. Springer, Heidelberg (2004)
74. Lichtenstein, O., Pnueli, A.: Checking that finite state concurrent programs satisfy their linear specification. In: Proc. 12th ACM Symp. on Principles of Programming Languages, pp. 97-107 (1985)
75. Larsen, K.G., Petterson, P.,Yi,W.: UPPAAL: Status& developments. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.1254, pp. 456-459. Springer, Heidelberg (1997)
76. Lichtenstein, O., Pnueli, A., Zuck, L.: The glory of the past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.193, pp. 196-218. Springer, Heidelberg (1985)
77. Muller, D.E., Schupp, P.E.: The theory of ends, pushdown automata, and secondorder logic. Theoretical Computer Science 37, 51-75 (1985)
78. Muller, D.E., Schupp, P.E.: Alternating automata on infinite trees. Theoretical Computer Science 54, 267-276 (1987)
79. Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.2471, pp. 2-26. Springer, Heidelberg (2002)
80. Ong, L.: On model-checking trees generated by higher-order recursion schemes. In: Proc. 21st IEEE Symp. on Logic in Computer Science, pp. 81-90. IEEE Computer Society Press, Los Alamitos (2006)
81. Piterman, N.: Verification of Infinite-State Systems. PhD thesis,Weizmann Institute of Science (2004)
82. Pnueli, A.: The temporal logic of programs. In: Proc. 18th IEEE Symp. on Foundations of Computer Science, pp. 46-57 (1977)
83. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th ACM Symp. on Principles of Programming Languages, pp. 179-190 (1989)
84. Piterman, N., Vardi, M.Y.: From bidirectionality to alternation. Theoretical Computer Science 295(1-3), 295-321 (2003)
85. Piterman, N., Vardi, M.: Global model-checking of infinite-state systems. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.3114, pp. 387-400. Springer, Heidelberg (2004)
86. Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in Cesar. In: Proc. 8th ACM Symp. on Principles of Programming Languages. LNCS, vol.137, pp. 337-351. Springer, Heidelberg (1982)
87. Rabin, M.O.: Decidability of second order theories and automata on infinite trees. Transaction of the AMS 141, 1-35 (1969)
88. Schwoon, S.: Model-checking pushdown systems. PhD thesis, Technische Universit ät München (2002)
89. Serre, O.: Parity games played on transition graphs of one-counter processes. In: Aceto, L., Inǵolfsd́ottir, A. (eds.) FOSSACS 2006. LNCS, vol.3921, pp. 337-351. Springer, Heidelberg (2006)
90. Suwimonteerabuth, D., Schwoon, S., Esparza, J.: Efficient algorithms for alternating pushdown systems with an application to the computation of certificate chains. In: Graf, S., Zhang,W. (eds.) ATVA 2006. LNCS, vol.4218, pp. 141-153. Springer, Heidelberg (2006)
91. Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.1443, pp. 628-641. Springer, Heidelberg (1998)
92. Visser, W., Barringer, H.: Practical CTL*model checking: Should SPIN be extended? Software Tools for Technology Transfer 2(4), 350-365 (2000)
93. Vardi,M.Y.,Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. 1st IEEE Symp. on Logic in Computer Science, pp. 332-344 (1986)
94. Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. Journal of Computer and Systems Science 32(2), 182-221 (1986)
95. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Information and Computation 115(1), 1-37 (1994)
96. Walukiewicz, I.: Pushdown processes: games and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.1102, pp. 62-74. Springer, Heidelberg (1996)
97. Walukiewicz, I.: Model checking ctl properties of pushdown systems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol.1974, pp. 127-138. Springer, Heidelberg (2000)
98. Walukiewicz, I.: Monadic second-order logic on tree-like structures. Theoretical Computer Science 275(1-2), 311-346 (2002)
99. Wilke, T.: CTL+ is exponentially more succinct than CTL. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol.1738, pp. 110-121. Springer, Heidelberg (1999)
100. Wolper, P.,Vardi, M.Y., Sistla, A.P.:Reasoning about infinite computation paths. In: Proc. 24th IEEE Symp. on Foundations of Computer Science, pp. 185-194 (1983)
101. Willems, B., Wolper, P.: Partial-order methods for model checking: From linear time to branching time. In: Proc. 11th IEEE Symp. on Logic in Computer Science, pp. 294-303 (1996)