An automata-theoretic approach to reasoning about infinite-state systems

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

Volumn 1855, Issue , 2000, Pages 36-52

  Kupferman, Orna ^a   Vardi, Moshe Y ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; COMPUTER AIDED ANALYSIS; FORESTRY; SPECIFICATIONS;

AMOUNT OF INFORMATION; AUTOMATA-THEORETIC APPROACH; FINITE STATE SYSTEMS; INFINITE STATE SYSTEMS; MODEL CHECKING PROBLEM; SEQUENTIAL SYSTEMS; SYNTHESIS PROBLEMS; TWO-WAY TREE AUTOMATON;

MODEL CHECKING;

EID: 84944414150     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_7     Document Type: Conference Paper

References (52)

1. [AHK97] R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. 38th FOCS, pp. 100–109, October 1997.
2. I. Beer, S. Ben-David, D. Geist, R. Gewirtzman, and M. Yoeli. Methodology and system for practical formal verification of reactive hardware. In Proc. 6th CAV, LNCS 818, pp. 182–193, June 1994.
3. [BCMS00] O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification on infinite structures. Unpublished manuscript, 2000.
4. [BE96] O. Burkart and J. Esparza. More infinite results. Electronic Notes in Theoretical Computer Science, 6, 1996.
5. [BEM97] A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. 8th CONCUR, LNCS 1243, pp. 135–150, July 1997.
6. [BQ96] O. Burkart and Y.-M. Quemener. Model checking of infinite graphs defined by graph grammers. In Proc. 1st International workshop on verification of infinite states systems, volume 6 of ENTCS, page 15. Elsevier, 1996.
7. [BS92] O. Burkart and B. Steffen. Model checking for context-free processes. In Proc. 3rd CONCUR, LNCS 630, pp. 123–137. 1992.
8. O. Burkart and B. Steffen. Composition, decomposition and model checking of pushdown processes. Nordic J. Comut., 2:89–125, 1999.
9. O. Burkart and B. Steffen. Model checking the full modal µ-calculus for infinite sequential processes. Theoretical Computer Science, 221:251–270, 1999.
10. O. Burkart. Automatic Verification of Sequential Infinite-State Processes. LNCS 1354, 1997.
11. O. Burkart. Model checking rationally restricted right closures of recognizable graphs. In Proc. 2nd International Workshop on Verification of Infinite State Systems, 1997.
12. D. Caucal. On infinite transition graphs having a decidable monadic theory. In Proc. 23st ICALP, LNCS 1099, pp. 194–205, 1996.
13. [CES86] E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, January 1986.
14. [CGP99] E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
15. [DW99] M. Dickhfer and T. Wilke. Timed alternating tree automata: the automata-theoretic solution to the TCTL model checking problem. In Proc. 26th ICALP, LNCS 1644, pp. 281–290, 1999.
16. [EHRS00] J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Proc. 12th CAV, 2000.
17. [EJ88] E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proc. 29th FOCS, pp. 328–337, October 1988.
18. [EJ91] E.A. Emerson and C. Jutla. Tree automata, µ-calculus and determinacy. In Proc. 32nd FOCS, pp. 368–377, October 1991.
19. [EJS93] E.A. Emerson, C. Jutla, and A.P. Sistla. On model-checking for fragments of _- calculus. In Proc. 5th CAV, LNCS 697, pp. 385–396, June 1993.
20. E.A. Emerson. Automata, tableaux, and temporal logics. In Proc.Workshop on Logic of Programs, LNCS 193, pp. 79–87, 1985.
21. [FL79] M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, 18:194–211, 1979.
22. [FWW97] A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown automata. In Proc. 2nd InternationalWorkshop on Verification of Infinite State Systems, 1997.
23. [GPVW95] R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification, Testing, and Verification, pp. 3–18. Chapman & Hall, August 1995.
24. [GW94] P. Godefroid and P. Wolper. A partial approach to model checking. Information and Computation, 110(2):305–326, May 1994.
25. [HHK96] R.H. Hardin, Z. Har’el, and R.P. Kurshan. COSPAN. In Computer AidedVerification, Proc. 8th Int. Conference, LNCS 1102, pp. 423–427, 1996.
26. [HHWT95] T.A. Henzinger, P.-H Ho, and H. Wong-Toi. A user guide to hytech. In Proc. TACAS, LNCS 1019, pp. 41–71, 1995.
27. [HKV96] T.A. Henzinger, O. Kupferman, and M.Y. Vardi. A space-efficient on-the-fly algorithm for real-time model checking. In Proc. 7thCONCUR, LNCS 1119, pp. 514–529, August 1996.
28. G.J. Holzmann. The model checker SPIN. IEEE Trans. on Software Engineering, 23(5):279–295, May 1997. Special issue on Formal Methods in Software Practice.
29. [JW95] D. Janin and I. Walukiewicz. Automata for the modal µ-calculus and related results. In Proc. 20th MFCS,LNCS, pp. 552–562, 1995.
30. D. Kozen. Results on the propositional µ-calculus. Theoretical Computer Science, 27:333–354, 1983.
31. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
32. [KV98] O. Kupferman and M.Y. Vardi. Modular model checking. In Proc. Compositionality Workshop, LNCS 1536, pp. 381–401, 1998.
33. [KV99] O. Kupferman and M.Y. Vardi. Robust satisfaction. In Proc. 10th CONCUR, LNCS 1664, pp. 383–398, 1999.
34. [KV00] O. Kupferman and M.Y. Vardi. Synthesis with incomplete informatio. In Advances in Temporal Logic, pp. 109–127. Kluwer Academic Publishers, January 2000.
35. [KVW00] O. Kupferman, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2), March 2000.
36. [LP85] O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th POPL, pp. 97–107, January 1985.
37. [LPY97] K. G. Larsen, P. Petterson, and W. Yi. UPPAAL: Status & developments. In Proc. 9th CAV LNCS 1254, pp. 456–459, 1997.
38. [LPZ85] O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In Logics of Programs, LNCS 193, pp. 196–218, Brooklyn, June 1985.
39. [LS98] D. Lugiez and Ph. Schnoebelen. The regular viewpoint on PA-processes. In Proc. 9th CONCUR, LNCS 1466, pp. 50–66, September 1998.
40. [MS85] D.E. Muller and P.E. Schupp. The theory of ends, pushdown automata, and secondorder logic. Theoretical Computer Science, 37:51–75, 1985.
41. [MS87] D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267–276, 1987.
42. [PR89] A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th POPL, pp. 179–190, January 1989.
43. [QS81] J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming, LNCS 137, pp. 337–351, 1981.
44. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1–35, 1969.
45. M.Y. Vardi. Reasoning about the past with two-way automata. In Proc. 25th ICALP, LNCS 1443, pp. 628–641, July 1998.
46. [VB99] W. Visser and H. Barringer. CTL? model checking for SPIN. In Software Tools for Technology Transfer, LNCS, 1999.
47. [VW86] M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st LICS, pp. 332–344, June 1986.
48. [VW94] M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1–37, November 1994.
49. I. Walukiewicz. On completeness of µ-calculus. In Proc. 8th CAV, volume 1102 of LNCS, pp. 62–74, 1996.
50. T. Wilke. CTL+ is exponentially more succinct than CTL. In Proc. 19th Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1738, pp. 110–121, 1999.
51. [WVS83] P. Wolper, M.Y. Vardi, and A.P. Sistla. Reasoning about infinite computation paths. In Proc. 24th FOCS, pp. 185–194, 1983.
52. [WW96] B. Willems and P. Wolper. Partial-order methods for model checking: From linear time to branching time. In Proc. 11th Symp LICS, pp. 294–303, July 1996.