J. Ouaknine

发表

Some Recent Results in Metric Temporal Logic

Joël Ouaknine, James Worrell, J. Ouaknine, 2008, FORMATS.

On the language inclusion problem for timed automata: closing a decidability gap

J. Ouaknine, J. Worrell, 2004, LICS 2004.

On the language inclusion problem for timed automata: closing a decidability gap

Joël Ouaknine, James Worrell, J. Ouaknine, 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

Deciding Bit-Vector Arithmetic with Abstraction

Joël Ouaknine, Daniel Kroening, Ofer Strichman, 2007, TACAS.

Automated, compositional and iterative deadlock detection

Joël Ouaknine, Sagar Chaki, Edmund M. Clarke, 2004, Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2004. MEMOCODE '04..

C C ] 1 0 Fe b 20 17 On the Polytope Escape Problem for Continuous Linear Dynamical Systems

J. Ouaknine, Joël Ouaknine, 2018 .

XX : 2 On the Polyhedral Escape Problem for Linear Dynamical Systems

J. Ouaknine, J. Worrell, João Sousa-Pinto, 2016 .

Dedication : I have happy memories of chasing time in the 1980 s with Howard Barringer and others . Now it seems to be catching us up !

A. W. Roscoe, J. Ouaknine, G. Lowe, 2014 .

Computational challenges in boundedmodel checking ∗

E. Clarke, J. Ouaknine, D. Kroening, 2005 .

Reachability in Succinct and Parametric One-Counter Automata

Joël Ouaknine, James Worrell, Stephan Kreutzer, 2009, CONCUR.

Formal Aspects of Computing Three tokens in Herman ’ s algorithm

J. Ouaknine, J. Worrell, Björn Wachter, 2013 .

Under consideration for publication in Formal Aspects of Computing Three Tokens in Herman ’ s Algorithm 1

J. Ouaknine, Björn Wachter, S. Kiefer, 2011 .

Skolem Meets Schanuel

J. Ouaknine, J. Worrell, F. Luca, 2022, MFCS.

Electronic Communications of the EASST Volume ? ( 2009 ) Proceedings of the Ninth International Workshop on Automated Verification of Critical Systems ( AVOCS 2009 ) Faster FDR Counterexample Generation Using SAT-Solving

A. W. Roscoe, J. Ouaknine, H. Palikareva, 2009 .

On Reachability for Hybrid Automata over Bounded Time pdf

Joël Ouaknine, James Worrell, Jean-François Raskin, 2011, ICALP.

The Completeness Threshold for BoundedModel Che king ? ? ?

E. Clarke, J. Ouaknine, D. Kroening, 2008 .

Complexity and Decidability in Unconventional Computational Models — case for support —

J. Biamonte, B. Coecke, J. Ouaknine, 2008 .

The Orbit Problem for Parametric Linear Dynamical Systems pdf

Christel Baier, James Worrell, Markus A. Whiteland, 2021, CONCUR.

Universal Skolem Sets

Joël Ouaknine, James Worrell, Florian Luca, 2021, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Decision Problems for Second-Order Holonomic Recurrences

Joël Ouaknine, James Worrell, Eike Neumann, 2021, ICALP.

Testing for Simulation and Bisimulation inLabelled Markov Pro esses

James Worrell, Michael W. Mislove, J. Ouaknine, 2003 .

Holonomic Techniques, Periods, and Decision Problems (Invited Talk)

Joël Ouaknine, J. Ouaknine, 2020, FSTTCS.

An Intrinsi Chara terization ofApproximate

Michael W. Mislove, M. Mislove, J. Ouaknine, 2007 .

Sequential Relational Decomposition

Moshe Y. Vardi, J. Ouaknine, Axel Legay, 2018, LICS.

On the Skolem Problem and the Skolem Conjecture

R. Lipton, J. Ouaknine, J. Worrell, 2022, LICS.

Decision Problems for Faulty Channel Machines : A Brief Survey

P. Bouyer, J. Ouaknine, J. Worrell, 2008 .

Discrete analysis of continuous behaviour in real-time concurrent systems

J. Ouaknine, 2000 .

Edinburgh Explorer Trace Inclusion for One-Counter Nets Revisited

J. Ouaknine, I. Potapov, Worrell, 2014 .

Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set

J. Ouaknine, J. Worrell, Engel Lefaucheux, 2022, MFCS.

A Universal Skolem Set of Positive Lower Density

J. Ouaknine, J. Worrell, F. Luca, 2022, MFCS.

100 : 2 On the Skolem Problem for Continuous Linear Dynamical Systems differential

