Widest paths and global propagation in bounded value iteration for stochastic games
Solving stochastic games with the reachability objective is a fundamental problem,
especially in quantitative verification and synthesis. For this purpose, bounded value …
especially in quantitative verification and synthesis. For this purpose, bounded value …
Leveraging the Power of Graph Algorithms: Efficient Algorithms for Computer-Aided Verification
A Svozil - arxiv preprint arxiv:2202.02660, 2022 - arxiv.org
The goal of the thesis is to leverage fast graph algorithms and modern algorithmic
techniques for problems in model checking and synthesis on graphs, MDPs, and game …
techniques for problems in model checking and synthesis on graphs, MDPs, and game …
Algorithms and conditional lower bounds for planning problems
We consider planning problems for graphs, Markov Decision Processes (MDPs), and games
on graphs in an explicit state space. While graphs represent the most basic planning model …
on graphs in an explicit state space. While graphs represent the most basic planning model …
Symbolic time and space tradeoffs for probabilistic verification
We present a faster symbolic algorithm for the following central problem in probabilistic
verification: Compute the maximal end-component (MEC) decomposition of Markov decision …
verification: Compute the maximal end-component (MEC) decomposition of Markov decision …
Fine-Grained Complexity Lower Bounds for Problems in Computer Aided Verification
M Henzinger - Principles of Systems Design: Essays Dedicated to …, 2022 - Springer
This article presents two fine-grained complexity lower bounds with relevance to algorithmic
problems in computer aided verification. We have chosen these lower bounds as the proofs …
problems in computer aided verification. We have chosen these lower bounds as the proofs …
[BOG][B] Computer Aided Verification: 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21–24, 2020, Proceedings, Part II
The open access two-volume set LNCS 12224 and 12225 constitutes the refereed
proceedings of the 32st International Conference on Computer Aided Verification, CAV …
proceedings of the 32st International Conference on Computer Aided Verification, CAV …
Cheap CTL Compassion in NuSMV
D Hausmann, T Litak, C Rauch, M Zinner - International Conference on …, 2020 - Springer
We discuss expansions of CTL with connectives able to express Streett fairness objectives
for single paths. We focus on (E) SFCTL:(Extended) Streett-Fair CTL inspired by a seminal …
for single paths. We focus on (E) SFCTL:(Extended) Streett-Fair CTL inspired by a seminal …
[PDF][PDF] INTERLEAVE: An Empirically Faster Symbolic Algorithm for Maximal End Component Decomposition of MDPs
R Singh - 2024 - suguman.github.io
The model checking problem takes as input a model and a specification, and outputs
whether the model satisfies the specification. Probabilistic model checking deals with input …
whether the model satisfies the specification. Probabilistic model checking deals with input …
Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs
MP Gutenberg - arxiv preprint arxiv:2011.13702, 2020 - arxiv.org
In this thesis, we present new techniques to deal with fundamental algorithmic graph
problems where graphs are directed and partially dynamic, ie undergo either a sequence of …
problems where graphs are directed and partially dynamic, ie undergo either a sequence of …
Check for updates
CTL Cheap, D Hausmann, T Litak… - … Model Checking, and …, 2020 - books.google.com
We discuss expansions of CTL with connectives able to express Streett fairness objectives
for single paths. We focus on (E) SFCTL:(Extended) Streett-Fair CTL inspired by a seminal …
for single paths. We focus on (E) SFCTL:(Extended) Streett-Fair CTL inspired by a seminal …