Joël Ouaknine

activity

20072026

most citedOn the decidability and complexity of Metric Temporal Logic over finite words

113 citations · 260 across the 57 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

cs.CC2016★ 2 cited

The Polytope-Collision Problem

Shaull Almagor, Joël Ouaknine, James Worrell

The Orbit Problem consists of determining, given a matrix $A \in R^{d \times d}$ and vectors $x, y \in R^{d}$ , whether there exists $n \in N$ such that $A^{n} = y$ .…

cs.LO2016★ 3 cited

Model Checking Flat Freeze LTL on One-Counter Automata

Antonia Lechner, Richard Mayr, Joël Ouaknine +2

Freeze LTL is a temporal logic with registers that is suitable for specifying properties of data words. In this paper we study the model checking problem for Freeze LTL on one-coun…

cs.DM2016★ 1 cited

Solvability of Matrix-Exponential Equations

Joël Ouaknine, Amaury Pouly, João Sousa-Pinto +1

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k + 1$ square matrices $A_{1}, \dots, A_{k}, C$ , all…