J. Ouaknine, J. Worrell, Ventsislav Chonev, 2016 .

On the $p$-adic zeros of the Tribonacci sequence

J. Ouaknine, J. Worrell, F. Luca, 2022, 2210.16959.

Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications

Markus A. Whiteland, C. Baier, J. Ouaknine, 2022, CONCUR.

Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem

J. Ouaknine, J. Worrell, Nathanaël Fijalkow, 2019, Theory of Computing Systems.

Habilitation à diriger des recherches The Game of Synthesis

J. Ouaknine, J. Worrell, Nathanaël Fijalkow, 2022 .

Model Checking Linear Dynamical Systems under Floating-point Rounding

J. Ouaknine, D. Purser, Engel Lefaucheux, 2022, ArXiv.

The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems

J. Ouaknine, J. Worrell, T. Karimov, 2022, MFCS.

On the Complexity of the Orbit Problem

Joël Ouaknine, James Worrell, Ventsislav Chonev, 2013, J. ACM.

Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems

Joël Ouaknine, Olaf Stursberg, Edmund M. Clarke, 2003, Int. J. Found. Comput. Sci..

Language Equivalence for Probabilistic Automata

Joël Ouaknine, James Worrell, Andrzej S. Murawski, 2011, CAV.

On Probabilistic Program Equivalence and Refinement

Joël Ouaknine, Andrzej S. Murawski, J. Ouaknine, 2005, CONCUR.

On Stabilization in Herman's Algorithm

Joël Ouaknine, James Worrell, Lijun Zhang, 2011, ICALP.

Proving the Herman-Protocol Conjecture

Joël Ouaknine, James Worrell, Radu Grigore, 2015, ICALP.

Domain theory, testing and simulation for labelled Markov processes

Joël Ouaknine, James Worrell, Michael W. Mislove, 2005, Theor. Comput. Sci..

Duality for Labelled Markov Processes

Joël Ouaknine, James Worrell, Michael W. Mislove, 2004, FoSSaCS.

Axioms for Probability and Nondeterminism

Joël Ouaknine, James Worrell, Michael W. Mislove, 2004, EXPRESS.

An Intrinsic Characterization of Approximate Probabilistic Bisimilarity

Joël Ouaknine, James Worrell, Michael W. Mislove, 2003, FoSSaCS.

Timed CSP = Closed Timed epsilon-automata

Joël Ouaknine, James Worrell, J. Ouaknine, 2003, Nordic Journal of Computing.

Model checking Timed CSP

Joël Ouaknine, A. W. Roscoe, Gavin Lowe, 2014, HOWARD-60.

Recent Developments in FDR

Joël Ouaknine, James Worrell, Michael Goldsmith, 2012, CAV.

Timed CSP: A Retrospective

Joël Ouaknine, Steve A. Schneider, J. Ouaknine, 2006, APC 25.

Reachability Problems 2014: Special issue

Joël Ouaknine, James Worrell, Igor Potapov, 2018, Theoretical Computer Science.

On reachability problems for low dimensional matrix semigroups

Joël Ouaknine, James Worrell, Thomas Colcombet, 2019, International Colloquium on Automata, Languages and Programming.

Polynomial Invariants for Affine Programs

Joël Ouaknine, James Worrell, Ehud Hrushovski, 2018, LICS.

Positivity Problems for Low-Order Linear Recurrence Sequences pdf

Joël Ouaknine, James Worrell, J. Ouaknine, 2013, SODA.

Reachability problems for Markov chains

Joël Ouaknine, James Worrell, Timos Antonopoulos, 2015, Inf. Process. Lett..

On Timed Models and Full Abstraction

Joël Ouaknine, Gavin Lowe, J. Ouaknine, 2006, MFPS.

Timed CSP = closed timed ε-automata

Joël Ouaknine, James Worrell, J. Ouaknine, 2003 .

Timed CSP = Closed Timed Safety Automata

Joël Ouaknine, James Worrell, J. Ouaknine, 2002, EXPRESS.

Timed Temporal Logics

Joël Ouaknine, James Worrell, Patricia Bouyer, 2017, Models, Algorithms, Logics and Tools.

Universality and Language Inclusion for Open and Closed Timed Automata

Joël Ouaknine, James Worrell, J. Ouaknine, 2003, HSCC.

The Polyhedron-Hitting Problem pdf

Joël Ouaknine, James Worrell, Ventsislav Chonev, 2014, SODA.

Expressive Completeness for Metric Temporal Logic

Joël Ouaknine, James Worrell, Paul Hunter, 2012, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

On the Skolem Problem for Continuous Linear Dynamical Systems

