Petri net model checking with LoLA 2
K Wolf - Application and Theory of Petri Nets and Concurrency …, 2018 - Springer
LoLA 2 offers a suite of algorithms for verifying place/transition Petri nets. It combines
structural with state space methods and general purpose with Petri net-specific techniques …
structural with state space methods and general purpose with Petri net-specific techniques …
Simplification of CTL formulae for efficient model checking of Petri nets
F Bønneland, J Dyhr, PG Jensen, M Johannsen… - Application and Theory …, 2018 - Springer
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 reductions and …
of Petri nets. Classical state space pruning approaches like partial order reductions and …
Dependency graphs with applications to verification
S Enevoldsen, KG Larsen, A Mariegaard… - International Journal on …, 2020 - Springer
Dependency graphs, as introduced more than 20 years ago by Liu and Smolka, are oriented
graphs with hyperedges that connect nodes with sets of target nodes in order to represent …
graphs with hyperedges that connect nodes with sets of target nodes in order to represent …
Abstract dependency graphs and their application to model checking
S Enevoldsen, K Guldstrand Larsen, J Srba - … TACAS 2019, Held as Part of …, 2019 - Springer
Dependency graphs, invented by Liu and Smolka in 1998, are oriented graphs with
hyperedges that represent dependencies among the values of the vertices. Numerous …
hyperedges that represent dependencies among the values of the vertices. Numerous …
Extended abstract dependency graphs
Dependency graphs, invented by Liu and Smolka in 1998, are oriented graphs with
hyperedges that represent dependencies among the values of the vertices. Numerous …
hyperedges that represent dependencies among the values of the vertices. Numerous …
A distributed fixed-point algorithm for extended dependency graphs
AE Dalsgaard, S Enevoldsen, P Fogh… - Fundamenta …, 2018 - content.iospress.com
Equivalence and model checking problems can be encoded into computing fixed points on
dependency graphs. Dependency graphs represent causal dependencies among the nodes …
dependency graphs. Dependency graphs represent causal dependencies among the nodes …
[HTML][HTML] Parallel parameter synthesis algorithm for hybrid CTL
Parametrised models of dynamical systems arise in various areas of science. In this work,
we focus on models described as parametrised Kripke structures with properties formulated …
we focus on models described as parametrised Kripke structures with properties formulated …
Symbolic dependency graphs for model-checking
A Mariegaard, KG Larsen - … Conference on Formal Modeling and Analysis …, 2017 - Springer
We consider the problem of model-checking a subset of probabilistic CTL, interpreted over
(discrete-time) Markov reward models, allowing the specification of lower bounds on the …
(discrete-time) Markov reward models, allowing the specification of lower bounds on the …
CGAAL: Distributed On-The-Fly ATL Model Checker with Heuristics
FBØ Carlsen, LBP Frydenskov, NØ Jensen… - arXiv preprint arXiv …, 2023 - arxiv.org
We present CGAAL, our efficient on-the-fly model checker for alternating-time temporal logic
(ATL) on concurrent game structures (CGS). We present how our tool encodes ATL as …
(ATL) on concurrent game structures (CGS). We present how our tool encodes ATL as …
[HTML][HTML] Model checking and synthesis for branching multi-weighted logics
We investigate the open synthesis problem in a quantitative game theoretic setting where
the system model is annotated with multiple nonnegative weights representing quantitative …
the system model is annotated with multiple nonnegative weights representing quantitative …