The following pages link to Joël Ouaknine (Q436422):
Displayed 50 items.
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Reachability problems for Markov chains (Q477610) (← links)
- On parametric timed automata and one-counter machines (Q515666) (← links)
- Porous invariants (Q832262) (← links)
- Convex language semantics for nondeterministic probabilistic automata (Q1623161) (← links)
- Domain theory, testing and simulation for labelled Markov processes (Q1770416) (← links)
- (Q1888199) (redirect page) (← links)
- Efficient verification of sequential and concurrent C programs (Q1888200) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Three tokens in Herman's algorithm (Q1941880) (← links)
- First-order orbit queries (Q2048201) (← links)
- Algebraic model checking for discrete linear dynamical systems (Q2112097) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem (Q2321928) (← links)
- Cyclic-routing of unmanned aerial vehicles (Q2424667) (← links)
- Concurrent software verification with states, events, and deadlocks (Q2432214) (← links)
- Timed CSP = Closed Timed Automata1 (Q2842610) (← links)
- (Q2845499) (← links)
- (Q2847403) (← links)
- A Static Analysis Framework for Livelock Freedom in CSP (Q2848369) (← links)
- Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian (Q2849950) (← links)
- (Q2852081) (← links)
- (Q2852365) (← links)
- Branching-Time Model Checking of Parametric One-Counter Automata (Q2892786) (← links)
- On the Complexity of the Equivalence Problem for Probabilistic Automata (Q2892790) (← links)
- (Q2908860) (← links)
- (Q2915691) (← links)
- Advances in Parametric Real-Time Reasoning (Q2922008) (← links)
- The Cyclic-Routing UAV Problem is PSPACE-Complete (Q2949448) (← links)
- (Q2955006) (← links)
- Relating Reachability Problems in Timed and Counter Automata (Q2968526) (← links)
- On the Magnitude of Completeness Thresholds in Bounded Model Checking (Q2986792) (← links)
- On Reachability for Hybrid Automata over Bounded Time (Q3012937) (← links)
- On Stabilization in Herman’s Algorithm (Q3012941) (← links)
- Linear Completeness Thresholds for Bounded Model Checking (Q3088266) (← links)
- Tractable Reasoning in a Fragment of Separation Logic (Q3090833) (← links)
- Static Livelock Analysis in CSP (Q3090843) (← links)
- On Searching for Small Kochen-Specker Vector Systems (Q3104762) (← links)
- On Process-Algebraic Extensions of Metric Temporal Logic (Q3163409) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
- On the Complexity of the Orbit Problem (Q3177796) (← links)
- Reachability in Succinct and Parametric One-Counter Automata (Q3184686) (← links)
- Time-Bounded Verification (Q3184695) (← links)
- Zone-Based Universality Analysis for Single-Clock Timed Automata (Q3508519) (← links)
- Undecidability of Universality for Timed Automata with Minimal Resources (Q3510831) (← links)
- On Expressiveness and Complexity in Real-Time Model Checking (Q3519496) (← links)
- Some Recent Results in Metric Temporal Logic (Q3543284) (← links)
- Towards a Theory of Time-Bounded Verification (Q3587425) (← links)
- Model Checking Succinct and Parametric One-Counter Automata (Q3587469) (← links)
- (Q3601411) (← links)