The following pages link to Joël Ouaknine (Q436422):
Displaying 50 items.
- (Q3601861) (← links)
- Nets with Tokens Which Carry Data (Q3612940) (← links)
- (Q4417860) (← links)
- (Q4418006) (← links)
- (Q4457839) (← links)
- (Q4472226) (← links)
- (Q4598241) (← links)
- (Q4598245) (← links)
- (Q4608681) (← links)
- (Q4611376) (← links)
- On the Complexity of Linear Arithmetic with Divisibility (Q4635845) (← links)
- On Recurrent Reachability for Continuous Linear Dynamical Systems (Q4635910) (← links)
- Solvability of Matrix-Exponential Equations (Q4635944) (← links)
- Semialgebraic invariant synthesis for the Kannan-Lipton orbit problem (Q4636627) (← links)
- Decision Problems for Linear Recurrence Sequences (Q4899140) (← links)
- On the Relationship between Reachability Problems in Timed and Counter Automata (Q4899143) (← links)
- On Termination for Faulty Channel Machines (Q4910713) (← links)
- On the Complexity of Equivalence and Minimisation for Q-weighted Automata (Q4913771) (← links)
- O-Minimal Invariants for Discrete-Time Dynamical Systems (Q5002799) (← links)
- (Q5009460) (← links)
- (Q5089224) (← links)
- (Q5089280) (← links)
- (Q5089299) (← links)
- (Q5090452) (← links)
- On Reachability Problems for Low-Dimensional Matrix Semigroups (Q5091195) (← links)
- (Q5092319) (← links)
- Sequential Relational Decomposition (Q5094122) (← links)
- (Q5111354) (← links)
- Polynomial Invariants for Affine Programs (Q5145329) (← links)
- Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points (Q5166676) (← links)
- On the Complexity of Temporal-Logic Path Checking (Q5167829) (← links)
- On the Positivity Problem for Simple Linear Recurrence Sequences, (Q5167848) (← links)
- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences (Q5167849) (← links)
- On the Decidability of Membership in Matrix-exponential Semigroups (Q5215447) (← links)
- Timed Temporal Logics (Q5217304) (← links)
- On the decidability of reachability in linear time-invariant systems (Q5239222) (← links)
- Expressive Completeness for Metric Temporal Logic (Q5271072) (← links)
- On the Polytope Escape Problem for Continuous Linear Dynamical Systems (Q5275313) (← links)
- Zeno, Hercules, and the Hydra (Q5277917) (← links)
- Foundations of Software Science and Computation Structures (Q5308464) (← links)
- On the decidability and complexity of Metric Temporal Logic over finite words (Q5310684) (← links)
- Computer Aided Verification (Q5312909) (← links)
- The Polyhedron-Hitting Problem (Q5362998) (← links)
- On Termination of Integer Linear Loops (Q5363097) (← links)
- (Q5376664) (← links)
- Positivity Problems for Low-Order Linear Recurrence Sequences (Q5383986) (← links)
- Foundations for Decision Problems in Separation Logic with General Inductive Predicates (Q5410687) (← links)
- State/Event Software Verification for Branching-Time Specifications (Q5429308) (← links)
- The orbit problem in higher dimensions (Q5495866) (← links)
- Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems (Q5696927) (← links)
