8 citations · 8 across the 1 of their papers we have counts for
2 papers
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…
cs.LO2007
The Complexity of Model Checking Higher-Order Fixpoint Logic
Roland Axelsson, Martin Lange, Rafal Somla
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal λ-calculus. This makes it a highly expressive temporal logic that is capable of expressin…