Solving counter parity games
作者： Dietmar Berwanger , Łukasz Kaiser , Simon Leßenich
DOI: 10.1007/978-3-642-32589-2_17
关键词:
摘要: We study a class of parity games equipped with counters that evolve according to arbitrary non-negative affine functions. These games capture several cost models for dynamic …
springer.com
core.ac.uk
sci-hub.st 参考文章(20)
Benjamin Aminof, Orna Kupferman, Robby Lampert, Formal analysis of online algorithms automated technology for verification and analysis. pp. 213- 227 ,(2011) , 10.1007/978-3-642-24372-1_16
Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn, The Complexity of Request-Response Games Language and Automata Theory and Applications. pp. 227- 237 ,(2011) , 10.1007/978-3-642-21254-3_17
Wolfgang Thomas, Infinite Games and Verification computer aided verification. pp. 58- 65 ,(2002) , 10.1007/3-540-45657-0_5
Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, On the Maximal Number of Cubic Runs in a String Language and Automata Theory and Applications. ,vol. 6031, pp. 227- 238 ,(2010) , 10.1007/978-3-642-13089-2_19
Diana Fischer, Łukasz Kaiser, Model checking the quantitative µ-calculus on linear hybrid systems international colloquium on automata languages and programming. pp. 404- 415 ,(2011) , 10.1007/978-3-642-22012-8_32
Wolfgang Thomas, Infinite Games and Verification (Extended Abstract of a Tutorial) computer aided verification. pp. 58- 64 ,(2002)
Matthew Hennessy, Robin Milner, On Observing Nondeterminism and Concurrency international colloquium on automata, languages and programming. pp. 299- 309 ,(1980) , 10.1007/3-540-10003-2_79
Florian Horn, Wolfgang Thomas, Nico Wallmeier, Optimal Strategy Synthesis in Request-Response Games automated technology for verification and analysis. pp. 361- 373 ,(2008) , 10.1007/978-3-540-88387-6_31
Martin Zimmermann, Optimal Bounds in Parametric LTL Games Electronic Proceedings in Theoretical Computer Science. ,vol. 54, pp. 146- 161 ,(2011) , 10.4204/EPTCS.54.11
Diana Fischer, Erich Grädel, Łukasz Kaiser, Model Checking Games for the Quantitative μ -Calculus symposium on theoretical aspects of computer science. ,vol. 47, pp. 696- 719 ,(2010) , 10.1007/S00224-009-9201-Y