Program schemata vs. automata for decidability of program logics

Theoretical Computer Science

Volumn 175, Issue 1, 1997, Pages 15-27

  Shilov, N V ^a  

^a A P ERSHOV INSTITUTE OF INFORMATICS SYSTEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DIFFERENTIATION (CALCULUS); LOGIC PROGRAMMING;

PROGRAM SCHEME TECHNIQUE (PST); SECOND ORDER PROPOSITIONAL DYNAMIC LOGIC (SO PDL);

FORMAL LOGIC;

EID: 0031096027     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00168-5     Document Type: Article

References (17)

1. S.A. Berezin and N.V. Shilov, An approach to effective model-checking of real-time finite-state machines in mu-calculus, Internat. Symp. on Logical Foundation of Computer Science LFCS'94, Lecture Notes in Computer Science, Vol. 813 (Springer, Berlin, 1994) 47-55.
2. G. Bhat and R. Cleaveland, Efficient local model-checking for fragments of the modal-μ-calculus, 2nd Internat. Workshop TACAS'96, Lecture Notes in Computer Science, Vol. 1055 (Springer, Berlin, 1996) 107-126.
3. 20 states and beyond. Inform. and Comput. 98 (1992) 142-170.
4. R. Cleaveland, M. Klain and B. Steffen, Faster model checking for the modal mu-calculus, Internat. Conf. on Computer-Aided Verification CAV'92, Lecture Notes in Computer Science, Vol. 663 (Springer, Berlin, 1993) 410-422.
5. E.A. Emerson, C.S. Jutla and A.P. Sistla, On model-checking for fragments of mu-calculus, Internat. Conf. on Computer-Aided Verification CAV'93, Lecture Notes in Computer Science, Vol. 698 (Springer, Berlin, 1993) 385-396.
6. M.J. Fisher and R.E. Ladner, Propositional dynamic logic of regular programs, J. Comput. System Sci. 18 (1979) 194-211.
7. S.A. Greibach, Theory of Program Structures: Schemes, Semantics, Verification, Lecture Notes in Computer Science, Vol. 36 (Springer, Berlin, 1975).
8. D. Harel, Dynamic logic, in: Handbook of Philosophical Logic, Vol. 2 (Reidel, Dordrecht, 1984).
9. Y. Kosten and A. Pnueli, A complete proof system for QPTL (an extended abstract), IEEE proc. LICS'95 (1995) 2-12.
10. D. Kozen, Results on the propositional mu-calculus, Theoret. Comput. Sci. 27 (1983) 333-354.
11. V.A. Nepomniaschy and N.V. Shilov, Non-deterministic program schemata and their relation to dynamic logic, Internat. Conf. on Math. Logic and its Applications (Plenum Press, New York, 1986).
12. V.R. Pratt, A decidable mu-calculus: preliminary report, 22nd IEEE Symp. on Foundation of Computer Science (1982) 421-427.
13. M.O. Rabin, Decidability of second order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969) 1-35.
14. N.V. Shilov, Proving halting in first-order dynamic logic, in: Vichislitelnie systemi, Novosibirsk, Institute of Mathematics, Vol. 124 (1988) 72-83.
15. A.P. Sistla, M.Y. Vardy and P. Wolper, The complementation problem for Buchi automata with application to temporal logic, Theoret. Comput. Sci. 49 (1987) 217-237.
16. R.S. Streett and E.A. Emerson, An automata theoretic decision procedure for the propositional mu-calculus, Inform. and Comput. 81 (1989) 249-264.
17. I. Walukiewicz, A complete deduction system for the μ-calculus. Doctoral Thesis, Warsaw, 1993.