Joël Ouaknine, James Worrell, Ventsislav Chonev, 2015, ICALP.

SAT-solving in CSP trace refinement

Joël Ouaknine, A. W. Roscoe, Hristina Palikareva, 2012, Sci. Comput. Program..

Static Livelock Analysis in CSP

Joël Ouaknine, James Worrell, A. W. Roscoe, 2011, CONCUR.

Static Livelock Analysis in CSP : Full Version

Joël Ouaknine, James Worrell, A. W. Roscoe, 2011 .

Digitisation and Full Abstraction for Dense-Time Model Checking

Joël Ouaknine, J. Ouaknine, Joël Ouaknine, 2002, TACAS.

On Automated Verification of Probabilistic Programs

Joël Ouaknine, James Worrell, Axel Legay, 2008, TACAS.

What's Decidable about Discrete Linear Dynamical Systems?

J. Ouaknine, J. Worrell, T. Karimov, 2022, Principles of Systems Design.

What’s decidable about linear loops?

Markus A. Whiteland, J. Ouaknine, J. Worrell, 2022, Proc. ACM Program. Lang..

Deciding ω-regular properties on linear recurrence sequences

Joël Ouaknine, James Worrell, Shaull Almagor, 2020, Proc. ACM Program. Lang..

On the decidability of reachability in linear time-invariant systems

Joël Ouaknine, João Sousa Pinto, James Worrell, 2018, HSCC.

On linear recurrence sequences and loop termination

Joël Ouaknine, James Worrell, J. Ouaknine, 2015, SIGL.

Decision Problems for Linear Recurrence Sequences

Joël Ouaknine, J. Ouaknine, 2012, SCSS.

On Searching for Small Kochen-Specker Vector Systems

Joël Ouaknine, Charles W. Wampler, Felix Arends, 2011, WG.

On the decidability and complexity of Metric Temporal Logic over finite words

Joël Ouaknine, James Worrell, J. Ouaknine, 2007, Log. Methods Comput. Sci..

Model Checking Succinct and Parametric One-Counter Automata

Joël Ouaknine, James Worrell, Christoph Haase, 2010, ICALP.

Computational challenges in bounded model checking

Joël Ouaknine, Daniel Kroening, Ofer Strichman, 2005, International Journal on Software Tools for Technology Transfer.

Completeness and Complexity of Bounded Model Checking

Joël Ouaknine, Daniel Kroening, Ofer Strichman, 2004, VMCAI.

On the Complexity of Linear Arithmetic with Divisibility

Joël Ouaknine, James Worrell, Antonia Lechner, 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

Nets with Tokens which Carry Data

Joël Ouaknine, James Worrell, A. W. Roscoe, 2008, Fundam. Informaticae.

Termination of Linear Loops over the Integers

James Worrell, Mehran Hosseini, Joel Ouaknine, 2019, ICALP.

On Termination of Integer Linear Loops

J. Ouaknine, J. Worrell, João Sousa Pinto, 2014, SODA.

A Static Analysis Framework for Livelock Freedom in CSP

Joël Ouaknine, James Worrell, A. W. Roscoe, 2013, Log. Methods Comput. Sci..

Concurrent software verification with states, events, and deadlocks

Joël Ouaknine, Sagar Chaki, Edmund M. Clarke, 2005, Formal Aspects of Computing.

State/Event Software Verification for Branching-Time Specifications

Joël Ouaknine, Helmut Veith, Sagar Chaki, 2005, IFM.

Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian

Joël Ouaknine, James Worrell, Ranko Lazic, 2013, MFCS.

On Expressiveness and Complexity in Real-Time Model Checking

Joël Ouaknine, James Worrell, Patricia Bouyer, 2008, ICALP.

On Metric Temporal Logic and Faulty Turing Machines

Joël Ouaknine, James Worrell, J. Ouaknine, 2006, FoSSaCS.

Efficient Verification of Sequential and Concurrent C Programs

Alex Groce, Joël Ouaknine, Sagar Chaki, 2004, Formal Methods Syst. Des..

The Polyhedral Escape Problem is Decidable pdf

J. Ouaknine, J. Worrell, João Sousa Pinto, 2015, ArXiv.

On Ranking Function Synthesis and Termination for Polynomial Programs

James Worrell, Eike Neumann, Joël Ouaknine, 2020, CONCUR.

Online Monitoring of Metric Temporal Logic

Joël Ouaknine, James Worrell, Hsi-Ming Ho, 2014, RV.

Abstraction-Based Satisfiability Solving of Presburger Arithmetic

Joël Ouaknine, Daniel Kroening, Ofer Strichman, 2004, CAV.

