Computation paths logic: An expressive, yet elementary, process logic

Annals of Pure and Applied Logic

Volumn 96, Issue 1-3, 1999, Pages 167-186

  Harel, David ^a   Singerman, Eli ^a,b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b SRI INTERNATIONAL   (United States)

Author keywords

Computation paths; Dynamic logic; Process logic; Temporal logic

Indexed keywords

EID: 0033095784     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(98)00038-4     Document Type: Article

References (18)

1. R. Danecki, Nondeterministic prepositional dynamic logic with intersection is decidable, 5th Symp. on Fundamentals of Computation Theory, Lecture Notes in Computer Science, vol. 208, Springer, Berlin 1984, pp. 34-53.
2. E.A. Emerson, in: J. Van Leeuwen, (Ed.), Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, pp. 996-1072.
3. E.A. Emerson, C.S. Jutla, The complexity of tree automata and logics of programs, Proc. 29th IEEE Symp. Found. Comput. Sci., 1988, pp. 328-337.
4. M. Fürer, The complexity of the inequivalence problem for regular expressions with intersection, Proc. 7th Int. Colloq. on Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 85, Springer, Berlin, 1980, pp. 234-245.
5. M.J. Fischer, R.E. Ladner, Propositional dynamic logic of regular programs, J. Comput. Systems Sci. 18 (1979) 194-211.
6. D. Harel, D. Kozen, R. Parikh, Process logic: expressiveness, decidability, completeness, J. Comput. Systems Sci. 25 (1982) 144-170.
7. D. Harel, D. Peleg, Process logic with regular formulas, Theoret. Comput. Sci. 38 (1985) 307-322.
8. D. Harel, R. Sherman, Looping vs. repeating in dynamic logic, Inform. Control (1982) 175-192.
9. D. Harel, R. Sherman, Propositional dynamic logic of flowcharts, Inform. Control 64 (1985) 119-135.
10. J.Y. Halpern, Deterministic process logic is elementary, Proc. 23rd IEEE Found. Comput. Sci., 1982, pp. 204-216.
11. D. Kozen, R. Parikh, An elementary proof of the completeness of PDL, Theoret. Comput. Sci. 14(1) (1981) 113-118.
12. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, Springer, Berlin, vol. 92, 1980.
13. A.J. Mayer, L.J. Stockmeyer, The complexity of word problems - this time with interleaving, Inform. and Comp. 115(2) (1994) 293-311.
14. D. Peleg, Regular process logics, M.Sc. Thesis, Bar-Ilan Univ., Ramat Gan, Israel, 1982 (in Hebrew).
15. A. Pnueli, The temporal logic of programs, Proc. 18th IEEE Symp. Found. Comput. Sci., 1977, pp. 46-57.
16. V.R. Pratt, Semantical considerations on Floyd-Hoare Logic, Proc. 17th IEEE Symp. Found. Comput. Sci., 1976, pp.109-121.
17. R. Sherman, A. Pnueli, D. Harel, Is the interesting part of process logic uninteresting?: a translation from PL to PDL, SIAM J. Comput. 13 (1984) 825-839.
18. M. Vardi, P. Wolper, Yet another prcess logic, Proc. Symp. on Logics of Programs, Lecture Notes in Computer Science, vol. 164, Springer, Berlin, 1983, pp. 501-512.