Fast Symbolic Algorithms for Omega|Regular Games under Strong ...

Fixpoint Algorithms for Fair Parity/ Games - IRIF

Omega-regular games are a popular abstract modelling formalism for ... Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness.

A Flexible Toolchain for Symbolic Rabin Games under Fair and ...

Piterman and Pnueli [17] derived the currently best known symbolic algorithm for solving two-player Rabin games over finite graphs with a ...

Energy mu-Calculus: Symbolic Fixed-Point Algorithms for omega ...

The logic of modal μ-calculus, when applied over game graphs with ω-regular winning conditions, allows defining symbolic algorithms in the form ...

Concurrent Omega-Regular Games - Irisa

For example, the set of states from which player 1 cannot reach a goal no longer forms a proper subgame. Our algorithms are in- stead presented in symbolic form ...

A Direct Symbolic Algorithm for Solving Stochastic Rabin Games

Piterman, N., Pnueli, A.: Faster solutions of Rabin and Streett games. ... A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.

Symbolic Algorithms for Graphs and Markov Decision Processes ...

Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness ... We consider fixpoint algorithms for two-player games on ...

Symbolic Algorithms for Qualitative Analysis of Markov Decision ...

Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness · tamajit banerjee. ArXiv, 2022. We consider fixpoint algorithms for two ...

Improved Set-Based Symbolic Algorithms for Parity Games - CS

Graph games with ω-regular winning conditions provide a ... translate to a symbolic algorithm that is faster in practice for the respective domain.

A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with ...

Strong planning under partial observability. Artificial Intelligence. 170(4): ... Algorithms for omega-regular games with imperfect information. In CSL'06 ...

‪Tamajit Banerjee‬ - ‪Google Scholar‬

Fast symbolic algorithms for omega-regular games under strong transition fairness. T Banerjee, R Majumdar, K Mallik, AK Schmuck, S Soudjani. TheoretiCS 2, 2023.

Curriculum Vitae - Kaushik Mallik

“Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness”. In: TheoretiCS 2 (2023). [3] Rupak Majumdar, Kaushik ...

Symbolic Algorithms for Infinite-State Games* - Luca de Alfaro

We show how win- ning strategies can be synthesized symbolically over all class-2 game structures. (finite i-trace equivalence) for all ω-regular winning ...

Pushing the Barriers in Controller Synthesis for Cyber-Physical ...

Symbolic Algorithms for ω-Regular Games under Strong Transition Fairness 131 ... several other ω-regular fair adversarial games, which are significantly faster ...

Symbolic Solution of Emerson-Lei Games for Reactive Synthesis⋆

The symbolic treatment is enabled due to the simplicity of determinization in the case of safety languages and by using our new algorithm for game solving. This ...

A Survey of Stochastic ω-Regular Games - ISTA Research Explorer

The re- sulting concurrent stochastic games have long been familiar to game theorists and mathematicians, sometimes under the name of competitive Markov ...

Symbolic Fixpoint Algorithms for Logical LTL Games

In turn, logically-specified games offer a powerful way to model these tasks for large or infinite- state systems. Much of the techniques proposed for solving.

‪Kaushik Mallik‬ - ‪Google Scholar‬

2023. Fast symbolic algorithms for omega-regular games under strong transition fairness. T Banerjee, R Majumdar, K Mallik, AK Schmuck, S Soudjani. TheoretiCS 2 ...

Previous A&C Seminars - Algorithms & Complexity Group

Beyond combinatorial algorithms, I will also show how fast matrix multiplication can further speed ... Under strong (but reasonable) hardness assumptions, this ...

Solving Odd-Fair Parity Games - DROPS

Fast symbolic algorithms for omega-regular games under strong transition fairness. TheoretiCS, 2, 2023. 6. Calin Belta, Boyan Yordanov, and Ebru Aydin Gol ...

An Empirically Faster Symbolic Algorithm for MEC Decompositon of ...

Efficient and dynamic algorithms for alternating büchi games ... Learning-based mean-payoff optimization in an unknown mdp under omega-regular ...