Abstra tion-based Satis ability Solving ofPresburger Arithmeti ?

S. Seshia, J. Ouaknine, D. Kroening, 2004 .

Model Checking Linear Dynamical Systems under Floating-point Rounding

J. Ouaknine, Engel Lefaucheux, Mohammadamin Sharifi, 2022, TACAS.

The Cost of Punctuality

Joël Ouaknine, James Worrell, Patricia Bouyer, 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

State/Event-Based Software Model Checking

Joël Ouaknine, Sagar Chaki, Edmund M. Clarke, 2004, IFM.

Faster FDR Counterexample Generation Using SAT-Solving

Joël Ouaknine, A. W. Roscoe, Hristina Palikareva, 2009, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

Automated Compositional Abstraction Refinement for Concurrent C Programs: A Two-Level Approach

Joël Ouaknine, Sagar Chaki, Edmund M. Clarke, 2003, SoftMC@CAV.

On Process-Algebraic Extensions of Metric Temporal Logic

Joël Ouaknine, James Worrell, Christoph Haase, 2010, Reflections on the Work of C. A. R. Hoare.

Verifying multi-threaded software with impact

Joël Ouaknine, Daniel Kroening, Björn Wachter, 2013, 2013 Formal Methods in Computer-Aided Design.

On the Positivity Problem for Simple Linear Recurrence Sequences,

Joël Ouaknine, James Worrell, J. Ouaknine, 2013, ICALP.

Effective Positivity Problems for Simple Linear Recurrence Sequences pdf

Joël Ouaknine, James Worrell, J. Ouaknine, 2013, ArXiv.

Semialgebraic Model Checking for Linear Dynamical Systems

Markus A. Whiteland, J. Ouaknine, J. Worrell, 2021 .

On the Complexity of Equivalence and Minimisation for Q-weighted Automata

Joël Ouaknine, James Worrell, Andrzej S. Murawski, 2013, Log. Methods Comput. Sci..

On the Complexity of the Equivalence Problem for Probabilistic Automata pdf

Joël Ouaknine, James Worrell, Andrzej S. Murawski, 2011, FoSSaCS.

The Cyclic-Routing UAV Problem is PSPACE-Complete

Joël Ouaknine, Hsi-Ming Ho, J. Ouaknine, 2014, FoSSaCS.

Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences pdf

Joël Ouaknine, James Worrell, J. Ouaknine, 2013, ICALP.

Deciding $\omega$-Regular Properties on Linear Recurrence Sequences

J. Ouaknine, J. Worrell, T. Karimov, 2020, 2010.14432.

Alternating Timed Automata over Bounded Time

Joël Ouaknine, James Worrell, Alexander Moshe Rabinovich, 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

The Church Synthesis Problem with Metric

Joël Ouaknine, James Worrell, Alexander Moshe Rabinovich, 2011, CSL.

An abstraction-based decision procedure for bit-vector arithmetic

Joël Ouaknine, Daniel Kroening, Ofer Strichman, 2009, International Journal on Software Tools for Technology Transfer.

On the decidability of metric temporal logic

Joël Ouaknine, James Worrell, J. Ouaknine, 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

On termination and invariance for faulty channel machines

Philippe Schnoebelen, Joël Ouaknine, James Worrell, 2012, Formal Aspects of Computing.

On Termination for Faulty Channel Machines pdf

Philippe Schnoebelen, Joël Ouaknine, James Worrell, 2008, STACS.

Safety Metric Temporal Logic Is Fully Decidable

Joël Ouaknine, James Worrell, J. Ouaknine, 2006, TACAS.

On reachability problems for low dimensional matrix semigroups pdf

Joël Ouaknine, James Worrell, Thomas Colcombet, 2019, ICALP.

Branching-Time Model Checking of Parametric One-Counter Automata

Joël Ouaknine, James Worrell, Christoph Haase, 2012, FoSSaCS.

Reachability in Injective Piecewise Affine Maps

J. Ouaknine, Edon Kelmendi, Faraz Ghahremani, 2023, 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

On Recurrent Reachability for Continuous Linear Dynamical Systems

Joël Ouaknine, James Worrell, Ventsislav Chonev, 2015, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems

Joël Ouaknine, Frits W. Vaandrager, F. Vaandrager, 2009 .

On Positivity and Minimality for Second-Order Holonomic Sequences pdf

Markus A. Whiteland, Pieter Moree, Joel Ouaknine, 2020, MFCS.

Algorithmic probabilistic game semantics

J. Ouaknine, J. Worrell, Björn Wachter, 2013, Formal Methods Syst. Des..