5 results
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 […]
Published on August 13, 2019
Krishnendu Chatterjee ; Luca de Alfaro ; Rupak Majumdar ; Vishwanath Raman.
Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in the quantitative {\mu}-calculus and related […]
Published on September 1, 2010
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 […]
Published on May 4, 2009
Krishnendu Chatterjee ; Laurent Doyen ; Thomas A Henzinger.
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages~$L$ that assign to each word~$w$ a real number~$L(w)$. In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, […]
Published on August 30, 2010
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 […]
Published on December 14, 2011