Name
Abstract | ||
|---|---|---|
Computation Tree Logic (CTL) and its extensions CTL* and CTL+ are widely used in automated verification as a basis for common model checking tools. But while they can express many properties of interest like reachability, even simple regular properties like "Every other index is labelled a cannot be expressed in these logics. While many extensions were developed to include regular or even non-regular (e.g. visibly pushdown) languages, the first generic framework, Extended CTL, for CTL with arbitrary language classes was given by Axelsson et. al. and applied to regular, visibly pushdown and (deterministic) context-free languages. We extend this framework to CTL* and CTL+ and analyse it with regard to decidability, complexity, expressivity and satisfiability. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-68195-1_14 | LATA |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gutsfeld Jens Oliver | 1 | 1 | 0.69 |
| Müller-Olm Markus | 2 | 0 | 0.34 |
| Dielitz Christian | 3 | 0 | 0.34 |