×

Found 5 Documents (Results 1–5)

On the power of unambiguity in Büchi complementation. (English) Zbl 07455748

Raskin, Jean-Francois (ed.) et al., Proceedings of the 11th international symposium on games, automata, logics, and formal verification, GandALF 2020, Brussels, Belgium, September 21–22, 2020. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 326, 182-198 (2020).
MSC:  68Q45 68Q60 91A80
PDFBibTeX XMLCite
Full Text: arXiv Link

Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games. (English) Zbl 1484.68141

Bouajjani, Ahmed (ed.) et al., Verification, model checking, and abstract interpretation. 18th international conference, VMCAI 2017, Paris, France, January 15–17, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10145, 266-287 (2017).
MSC:  68Q85 91A43
PDFBibTeX XMLCite
Full Text: DOI arXiv

A simple algorithm for solving qualitative probabilistic parity games. (English) Zbl 1411.68068

Chaudhuri, Swarat (ed.) et al., Computer aided verification. 28th international conference, CAV 2016, Toronto, ON, Canada, July 17–23, 2016. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 9780, 291-311 (2016).
MSC:  68Q60 68W40 91A43
PDFBibTeX XMLCite
Full Text: DOI

Efficient approximation of optimal control for continuous-time Markov games. (English) Zbl 1246.68165

Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12–14, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPIcs – Leibniz International Proceedings in Informatics 13, 399-410, electronic only (2011).
MSC:  68Q87 91A15 68Q60
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

Year of Publication

all top 3

Main Field

all top 3

Software