scholarly journals Abstract Family-Based Model Checking Using Modal Featured Transition Systems: Preservation of CTL$$^{\star }$$⋆

2018 ◽  
pp. 301-318 ◽  
Author(s):  
Aleksandar S. Dimovski
Keyword(s):  
Model Checking ◽  
Transition Systems ◽  
Family Based

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

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.

Family-Based Model Checking Without a Family-Based Model Checker

2015 ◽  
pp. 282-299 ◽  
Author(s):  
Aleksandar S. Dimovski ◽  
Ahmad Salim Al-Sibahi ◽  
Claus Brabrand ◽  
Andrzej Wąsowski
Keyword(s):  
Model Checking ◽  
Model Checker ◽  
Family Based

scholarly journals A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking

2010 ◽  
pp. 83-98 ◽  
Author(s):  
Lasse Jacobsen ◽  
Morten Jacobsen ◽  
Mikael H. Møller ◽  
Jiří Srba
Keyword(s):  
Model Checking ◽  
Transition Systems

scholarly journals Partitioned PLTL model-checking for refined transition systems

2009 ◽  
Vol 207 (6) ◽  
pp. 681-698
Author(s):  
J. Julliand ◽  
P.-A. Masson ◽  
E. Oudot
Keyword(s):  
Model Checking ◽  
Transition Systems

ACTION MACHINES: A FRAMEWORK FOR ENCODING AND COMPOSING PARTIAL BEHAVIORS

2006 ◽  
Vol 16 (05) ◽  
pp. 705-726 ◽  
Author(s):  
WOLFGANG GRIESKAMP ◽  
NICOLAS KICILLOF ◽  
NIKOLAI TILLMANN
Keyword(s):  
Model Checking ◽  
Composition Operators ◽  
Parallel Composition ◽  
Full Data ◽  
Transition Systems ◽  
Main Application ◽  
Model Based ◽  
Software Models ◽  
Model Based Testing ◽  
Testing Technology

We describe action machines, a framework for encoding and composing partial behavioral descriptions. Action machines encode behavior as a variation of labeled transition systems where the labels are observable activities of the described artifact and the states capture full data models. Labels may also have structure, and both labels and states may be partial with a symbolic representation of the unknown parts. Action machines may stem from software models or programs, and can be composed in a variety of ways to synthesize new behaviors. The composition operators described here include synchronized and interleaving parallel composition, sequential composition, and alternating simulation. We use action machines in analysis processes such as model checking and model-based testing. The current main application is in the area of model-based conformance testing, where our approach addresses practical problems users at Microsoft have in applying model-based testing technology.

Sign in / Sign up

Export Citation Format

Share Document