113 citations · 317 across the 70 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.LO2017★ 4 cited
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
Vojtěch Forejt, Petr Jančar, Stefan Kiefer +1
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branchin…
cs.LO2017
Revisiting Reachability in Timed Automata
Karin Quaas, Mahsa Shirmohammadi, James Worrell
We revisit a fundamental result in real-time verification, namely that the binary reachability relation between configurations of a given timed automaton is definable in linear ari…
cs.CC2017
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine +2
The \emph{Orbit Problem} consists of determining, given a linear transformation on , together with vectors and , whether the orbit of under repeated ap…