Person:436422: Difference between revisions

From MaRDI portal
Person:436422
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Joël Ouaknine to Joël Ouaknine: Duplicate
 
(No difference)

Latest revision as of 21:27, 11 December 2023

Available identifiers

zbMath Open ouaknine.joel-oWikidataQ80637103 ScholiaQ80637103MaRDI QIDQ436422

List of research outcomes

PublicationDate of PublicationType
On the 𝑝-adic zeros of the Tribonacci sequence2024-02-28Paper
https://portal.mardi4nfdi.de/entity/Q61342722023-08-21Paper
What's decidable about discrete linear dynamical systems?2023-08-10Paper
https://portal.mardi4nfdi.de/entity/Q61684102023-08-08Paper
https://portal.mardi4nfdi.de/entity/Q61684472023-08-08Paper
https://portal.mardi4nfdi.de/entity/Q61684482023-08-08Paper
https://portal.mardi4nfdi.de/entity/Q61684852023-08-08Paper
https://portal.mardi4nfdi.de/entity/Q58743242023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58753642023-02-03Paper
Reachability in Injective Piecewise Affine Maps2023-01-23Paper
Algebraic model checking for discrete linear dynamical systems2023-01-18Paper
Sequential Relational Decomposition2022-08-02Paper
On Reachability Problems for Low-Dimensional Matrix Semigroups2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50923192022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50892242022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50892802022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50892992022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50904522022-07-18Paper
Skolem Meets Schanuel2022-04-28Paper
On the transcendence of a series related to Sturmian words2022-04-18Paper
Porous invariants2022-03-25Paper
O-Minimal Invariants for Discrete-Time Dynamical Systems2022-02-24Paper
First-order orbit queries2021-08-05Paper
https://portal.mardi4nfdi.de/entity/Q50094602021-08-04Paper
O-Minimal Invariants for Discrete-Time Dynamical Systems2021-07-28Paper
Sequential Relational Decomposition2021-01-20Paper
Polynomial Invariants for Affine Programs2021-01-20Paper
On the Skolem Problem and Prime Powers2020-06-12Paper
https://portal.mardi4nfdi.de/entity/Q51113542020-05-27Paper
Timed Temporal Logics2020-02-24Paper
On the Decidability of Membership in Matrix-exponential Semigroups2020-02-11Paper
How Fast Can You Escape a Compact Polytope?2020-01-14Paper
On the decidability of reachability in linear time-invariant systems2019-10-22Paper
Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem2019-08-27Paper
Cyclic-routing of unmanned aerial vehicles2019-06-25Paper
Positivity Problems for Low-Order Linear Recurrence Sequences2019-06-20Paper
https://portal.mardi4nfdi.de/entity/Q53766642019-05-17Paper
Algebraic Invariants for Linear Hybrid Automata2019-02-27Paper
https://portal.mardi4nfdi.de/entity/Q46113762019-01-18Paper
Convex language semantics for nondeterministic probabilistic automata2018-11-23Paper
On the Complexity of the Orbit Problem2018-08-02Paper
Model Checking Real-Time Systems2018-07-20Paper
On the Complexity of Linear Arithmetic with Divisibility2018-04-23Paper
On Recurrent Reachability for Continuous Linear Dynamical Systems2018-04-23Paper
Solvability of Matrix-Exponential Equations2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46366272018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46086812018-03-21Paper
On the Decidability of Reachability in Linear Time-Invariant Systems2018-02-19Paper
https://portal.mardi4nfdi.de/entity/Q45982412017-12-19Paper
https://portal.mardi4nfdi.de/entity/Q45982452017-12-19Paper
The Polyhedron-Hitting Problem2017-10-05Paper
On Termination of Integer Linear Loops2017-10-05Paper
Zeno, Hercules, and the Hydra2017-07-12Paper
On the Polytope Escape Problem for Continuous Linear Dynamical Systems2017-07-11Paper
Expressive Completeness for Metric Temporal Logic2017-07-03Paper
On the Magnitude of Completeness Thresholds in Bounded Model Checking2017-05-16Paper
On parametric timed automata and one-counter machines2017-03-16Paper
Relating Reachability Problems in Timed and Counter Automata2017-03-16Paper
https://portal.mardi4nfdi.de/entity/Q29550062017-01-24Paper
The Cyclic-Routing UAV Problem is PSPACE-Complete2015-10-01Paper
Reachability problems for Markov chains2014-12-09Paper
Advances in Parametric Real-Time Reasoning2014-10-14Paper
The orbit problem in higher dimensions2014-08-07Paper
Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points2014-07-08Paper
On the Complexity of Temporal-Logic Path Checking2014-07-01Paper
On the Positivity Problem for Simple Linear Recurrence Sequences,2014-07-01Paper
Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences2014-07-01Paper
Algorithmic probabilistic game semantics. Playing games with automata2014-06-30Paper
Foundations for Decision Problems in Separation Logic with General Inductive Predicates2014-04-16Paper
https://portal.mardi4nfdi.de/entity/Q28523652013-10-08Paper
https://portal.mardi4nfdi.de/entity/Q28520812013-10-07Paper
A Static Analysis Framework for Livelock Freedom in CSP2013-09-26Paper
Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian2013-09-20Paper
https://portal.mardi4nfdi.de/entity/Q28474032013-09-09Paper
https://portal.mardi4nfdi.de/entity/Q28454992013-08-30Paper
Timed CSP = Closed Timed Automata12013-08-15Paper
On the Complexity of Equivalence and Minimisation for Q-weighted Automata2013-04-09Paper
On termination and invariance for faulty channel machines2013-03-22Paper
Three tokens in Herman's algorithm2013-03-22Paper
On Termination for Faulty Channel Machines2013-03-19Paper
Decision Problems for Linear Recurrence Sequences2013-01-07Paper
On the Relationship between Reachability Problems in Timed and Counter Automata2013-01-07Paper
https://portal.mardi4nfdi.de/entity/Q29156912012-09-18Paper
https://portal.mardi4nfdi.de/entity/Q29088602012-08-29Paper
SAT-solving in CSP trace refinement2012-07-20Paper
Branching-Time Model Checking of Parametric One-Counter Automata2012-06-22Paper
On the Complexity of the Equivalence Problem for Probabilistic Automata2012-06-22Paper
On Searching for Small Kochen-Specker Vector Systems2011-12-16Paper
Tractable Reasoning in a Fragment of Separation Logic2011-09-02Paper
Static Livelock Analysis in CSP2011-09-02Paper
Linear Completeness Thresholds for Bounded Model Checking2011-08-19Paper
On Reachability for Hybrid Automata over Bounded Time2011-07-07Paper
On Stabilization in Herman’s Algorithm2011-07-07Paper
On Process-Algebraic Extensions of Metric Temporal Logic2010-10-26Paper
Towards a Theory of Time-Bounded Verification2010-09-07Paper
Model Checking Succinct and Parametric One-Counter Automata2010-09-07Paper
Reachability in Succinct and Parametric One-Counter Automata2009-10-22Paper
Time-Bounded Verification2009-10-22Paper
Verification, Model Checking, and Abstract Interpretation2009-05-15Paper
Integrated Formal Methods2009-05-07Paper
Nets with Tokens Which Carry Data2009-03-11Paper
https://portal.mardi4nfdi.de/entity/Q36018612009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36014112009-02-10Paper
Some Recent Results in Metric Temporal Logic2008-12-02Paper
On Expressiveness and Complexity in Real-Time Model Checking2008-08-19Paper
Undecidability of Universality for Timed Automata with Minimal Resources2008-07-03Paper
Zone-Based Universality Analysis for Single-Clock Timed Automata2008-07-01Paper
State/Event Software Verification for Branching-Time Specifications2007-11-29Paper
On the decidability and complexity of Metric Temporal Logic over finite words2007-10-11Paper
Foundations of Software Science and Computation Structures2007-09-28Paper
Deciding Bit-Vector Arithmetic with Abstraction2007-09-03Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-05-02Paper
Foundations of Software Science and Computation Structures2007-05-02Paper
CONCUR 2005 – Concurrency Theory2006-11-01Paper
Concurrent software verification with states, events, and deadlocks2006-10-25Paper
Automata, Languages and Programming2006-01-10Paper
Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems2005-10-19Paper
Computer Aided Verification2005-08-25Paper
Domain theory, testing and simulation for labelled Markov processes2005-04-06Paper
Efficient verification of sequential and concurrent C programs2004-11-22Paper
https://portal.mardi4nfdi.de/entity/Q44722262004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44578392004-03-17Paper
https://portal.mardi4nfdi.de/entity/Q44178602003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44180062003-07-30Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Joël Ouaknine