Symbolic Time and Space Tradeoffs for Probabilistic Verification

@article{Chatterjee2021SymbolicTA,
  title={Symbolic Time and Space Tradeoffs for Probabilistic Verification},
  author={Krishnendu Chatterjee and Wolfgang Dvor{\'a}k and Monika Henzinger and Alexander Svozil},
  journal={2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
  year={2021},
  pages={1-13}
}
  • K. Chatterjee, W. Dvorák, A. Svozil
  • Published 15 April 2021
  • Computer Science, Mathematics
  • 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs). This problem generalizes the SCC decomposition problem of graphs and closed recurrent sets of Markov chains. The model of symbolic algorithms is widely used in formal verification and model-checking, where access to the input model is restricted to only symbolic operations (e.g., basic set operations… 

Figures from this paper

References

SHOWING 1-10 OF 41 REFERENCES

Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives

This work presents the first subquadratic symbolic algorithm to compute the almost-sure winning set for MDPs with Büchi objectives, and improves the algorithm for symbolic scc computation; the previous known algorithm takes linear symbolic steps, and the new algorithm improves the constants associated with the linear number of steps.

Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives

This work presents the first sub-quadratic symbolic algorithm for graphs with Streett objectives, and it is shown that it improves the existing approach on several academic benchmark examples.

Symbolic Graphs: Linear Solutions to Connectivity Related Problems

A symbolic algorithmic strategy, based on the new notion of spine-set, that is general enough to be the engine of linear symbolic step algorithms for both strongly connected components and biconnected components is devised.

Symbolic Model Checking: 10^20 States and Beyond

Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter

Lower bounds on the number of symbolic operations are given for basic graph problems such as the computation of the strongly connected components and of the approximate diameter as well as for fundamental problems in model checking such as safety, liveness, and co-liveness.

Improved Set-based Symbolic Algorithms for Parity Games

This work presents two set-based symbolic algorithms for parity games that requires at most a sub-exponential number of symbolic operations and develops an algorithm that requires $O(n^{c/3+1})$ symbolic Operations and only linear space.

Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition

The first to break the Õ(n · m) boundary by presenting a new technique that reduces the running time to O(n2), and presents two improved static algorithms for the maximal end-component decomposition problem, which are the first dynamic algorithms for this problem.

Formal verification of probabilistic systems

This dissertation presents methods for the formal modeling and specification of probabilistic systems, and algorithms for the automated verification of these systems, which rely on the theory of Markov decision processes and exploit a connection between the graph-theoretical and Probabilistic properties of these processes.

Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification

Fast and dynamic algorithms for the maximal end-component decomposition of Markov decision processes (MDPs) and of the almost sure winning set for reachability and parity objectives in MDPs are presented.