Filters
Local Distributed Model Checking of RegCTL
of CTL with regular expressions. RegCTL can be model-checked on-the-fly and themodel checking algorithm is well distributable.The paper is devoted to the problem of extending the temporal logic CTL so. Th...
JC - Počítačový hardware a software
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
Model Checking of RegCTL
the validity is required. We propose a local distributed model checking algorithm for RegCTL and exactly state the complexity of model checking RegCTL formulas.The paper is devoted to the problem of extending the ...
IN - Informatika
- 2006 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Parameter Synthesis by Parallel Coloured CTL Model Checking
We propose a new distributed-memory parallel algorithm for parameter synthesis from CTL hypotheses. The algorithm colours the state space transitions by different parameterisations and extends CTL model checking to...
IN - Informatika
- 2015 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Simplification of CTL Formulae for Efficient Model Checking of Petri Nets
We study techniques to overcome the state space explosion problem in CTL model checking of Petri nets. Classical state space pruning approaches like partial order the Model Checking Contest 2017. of the
Computer and information sciences
- 2018 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Using Assumptions to Distribute CTL Model Checking
In this work we discuss the problem of performing distributed CTL model checking by splitting the given state space into several ``partial state spaces''. The partial state space is modelled as a Kripke structure w...
JC - Počítačový hardware a software
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
Assumption-based distribution of CTL model checking
In this paper we discuss the problem of performing distributed CTL model checking by splitting the given state space into several ldquopartial state spaces. The partial state space is modelled as a Kripke structure...
IN - Informatika
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Local Model Checking of Weighted CTL with Upper-Bound Constraints
We present a symbolic extension of dependency graphs by Liu and Smolka in order to model-check weighted Kripke structures against the logic CTL with upper-bound weight to the direct encoding of the model checki...
IN - Informatika
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Efficient Model Checking of Weighted CTL with Upper-Bound Constraints
We present a symbolic extension of dependency graphs by Liuand Smolka in order to model-check weighted Kripke structures againstthe logic CTL with upper-bound weight constraints. Our extension introducesa new type of edges ...
IN - Informatika
- 2016 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Parallel Model Checking and the FMICS-jETI Platform
In this paper we summarize parallel algorithms for enumerative model checking-calculus which naturally subsumes the branching time logic CTL (computation tree logic). We also indicate how to provide parallel model ...
IN - Informatika
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation
, and demonstrate the efficiency of our general approach on the benchmark of Petri net models and CTL queries from the Model Checking Contest 2016.Equivalence and model checking problems can be en...
Computer and information sciences
- 2017 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 174 569