Search

• < Previous
• 1
• Next >

---

Timed Parity Games: Complexity and Robustness

Krishnendu Chatterjee ; Thomas A. Henzinger ; Vinayak S. Prabhu.

We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are \emph{concurrent} in that at each turn, both players independently propose a time delay and an action, and the action with the shorter&nbsp;[&hellip;]

---

Qualitative Logics and Equivalences for Probabilistic Systems

Krishnendu Chatterjee ; Luca de Alfaro ; Marco Faella ; Axel Legay.

We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized CTL (QRCTL): formulas of this logic can express the fact that certain temporal properties hold over all paths, or with probability 0 or 1, but&nbsp;[&hellip;]

---

Markov Decision Processes with Multiple Long-run Average Objectives

Tomáš Brázdil ; Václav Brožek ; Krishnendu Chatterjee ; Vojtěch Forejt ; Antonín Kučera.

We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with k limit-average functions, in the expectation objective the goal is to maximize the expected&nbsp;[&hellip;]

---

Quantitative Automata under Probabilistic Semantics

Krishnendu Chatterjee ; Thomas A. Henzinger ; Jan Otop.

Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions, we establish that automata with monitor&nbsp;[&hellip;]

---