$$\hbox {CTL}^{\star }$$ family-based model checking using variability abstractions and modal transition systems

2019 ◽  
Vol 22 (1) ◽  
pp. 35-55 ◽  
Author(s):  
Aleksandar S. Dimovski
Keyword(s):  
Model Checking ◽  
Transition Systems ◽  
Modal Transition Systems ◽  
Family Based ◽  
Variability Abstractions

scholarly journals Static analysis and family-based model checking of featured transition systems with VMC

2021 ◽  
Author(s):  
Maurice H. ter Beek ◽  
Franco Mazzanti ◽  
Ferruccio Damiani ◽  
Luca Paolini ◽  
Giordano Scarso ◽  
...  
Keyword(s):  
Model Checking ◽  
Static Analysis ◽  
Transition Systems ◽  
Family Based

Efficient family-based model checking via variability abstractions

2016 ◽  
Vol 19 (5) ◽  
pp. 585-603 ◽  
Author(s):  
Aleksandar S. Dimovski ◽  
Ahmad Salim Al-Sibahi ◽  
Claus Brabrand ◽  
Andrzej Wąsowski
Keyword(s):  
Model Checking ◽  
Family Based ◽  
Variability Abstractions

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

2021 ◽  
Vol 178 (1-2) ◽  
pp. 1-30
Author(s):  
Florian Bruse ◽  
Martin Lange ◽  
Etienne Lozes
Keyword(s):  
Model Checking ◽  
Lower Bounds ◽  
Expressive Power ◽  
Higher Order ◽  
Order Logic ◽  
High Complexity ◽  
Transition Systems ◽  
Recursive Formulas ◽  
Second Order Logic ◽  
Monadic Second Order Logic

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.

Failure Semantics for Modal Transition Systems

2015 ◽  
Vol 14 (4) ◽  
pp. 1-30 ◽  
Author(s):  
Ferenc Bujtor ◽  
Walter Vogler
Keyword(s):  
Transition Systems ◽  
Modal Transition Systems
Sign in / Sign up

Export Citation Format

Share Document