The model checking fingerprints of CTL operators

Krebs, Andreas; Meier, Arne; Mundhenk, Martin

doi:10.1007/s00236-018-0326-9

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2024

Publication Types

Select...

Article1

Book1

Other1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work of Schnoebelen (2002) considers the classical model checking question for temporal logics. There is a study on the complexity of fragments of the model checking problem (Krebs, Meier, and Mundhenk 2019) for CTL, but it has no direct impact on our results as the problems are situated in P (or classes within).…”

Section: Introductionmentioning

confidence: 99%

Submodel Enumeration for CTL Is Hard

Fröhlich,

Meier

2024

AAAI

View full text Add to dashboard Cite

Expressing system specifications using Computation Tree Logic (CTL) formulas, formalising programs using Kripke structures, and then model checking the system is an established workflow in program verification and has wide applications in AI. In this paper, we consider the task of model enumeration, which asks for a uniform stream of output systems that satisfy the given specification. We show that, given a CTL formula and a system (potentially falsified by the formula), enumerating satisfying submodels is always hard for CTL--regardless of which subset of CTL-operators is considered. As a silver lining on the horizon, we present fragments via restrictions on the allowed Boolean functions that still allow for fast enumeration.

show abstract

Section: Introductionmentioning

confidence: 99%