Modal Transition Systems: Composition and LTL Model Checking

Author(s):  
Nikola Beneš ◽  
Ivana Černá ◽  
Jan Křetínský
2013 ◽  
Vol 39 (8) ◽  
pp. 1069-1089 ◽  
Author(s):  
Andreas Classen ◽  
Maxime Cordy ◽  
Pierre-Yves Schobbens ◽  
Patrick Heymans ◽  
Axel Legay ◽  
...  

2021 ◽  
Vol 178 (1-2) ◽  
pp. 1-30
Author(s):  
Florian Bruse ◽  
Martin Lange ◽  
Etienne Lozes

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.


2015 ◽  
Vol 14 (4) ◽  
pp. 1-30 ◽  
Author(s):  
Ferenc Bujtor ◽  
Walter Vogler

2011 ◽  
Vol 76 (2) ◽  
pp. 136-157 ◽  
Author(s):  
S. Edelkamp ◽  
D. Sulewski ◽  
J. Barnat ◽  
L. Brim ◽  
P. Šimeček

Sign in / Sign up

Export Citation Format

Share Document