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

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.

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.

scholarly journals Model Checking Coloured Petri Nets - Exploiting Strongly Connected Components

1997 ◽  
Vol 26 (519) ◽  
Author(s):  
Allan Cheng ◽  
Søren Christensen ◽  
Kjeld Høyer Mortensen
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
The State ◽  
Connected Components ◽  
Coloured Petri Nets ◽  
Transition Systems ◽  
Strongly Connected Components ◽  
State Spaces ◽  
Labelled Transition Systems ◽  
Strongly Connected

In this paper we present a CTL-like logic which is interpreted over the state spaces of Coloured Petri Nets. The logic has been designed to express properties of both state and transition information. This is possible because the state spaces are labelled transition systems. We compare the expressiveness of our logic with CTL's. Then, we present a model checking algorithm which for efficiency reasons utilises strongly connected components and formula reduction rules. We present empirical results for non-trivial examples and compare the performance of our algorithm with that of Clarke, Emerson, and Sistla.

scholarly journals Analyzing Phylogenetic Trees with Timed and Probabilistic Model Checking: The Lactose Persistence Case Study

2014 ◽  
Vol 11 (3) ◽  
pp. 17-31 ◽  
Author(s):  
José Ignacio Requeno ◽  
José Manuel Colom
Keyword(s):  
Phylogenetic Analysis ◽  
Model Checking ◽  
Temporal Logic ◽  
Probabilistic Model ◽  
Phylogenetic Trees ◽  
Lactose Intolerance ◽  
Probabilistic Model Checking ◽  
Transition Systems

Summary Model checking is a generic verification technique that allows the phylogeneticist to focus on models and specifications instead of on implementation issues. Phylogenetic trees are considered as transition systems over which we interrogate phylogenetic questions written as formulas of temporal logic. Nonetheless, standard logics become insufficient for certain practices of phylogenetic analysis since they do not allow the inclusion of explicit time and probabilities. The aim of this paper is to extend the application of model checking techniques beyond qualitative phylogenetic properties and adapt the existing logical extensions and tools to the field of phylogeny. The introduction of time and probabilities in phylogenetic specifications is motivated by the study of a real example: the analysis of the ratio of lactose intolerance in some populations and the date of appearance of this phenotype.

Sign in / Sign up

Export Citation Format

Share Document