Model checking linear properties of prefix-recognizable systems

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

Volumn 2404, Issue , 2002, Pages 371-385

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

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER AIDED ANALYSIS; DISTRIBUTED COMPUTER SYSTEMS; FORESTRY; SPECIFICATIONS;

AMOUNT OF INFORMATION; AUTOMATA-THEORETIC APPROACH; LINEAR PROPERTIES; LTL MODEL-CHECKING; MODEL CHECKING PROBLEM; NONDETERMINISTIC PATH; OPTIMAL ALGORITHM; SEQUENTIAL SYSTEMS;

MODEL CHECKING;

ALGORITHMS; CLASSIFICATION; PROBLEM SOLVING; ROBOTS;

EID: 84937555009     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_31     Document Type: Conference Paper

References (39)

1. O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification on infinite structures. Unpublished manuscript, 2000.
2. O. Burkart and J. Esparza. More infinite results. Electronic Notes in TCS, 6, 1996.
3. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In 8th Concur, LNCS 1243, 135-150, 1997.
4. P. Biesse, T. Leonard, and A. Mokkedem. Finding bugs in an alpha microprocessors using satisfiability solvers. In 13th CAV, LNCS 2102, 454-464, 2001.
5. O. Burkart and Y.-M. Quemener. Model checking of infinite graphs defined by graph grammers. In 1st Infinity, ENTCS 6, 1996.
6. O. Burkart and B. Steffen. Model checking for context-free processes. In 3rd Concur, LNCS 630, 123-137, 1992.
7. O. Burkart and B. Steffen. Composition, decomposition and model checking of pushdown processes. Nordic J. Comut., 2:89-125, 1995.
8. O. Burkart and B. Steffen. Model checking the full modal μ-calculus for infinite sequential processes. Theoretical Computer Science, 221:251-270, 1999.
9. O. Burkart. Automatic verification of sequential infinite-state processes. LNCS 1354.
10. O. Burkart. Model checking rationally restricted right closures of recognizable graphs. In 2nd Infinity, 1997.
11. D. Caucal. On infinite transition graphs having a decidable monadic theory. In 23rd ICALP, LNCS 1099, 194-205, 1996.
12. F. Copty, L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Y. Vardi. Benefits of bounded model checking at an industrial setting. In 13th CAV, LNCS 2102, 436-453, 2001.
13. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999
14. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. J. of ACM, 28(1):114-133, January 1981.
15. M. Dam. CTL* and ECTL* as fragments of the modal μ-calculus. TCS, 126:77-96.
16. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In 12th CAV, LNCS 1855, 232-247, 2000.
17. E. A. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In Proc. 32nd FOCS, 368-377, October 1991.
18. J. Esparza, A. Kucera, and S. Schwoon. Model-checking LTL with regular valuations for pushdown systems. In 4th STACS, LNCS 2215, 316-339, 2001.
19. E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional ^-calculus. In 1st LICS, 267-278, 1986.
20. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown automata. In 2nd Infinity, 1997.
21. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. A user guide to HYTECH. In TACAS, LNCS 1019, 41-71, 1995.
22. O. Kupferman and A. Pnueli. Once and for all. In 10th LICS, 25-35, 1995.
23. R. P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
24. O. Kupferman and M. Y. Vardi. An automata-theoretic approach to reasoning about infinite-state systems. In 12th CAV, LNCS 1855, 36-52
25. O. Kupferman and M. Y. Vardi. On clopen specifications. In 8th LPAR, LNCS 2250, 24-38, 2001.
26. O. Kupferman and M. Y. Vardi. Weak alternating automata are not that weak. ACM Trans. on Computational Logic, 2001(2):408-429, July 2001.
27. O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, March 2000.
28. K. G. Larsen, P. Petterson, and W. Yi. UPPAAL: Status & developments. In 9th CAV, LNCS 1254, 456-459, 1997.
29. N. Lynch. Log space recognition and translation of parenthesis languages. Journal ACM, 24:583-590, 1977.
30. D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata, and second-order logic. TCS, 37:51-75, 1985.
31. N. Piterman. Extending temporal logic with w-automata. M.Sc. Thesis, The Weizmann Institute of Science, Israel, 2000. http://www.wisdom,weizmann.ac.il/home/nirp/public_html/publications/msc_thesis.ps.
32. A. Pnueli. The temporal logic of programs. In 18th FOCS, 46-57, 1977.
33. N. Piterman and M. Vardi. From bidirectionality to alternation. In 26th MFCS, LNCS 2136, 598-609, 2001.
34. N. Piterman and M. Vardi. From bidirectionality to alternation. TCS, 2001 to appear.
35. M. Y. Vardi. Reasoning about the past with two-way automata. In 25th ICALP, LNCS 1443, 628-641, 1998.
36. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.
37. I. Walukiewicz. Pushdown processes: games and modal logic. In 8th CAV, LNCS 1102, 62-74, 1996.
38. I. Walukiewicz. Model checking ctl properties of pushdown systems. In 20th FSTTCS, LNCS 1974, 127-138, 2000.
39. P. Wolper, M. Y. Vardi, and A. P. Sistla. Reasoning about infinite computation paths. In 24th FOCS, 185-194, 1983.