8 citations · 15 across the 3 of their papers we have counts for
3 papers
cs.LO2013★ 7 cited
Satisfiability Games for Branching-Time Logics
Oliver Friedmann, Martin Lange, Markus Latte
The satisfiability problem for branching-time temporal logics like CTL*, CTL and CTL+ has important applications in program specification and verification. Their computational comp…
cs.LO2011
Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages
Markus Latte
For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows programs to be in a language of L rather than just to be regular. If L contains a…
cs.LO2010★ 8 cited
Extended Computation Tree Logic
Roland Axelsson, Matthew Hague, Stephan Kreutzer +2
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may…