×

Found 2 Documents (Results 1–2)

Reachability for branching concurrent stochastic games. (English) Zbl 07561608

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 115, 14 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. (English) Zbl 1394.60084

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-47665-9/pbk; 978-3-662-47666-6/ebook). Lecture Notes in Computer Science 9135, 184-196 (2015).
MSC:  60J80
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Year of Publication

Main Field