Branching-time logics with path relativisation

Markus Latte, Martin Lange

Abstract: Highlights•We relativise path quantifier in branching-time logics using ω-languages.•The extended logics are based on CTL, CTL+, CTL⁎, and ΔPDL.•We study expressivity and complexity of satisfiability and model checking.•Path relativisation captures abstractions and refinements of large systems.•Logics with non-regular relativisations may be useful for software synthesis.