Cargando…
Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints
This paper introduces Farkas certificates for lower and upper bounds on minimal and maximal reachability probabilities in Markov decision processes (MDP), which we derive using an MDP-variant of Farkas’ Lemma. The set of all such certificates is shown to form a polytope whose points correspond to wi...
Autores principales: | Funke, Florian, Jantsch, Simon, Baier, Christel |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7439734/ http://dx.doi.org/10.1007/978-3-030-45190-5_18 |
Ejemplares similares
-
Verified Certification of Reachability Checking for Timed Automata
por: Wimmer, Simon, et al.
Publicado: (2020) -
Signal reachability facilitates characterization of probabilistic signaling networks
por: Gabr, Haitham, et al.
Publicado: (2015) -
Electron Witness Constraints for AWAKE
por: Farmer, John P, et al.
Publicado: (2021) -
AVR: Abstractly Verifying Reachability
por: Goel, Aman, et al.
Publicado: (2020) -
Timed Automata Relaxation for Reachability
por: Bendík, Jaroslav, et al.
Publicado: (2021)