113 citations · 260 across the 57 of their papers we have counts for
3 papers · 1 filter
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…
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 the Complexity of the Equivalence Problem for Probabilistic Automata
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine +2
Checking two probabilistic automata for equivalence has been shown to be a key problem for efficiently establishing various behavioural and anonymity properties of probabilistic sy…