Compositional Abstraction Techniques for Probabilistic Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Compositional Abstraction Techniques for Probabilistic Automata


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.
Fichier principal
Vignette du fichier
978-3-642-33475-7_23_Chapter.pdf (360.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01556222 , version 1 (04-07-2017)





Falak Sher, Joost-Pieter Katoen. Compositional Abstraction Techniques for Probabilistic Automata. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.325-341, ⟨10.1007/978-3-642-33475-7_23⟩. ⟨hal-01556222⟩
45 View
36 Download



Gmail Facebook X LinkedIn More