Rajeev Alur & Parthasarathy Madhusudan (2004):
Visibly pushdown languages.
In: Proc. 36th Ann. ACM Symp. on Theory of Computing, STOC'04,
pp. 202–211,
doi:10.1145/1007352.1007390.
Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange & Markus Latte (2010):
Extended Computation Tree Logic.
In: Christian Fermüller & Andrei Voronkov: Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2010, Yogyakarta, Indonesia),
Lecture Notes in Computer Science 6397.
Springer,
pp. 67–81,
doi:10.1007/978-3-642-16242-8_6.
Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange & Markus Latte (2010):
Extended Computation Tree Logic.
arXiv.org.
Available at http://arxiv.org/abs/1006.3709.
Franz Baader & Tobias Nipkow (1998):
Term Rewriting and All That.
Cambridge University Press.
Francine Berman & Michael Paterson (1981):
Propositional dynamic logic is weaker without tests.
Theoretical Computer Science 16(3),
pp. 321–328,
doi:10.1016/0304-3975(81)90102-X.
Mikołaj Bojańczyk (2008):
The common fragment of ACTLand LTL.
In: Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures,
FOSSACS'08/ETAPS'08.
Springer-Verlag,
Berlin, Heidelberg,
pp. 172–185,
doi:10.1007/978-3-540-78499-9_13.
E. Allen Emerson & Joseph Y. Halpern (1985):
Decision Procedures and Expressiveness in the Temporal Logic of Branching Time.
Journal of Computer and System Sciences 30,
pp. 1–24,
doi:10.1016/0022-0000(85)90001-7.
E. Allen Emerson & Joseph Y. Halpern (1986):
``Sometimes'' and ``Not Never'' Revisited: On Branching versus Linear Time Temporal Logic.
Journal of the ACM 33,
pp. 151–178,
doi:10.1145/4904.4999.
Michael J. Fischer & Richard E. Ladner (1979):
Propositional Dynamic Logic of Regular Programs.
Journal of Computer and System Sciences 18(2),
pp. 194–211.
Seymour Ginsburg & Sheila Greibach (1966):
Deterministic Context Free Languages.
Information and Control 9(6),
pp. 620–648,
doi:10.1016/S0019-9958(66)80019-0.
David Harel (1984):
Dynamic Logic.
In: Dov M. Gabbay & F. Guenthner: Handbook of Philosophical Logic, Vol. II: Extensions of Classical Logic, chapter 10.
D. Reidel Publishing Company,
Dordrecht, Holland,
pp. 497–604.
David Harel, Dexter Kozen & Jerzy Tiuryn (2000):
Dynamic Logic.
Foundations of Computing.
MIT Press,
Cambridge, Massachusetts.
David Harel, Amir Pnueli & Jonathan Stavi (1983):
Propositional Dynamic Logic of Nonregular Programs.
Journal of Computer and System Sciences 26(2),
pp. 222–243.
David Harel & Danny Raz (1990):
Deciding properties of nonregular programs.
Foundations of Computer Science, Annual IEEE Symposium on,
pp. 652–661.
John E. Hopcroft & Jeffrey D. Ullman (1979):
Introduction to Automata Theory, Languages and Computation.
Addison Wesley.
Dexter Kozen & Jerzy Tiuryn (1990):
Logics of Programs.
In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B).
Elsevier and MIT Press,
pp. 789–840.
Christof Löding, Carsten Lutz & Olivier Serre (2007):
Propositional dynamic logic with recursive programs.
J. Log. Algebr. Program. 73(1-2),
pp. 51–69,
doi:10.1016/j.jlap.2006.11.003.
Christof Löding, Parthasarathy Madhusudan & Olivier Serre (2004):
Visibly Pushdown Games.
In: Proc. 24th Int. Conf. on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'04,
LNCS 3328.
Springer,
pp. 408–420,
doi:10.1007/978-3-540-30538-5_34.
Michael O. Rabin (1970):
Weakly definable relations and special automata.
In: Yehoshua Bar-Hillel: Mathematical Logic and Foundations of Set Theory.
North-Holland,
Amsterdam,
pp. 1–23.
Ludwig Staiger (1997):
ω-lanugages.
In: Grzegorz Rozenberg & Arto Salomaa: Handbook of formal languages, chapter 6 3: beyond words.
Springer,
New York, NY, USA,
pp. 339–387.
Robert S. Streett (1982):
Propositional Dynamic Logic of Looping and Converse is Elementarily Decidable.
Information and Control 54(1-2),
pp. 121–141,
doi:10.1016/S0019-9958(82)91258-X.
Wolfgang Thomas (1990):
Automata On Infinite Objects.
In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B).
Elsevier and MIT Press,
pp. 133–191.
Moshe Y. Vardi & Pierre Wolper (1986):
Automata-Theoretic Techniques for Modal Logics of Programs.
Journal of Computer and System Sciences 32(2),
pp. 183–221,
doi:10.1016/0022-0000(86)90026-7.
eptcs@eptcs.org