The Complexity of Model-Checking the Tail-Recursive Fragment of Higher-Order Modal Fixpoint Logic - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Fundamenta Informaticae Année : 2021

The Complexity of Model-Checking the Tail-Recursive Fragment of Higher-Order Modal Fixpoint Logic

Résumé

Higher-Order Fixpoint Logic (HFL) is a modal specification language whose expressive power reaches far beyond that of Monadic Second-Order Logic, achieved through an incorporation of a typed λ-calculus into the modal µ-calculus. Its model checking problem on finite transition systems is decidable, albeit of high complexity, namely k-EXPTIME-complete for formulas that use functions of type order at most k > 0. In this paper we present a fragment with a presumably easier model checking problem. We show that so-called tail-recursive formulas of type order k can be model checked in (k − 1)-EXPSPACE, and also give matching lower bounds. This yields generic results for the complexity of bisimulation-invariant non-regular properties, as these can typically be defined in HFL.
Fichier principal
Vignette du fichier
main.pdf (339.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03180788 , version 1 (25-03-2021)

Identifiants

Citer

Florian Bruse, Martin Lange, Etienne Lozes. The Complexity of Model-Checking the Tail-Recursive Fragment of Higher-Order Modal Fixpoint Logic. Fundamenta Informaticae, 2021, ⟨10.3233/FI-2016-0000⟩. ⟨hal-03180788⟩
48 Consultations
33 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More