3 citations · 7 across the 4 of their papers we have counts for
5 papers
Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts +3
In this paper, we study thetime-bounded reachability problem for rectangular hybrid automata with non-negative rates (RHA+). This problem was recently shown to be decidable [Brihay…
Bisimilarity of Probabilistic Pushdown Automata
Vojtech Forejt, Petr Jancar, 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…
Expressive Completeness of Metric Temporal Logic
Paul Hunter, Joël Ouaknine, James Worrell
Metric Temporal Logic (MTL) is a generalisation of Linear Temporal Logic in which the Until and Since modalities are annotated with intervals that express metric constraints. A sem…
On Reachability for Hybrid Automata over Bounded Time
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts +3
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locati…
On Stabilization in Herman's Algorithm
Stefan Kiefer, Andrzej Murawski, Joël Ouaknine +2
Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics of…