Filters








21,185 Hits in 6.1 sec

Symbolic Algorithms for Infinite-State Games [chapter]

Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar
2001 Lecture Notes in Computer Science  
W e conclude by presenting symbolic algorithms for the synthesis of winning strategies (\controller synthesis") for in nite-state games with arbitrary !  ...  To c haracterize the termination of symbolic procedures for solving in nite-state games, we classify these game structures into four increasingly restrictive categories: 1.  ...  In this paper, we present symbolic semi-algorithms for solving two-player concurrent games on in nite state spaces, and for synthesizing the corresponding winning strategies.  ... 
doi:10.1007/3-540-44685-0_36 fatcat:67bq5vr2rfbdhah4mfdpukca74

Page 2064 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
We conclude by presenting symbolic algorithms for the synthesis of winning strate- gies (‘controller synthesis’) for infinite-state games with arbitrary j-regular objectives, and prove termination over  ...  We present symbolic procedures, and corresponding termination criteria, for the solution of infinite-state games, which occur in the control and modular verification of infinite-state systems.  ... 

Dominant Strategies of Quantum Games on Quantum Periodic Automata

Konstantinos Giannakis, Christos Papalitsas, Kalliopi Kastampolidou, Alexandros Singh, Theodore Andronikos
2015 Computation  
This paper associates dominant strategies of repeated quantum games with quantum automata that recognize infinite periodic inputs.  ...  ., circuit size) give rise to the need for novel mechanisms, such as quantum inspired computation.  ...  Every reading of a b symbol gets his win in stake since the automaton transits to state 2, which is the winning state for Player 2.  ... 
doi:10.3390/computation3040586 fatcat:tzeurbovd5bxrh7mee5aa62laa

Fast Synthesis for Symbolic Self-triggered Control under Right-recursive LTL Specifications [article]

Sasinee Pruekprasert, Clovis Eberhart, Jérémy Dubut
2021 arXiv   pre-print
We extend previous work on symbolic self-triggered control for non-deterministic continuous-time nonlinear systems without stability assumptions to a larger class of specifications.  ...  We translate the control problem to solving a mean-payoff parity game played on a discrete graph.  ...  For simplicity, we only describe the algorithm on a symbolic model with a single initial state q in .  ... 
arXiv:2103.16122v2 fatcat:2ugr76ntanakrdzjzt3xzodrqi

Symbolic BDD and ADD Algorithms for Energy Games

Shahar Maoz, Or Pistiner, Jan Oliver Ringert
2016 Electronic Proceedings in Theoretical Computer Science  
A symbolic algorithm for energy games, recently presented by Chatterjee et al., is symbolic in its representation of quantitative values but concrete in the representation of game states and transitions  ...  We have implemented our algorithm using two different symbolic representations for reactive games, Binary Decision Diagrams (BDD) and Algebraic Decision Diagrams (ADD).  ...  Acknowledgments We thank Yaron Velner for helpful introduction to and discussions about quantitative games.  ... 
doi:10.4204/eptcs.229.5 fatcat:7vybzlvmyzbchkv4u5shyt67a4

Algorithms for Omega-Regular Games with Imperfect Information

Jean-Francois Raskin, Krishnendu Chatterjee, Laurent Doyen, Thomas Henzinger, R. Ramanujam
2007 Logical Methods in Computer Science  
First, we give a fixed-point algorithm for computing the set of states from which a player can win with a deterministic observation-based strategy for any omega-regular objective.  ...  Second, we give an algorithm for computing the set of states from which a player can win with probability 1 with a randomized observation-based strategy for a Buechi objective.  ...  Let G be a game structure of imperfect information, let T be a set of observations, and let be a state of G.  ... 
doi:10.2168/lmcs-3(3:4)2007 fatcat:2jrqavqmfrgtlioielogi3iysq

Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications [chapter]

Nico Wallmeier, Patrick Hütten, Wolfgang Thomas
2003 Lecture Notes in Computer Science  
We present a method to solve certain infinite games over finite state spaces and apply this for the automatic synthesis of finitestate controllers.  ...  A lift-controller problem serves as an example for which the implementation of our algorithm has been tested.  ...  Acknowledgment We thank a referee for his remark that a lower bound for RR-games should be given (now provided in Theorem 2).  ... 
doi:10.1007/3-540-45089-0_3 fatcat:dqc7xyeqoja4fkw3g7yfmglh4u

Are Good-for-Games Automata Good for Probabilistic Model Checking? [chapter]

