The model checking fingerprints of CTL operators

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autoren

Externe Organisationen

  • Eberhard Karls Universität Tübingen
  • Friedrich-Schiller-Universität Jena
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)487-519
Seitenumfang33
FachzeitschriftActa informatica
Jahrgang56
Ausgabenummer6
Frühes Online-Datum1 Aug. 2018
PublikationsstatusVeröffentlicht - 1 Sept. 2019

Abstract

The aim of this study is to understand the inherent expressive power of CTL operators. We investigate the complexity of model checking for all CTL fragments with one CTL operator and arbitrary Boolean operators. This gives us a fingerprint of each CTL operator. The comparison between the fingerprints yields a hierarchy of the operators that mirrors their strength with respect to model checking.

ASJC Scopus Sachgebiete

Zitieren

The model checking fingerprints of CTL operators. / Krebs, Andreas; Meier, Arne; Mundhenk, Martin.
in: Acta informatica, Jahrgang 56, Nr. 6, 01.09.2019, S. 487-519.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Krebs A, Meier A, Mundhenk M. The model checking fingerprints of CTL operators. Acta informatica. 2019 Sep 1;56(6):487-519. Epub 2018 Aug 1. doi: 10.48550/arXiv.1504.04708, 10.1007/s00236-018-0326-9
Krebs, Andreas ; Meier, Arne ; Mundhenk, Martin. / The model checking fingerprints of CTL operators. in: Acta informatica. 2019 ; Jahrgang 56, Nr. 6. S. 487-519.
Download
@article{55bd196635544b32a0e9f143e114538e,
title = "The model checking fingerprints of CTL operators",
abstract = "The aim of this study is to understand the inherent expressive power of CTL operators. We investigate the complexity of model checking for all CTL fragments with one CTL operator and arbitrary Boolean operators. This gives us a fingerprint of each CTL operator. The comparison between the fingerprints yields a hierarchy of the operators that mirrors their strength with respect to model checking.",
author = "Andreas Krebs and Arne Meier and Martin Mundhenk",
note = "Acknowledgements: The authors thank Stephan Fischer for helpful discussions on the proof of Lemma 4 and Martin Krejka for a simplification of the proof of Lemma 14. The authors also thank the referees for many valuable comments.",
year = "2019",
month = sep,
day = "1",
doi = "10.48550/arXiv.1504.04708",
language = "English",
volume = "56",
pages = "487--519",
journal = "Acta informatica",
issn = "0001-5903",
publisher = "Springer New York",
number = "6",

}

Download

TY - JOUR

T1 - The model checking fingerprints of CTL operators

AU - Krebs, Andreas

AU - Meier, Arne

AU - Mundhenk, Martin

N1 - Acknowledgements: The authors thank Stephan Fischer for helpful discussions on the proof of Lemma 4 and Martin Krejka for a simplification of the proof of Lemma 14. The authors also thank the referees for many valuable comments.

PY - 2019/9/1

Y1 - 2019/9/1

N2 - The aim of this study is to understand the inherent expressive power of CTL operators. We investigate the complexity of model checking for all CTL fragments with one CTL operator and arbitrary Boolean operators. This gives us a fingerprint of each CTL operator. The comparison between the fingerprints yields a hierarchy of the operators that mirrors their strength with respect to model checking.

AB - The aim of this study is to understand the inherent expressive power of CTL operators. We investigate the complexity of model checking for all CTL fragments with one CTL operator and arbitrary Boolean operators. This gives us a fingerprint of each CTL operator. The comparison between the fingerprints yields a hierarchy of the operators that mirrors their strength with respect to model checking.

UR - http://www.scopus.com/inward/record.url?scp=85051242304&partnerID=8YFLogxK

U2 - 10.48550/arXiv.1504.04708

DO - 10.48550/arXiv.1504.04708

M3 - Article

AN - SCOPUS:85051242304

VL - 56

SP - 487

EP - 519

JO - Acta informatica

JF - Acta informatica

SN - 0001-5903

IS - 6

ER -

Von denselben Autoren