An analysis of stochastic shortest path problems
Mathematics of Operations Research
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Communication and Concurrency
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Formal verification of probabilistic systems
Formal verification of probabilistic systems
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Observing Branching Structure through Probabilistic Contexts
SIAM Journal on Computing
Compositional Abstraction for Stochastic Systems
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
A game-based abstraction-refinement framework for Markov decision processes
Formal Methods in System Design
Abstract probabilistic automata
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
New Results on Abstract Probabilistic Automata
ACSD '11 Proceedings of the 2011 Eleventh International Conference on Application of Concurrency to System Design
Layered reasoning for randomized distributed algorithms
Formal Aspects of Computing - Celebrating the 60th Birthday of Carroll Morgan
Refinement and difference for probabilistic automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
We present aggressive abstraction techniques for probabilistic automata (PA), a state-based model involving discrete probabilistic and nondeterministic branching. Our abstractions yield abstract PA in which transitions are typed "possible" or "required"--as in modal transition systems--and have constraint functions as target. The key idea is to focus on identifying common combined-transitions from concrete states and putting them as required ones in the abstract state. We prove the correctness of our abstraction techniques, study their relationship, and show that they are compositional w.r.t. parallel composition. We also show the preservation of probabilistic and expected reachability properties for PA.