113 citations · 317 across the 70 of their papers we have counts for
Showing 2012 · cs.LOShow all
2 papers · 2 filters
cs.LO2012★ 2 cited
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…
cs.LO2012★ 3 cited
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…