113 citations · 317 across the 70 of their papers we have counts for
7 papers · 1 filter
Effective Divergence Analysis for Linear Recurrence Sequences
Shaull Almagor, Brynmor Chapman, Mehran Hosseini +2
We study the growth behaviour of rational linear recurrence sequences. We show that for low-order sequences, divergence is decidable in polynomial time. We also exhibit a polynomia…
When is Containment Decidable for Probabilistic Automata?
Laure Daviaud, Marcin Jurdziński, Ranko Lazić +3
The emptiness and containment problems for probabilistic automata are natural quantitative generalisations of the classical language emptiness and inclusion problems for Boolean au…
On the Expressiveness and Monitoring of Metric Temporal Logic
Hsi-Ming Ho, Joël Ouaknine, James Worrell
It is known that Metric Temporal Logic (MTL) is strictly less expressive than the Monadic First-Order Logic of Order and Metric (FO[<, +1]) when interpreted over timed words; this…
Costs and Rewards in Priced Timed Automata
Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan +1
We consider Pareto analysis of reachable states of multi-priced timed automata (MPTA): timed automata equipped with multiple observers that keep track of costs (to be minimised) an…
O-Minimal Invariants for Discrete-Time Dynamical Systems
Shaull Almagor, Dmitry Chistikov, Joël Ouaknine +1
Termination analysis of linear loops plays a key rôle in several areas of computer science, including program verification and abstract interpretation. Already for the simplest var…
On the Decidability of Reachability in Linear Time-Invariant Systems
Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly +2
We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable contr…