The structure of the paper is as follows: In Section 2 we summarize basics of the logics LTL, CTL and CTL∗ as well as concurrent game models and the alternating ...

We develop optimal decision procedures for satisfiability in these fragments, showing that they have much lower complexities than the full languages. In ...

The structure of the paper is as follows: In Section 2 we summarize basics of the logics LTL, CTL and CTL∗ as well as concurrent game models and the alternating ...

College Publications. Goranko, Valentin ; Vester, Steen. / Optimal decision procedures for satisfiability in fragments of alternating-time temporal logics.

Dec 31, 2013 · Optimal Decision Procedures for Satisfiability in Fragments of Alternating-time Temporal Logics. Download PDF · Valentin Goranko, Steen Vester.

It follows that ATL is decidable in exponential time, which is also the optimal complexity: satisfiability in CTL, a fragment of ATL, is EXPTIME-complete.

We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the ...

Title: Optimal Decision Procedures for Satisfiability in Fragments of Alternating-time Temporal Logics · Authors: Valentin Goranko, Steen Vester · Venue: Advances ...

PDF | We develop a sound, complete, and practically implementable tableau-based decision method for constructive satisfiability testing and model.

We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the ...