Out of control: reducing probabilistic models by control-state elimination

DOI10.1007/978-3-030-94583-1_22zbMath1498.68176arXiv2011.00983OpenAlexW3106835381MaRDI QIDQ2152665

Tobias Winkler, Johannes Lehmann, Joost-Pieter Katoen

Publication date: 8 July 2022

Full work available at URL: https://arxiv.org/abs/2011.00983

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Uses Software

• PRISM
• MoDeST
• PASS
• PDDL
• Storm
• PROPhESY
• Jani
• PAYNT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A game-based abstraction-refinement framework for Markov decision processes
• Model-checking large structured Markov chains.
• Dynamic partitioning in linear relation analysis: application to the verification of reactive systems
• Polynomial analysis algorithms for free choice probabilistic workflow nets
• Parameter synthesis for Markov models: faster than ever
• \textsf{PrIC3}: property directed reachability for MDPs
• SMT-Based Bisimulation Minimisation of Markov Models
• Simple O(m logn) Time Markov Chain Lumping
• Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking
• Best Probabilistic Transformers
• Abstraction, Refinement and Proof for Probabilistic Systems
• Theoretical Aspects of Computing - ICTAC 2004
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking

This page was built for publication: Out of control: reducing probabilistic models by control-state elimination