Joachim Klein, David Müller, Christel Baier, Sascha Klüppelholz
2014 Lecture Notes in Computer Science  
One of these notions is the goodfor-games property that has been introduced by Henzinger and Piterman together with an algorithm for generating good-for-games automata from nondeterministic Büchi automata  ...  Second, we show how good-for-games automata can be used for the quantitative analysis of systems modeled by Markov decision processes against ω-regular specifications and evaluate this new method by a  ...  As stated in [13], the HP-algorithm is thus not well-suited for an explicit representation for A, but is intended for a symbolic implementation.  ... 
doi:10.1007/978-3-319-04921-2_37 fatcat:ahxnyvpdhzb4pdq4d3dqyqkbai

An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games [chapter]

Luca de Alfaro, Marco Faella
2007 Lecture Notes in Computer Science  
Three-color parity games capture the disjunction of a Büchi and a co-Büchi condition. The most efficient known algorithm for these games is the progress measures algorithm by Jurdziński.  ...  Using the tool TICC as a platform, we compare the performance of a BDD-based symbolic implementation of the progress measure algorithm with acceleration, and of the symbolic implementation of the classical  ...  In the second part of this paper, we show how the acceleration technique for threecolor parity games can be applied to timed games, leading to efficient symbolic algorithms.  ... 
doi:10.1007/978-3-540-73368-3_13 fatcat:g5g6446p6ff77mdzktahw7vf4i

ACTL ∩ LTL Synthesis [chapter]

Rüdiger Ehlers
2012 Lecture Notes in Computer Science  
Such automata are structurally simple and thus amenable to optimizations as well as symbolic implementations.  ...  Key to this setting is a novel construction for translating properties from LTL to very-weak automata, whenever possible.  ...  Furthermore, the author wants to thank Armin Biere for pointing out the common fragment of ACTL and LTL as potentially interesting for synthesis.  ... 
doi:10.1007/978-3-642-31424-7_9 fatcat:gtfyw2edxvetzmrwmbxhrf7524

A Symbolic Approach to Safety LTL Synthesis [article]

Shufang Zhu, Lucas M. Tabajara, Jianwen Li, Geguang Pu, Moshe Y. Vardi
2020 arXiv   pre-print
efficient symbolic construction, allowing a BDD-based symbolic approach which significantly outperforms extant LTL-synthesis tools.  ...  We show here that Safety LTL synthesis is significantly simpler algorithmically than LTL synthesis.  ...  We base our symbolic approach on the algorithm from [9] for DFA (reachability) games, which are the duals of safety games.  ... 
arXiv:1709.07495v2 fatcat:pypf2xswdnd7zf3yvofpvhv3a4

A Symbolic Approach to Safety ltl Synthesis [chapter]

Shufang Zhu, Lucas M. Tabajara, Jianwen Li, Geguang Pu, Moshe Y. Vardi
2017 Lecture Notes in Computer Science  
efficient symbolic construction, allowing a BDD-based symbolic approach which significantly outperforms extant LTL-synthesis tools.  ...  We show here that Safety LTL synthesis is significantly simpler algorithmically than LTL synthesis.  ...  We base our symbolic approach on the algorithm from [9] for DFA (reachability) games, which are the duals of safety games.  ... 
doi:10.1007/978-3-319-70389-3_10 fatcat:5j2wyfe4lfdnvbgid4a42oyduu

Page 3357 of Mathematical Reviews Vol. , Issue 2001E [page]

2001 Mathematical Reviews  
The design and analysis of the algorithm is based on a notion of game progress measures: they are witnesses for winning strategies in parity games.  ...  Summary: “In this paper we develop a new algorithm for deciding the winner in parity games, and hence also for modal yv-calculus 68Q Theory of computing 2001¢:68120 model checking.  ... 

Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness [article]

Tamajit Banerjee, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, Sadegh Soudjani
2022 arXiv   pre-print
symbolic steps, improving the state of the art. Finally, we have implemented a BDD-based synthesis engine based on our algorithm.  ...  We get symbolic algorithms for (generalized) Rabin, parity and GR(1) objectives under strong transition fairness assumptions as well as a direct symbolic algorithm for qualitative winning in stochastic  ...  A symbolic fixpoint algorithm for Rabin games is given by .  ... 
arXiv:2202.07480v1 fatcat:h266kudisnhdvbc5qszpialwxy

A Comparison of BDD-Based Parity Game Solvers

Lisette Sanchez, Wieger Wesselink, Tim A.C. Willemse
2018 Electronic Proceedings in Theoretical Computer Science  
In this paper, we describe our experiments with BDD-based implementations of four parity game solving algorithms, viz.  ...  It is therefore important to identify algorithms that can efficiently deal with large games that arise from such applications.  ...  Symbolic algorithms studied for more restricted types of games include [1, 7] . Outline. In Section 2, we introduce parity games and the relevant concepts.  ... 
doi:10.4204/eptcs.277.8 fatcat:76qxzmcteffbrpxvapewuqgwty
« Previous Showing results 1 — 15 out of 21,185 results