scientific article; zbMATH DE number 2038753

zbMath1039.68073MaRDI QIDQ4449218

Jan Johannsen, Martin Lange

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190767.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17) Temporal logic (03B44)

Related Items

Optimal Tableau Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-Time Temporal Logic ATL ⁺ ⋮ Branching Time? Pruning Time! ⋮ To be fair, use bundles ⋮ Branching-time logics with path relativisation ⋮ A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL ⋮ \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) ⋮ Temporal logics with language parameters ⋮ On the Complexity of Branching-Time Logics