- MFPS XX1 Preliminary Version On timed models and full abstraction
- URL: http://www.elsevier.nl/locate/entcs/volume68.html 18 pages Timed CSP = Closed Timed Automata 1
- Fundamenta Informaticae XX (2008) 1--33 1 Universality Analysis for OneClock Timed Automata
- On Automated Verification of Probabilistic Axel Legay 1 , Andrzej S. Murawski 2 , Joel Ouaknine 2 , and James Worrell 2
- Timed CSP: A Retrospective Joel Ouaknine 1
- Electronic Notes in Theoretical Computer Science 73 (2003) URL: http://www.elsevier.nl/locate/entcs/volume73.html 8 pages
- Int J Softw Tools Technol Transfer (2005) / Digital Object Identifier (DOI) 10.1007/s10009-004-0182-5 Computational challenges in bounded model checking
- On Probabilistic Program Equivalence and Refinement #
- E#cient Verification of Sequential and Concurrent C S. Chaki (chaki@cs.cmu.edu)
- An Intrinsic Characterization of Approximate Probabilistic Bisimilarity
- An Intrinsic Characterization of Approximate Probabilistic Bisimilarity
- Nordic Journal of Computing 10(2003), 1--35. TIMED CSP = CLOSED TIMED #AUTOMATA
- On Automated Verification of Probabilistic Axel Legay1
- Duality for Labelled Markov Processes Michael Mislove 1 , Joel Ouaknine 2 , Dusko Pavlovic 3 and James Worrell 1
- Completeness and Complexity of Bounded Model Checking #
- State/Event-based Software Model Checking Sagar Chaki Edmund M. Clarke Joel Ouaknine
- Language Equivalence for Probabilistic Automata
- On Metric Temporal Logic and Faulty Turing Machines
- arXiv:1104.3100v1[cs.DS]15Apr2011 On Stabilization in Herman's Algorithm
- On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
- Fundamenta Informaticae XX (2008) 1--24 1 Nets with tokens which carry data
- On Expressiveness and Complexity in Realtime Model Checking
- Book Review: # Verification of Reactive Systems
- Universality and Language Inclusion for Open and Closed Timed Automata #
- Nets with tokens which carry data Ranko Lazic1,
- On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
- Tractable Reasoning in a Fragment of Separation Byron Cook1,3
- State/Event Software Verification for Branchingtime Specifications #
- On the Decidability of Metric Temporal Logic Joel Ouaknine
- Duality for Labelled Markov Processes Michael Mislove1
- Undecidability of Universality for Timed Automata with Minimal Resources
- Reachability in Succinct and Parametric One-Counter Automata
- Domain Theory, Testing and Simulation for Labelled Markov Processes
- Universality and Language Inclusion for Open and Closed Timed Automata
- On Expressiveness and Complexity in Real-time Model Checking
- On Metric Temporal Logic and Faulty Turing Machines
- State/Event-based Software Model Checking ? Sagar Chaki Edmund M. Clarke Joel Ouaknine
- Some Recent Results in Metric Temporal Logic Joel Ouaknine and James Worrell
- TimeBounded Verification # Joel Ouaknine 1 , Alexander Rabinovich 2 , and James Worrell 1
- Safety Metric Temporal Logic is Fully Decidable Joel Ouaknine and James Worrell
- Decidability and Complexity Results for Timed Automata via Channel Machines
- Discrete Analysis of Continuous Behaviour in Real-Time Concurrent Systems
- Time-Bounded Verification Joel Ouaknine1
- Towards a Theory of Time-Bounded Verification Joel Ouaknine and James Worrell
- On Process-Algebraic Extensions of Metric Temporal Logic
- Some Recent Results in Metric Temporal Logic Joel Ouaknine and James Worrell
- Zone-Based Universality Analysis for Single-Clock Timed Automata
- Logical Methods in Computer Science Volume 00, Number 0, Pages 000000
- Safety Metric Temporal Logic is Fully Decidable Joel Ouaknine and James Worrell
- Decidability and Complexity Results for Timed Automata via Channel Machines
- Revisiting Digitization, Robustness, and Decidability for Timed Automata Joel Ouaknine
- Linear Completeness Thresholds for Bounded Model Checking
- Int J Softw Tools Technol Transfer (2009) 11:95104 DOI 10.1007/s10009-009-0101-x
- Deciding Bit-Vector Arithmetic with Abstraction
- State/Event Software Verification for Branching-time Specifications
- Under consideration for publication in Formal Aspects of Computing Concurrent Software Verification with
- Automated, Compositional and Iterative Deadlock Detection Sagar Chaki Edmund Clarke Joel Ouaknine Natasha Sharygina
- Electronic Notes in Theoretical Computer Science 89 No. 3 (2003) URL: http://www.elsevier.nl/locate/entcs/volume89.html 16 pages
- On Probabilistic Program Equivalence and Andrzej S. Murawski and Joel Ouaknine
- Domain Theory, Testing and Simulation for Labelled Markov Processes
- Axioms for Probability and Nondeterminism Michael Mislovea,1
- On Reachability for Hybrid Automata over Bounded Time
- Fundamenta Informaticae XX (2008) 124 1 Nets with tokens which carry data
- Nordic Journal of Computing 10(2003), 135. TIMED CSP = CLOSED TIMED -AUTOMATA
- Computing Rational Radical Sums in Uniform TC0 Paul Hunter1
- Electronic Communications of the EASST Volume ? (2009)
- Sudoku as a SAT Problem In^es Lynce
- Book Review: Verification of Reactive Systems
- Undecidability of Universality for Timed Automata with Minimal Resources
- Abstraction-based Satis ability Solving of Presburger Arithmetic ?
- Completeness and Complexity of Bounded Model Checking
- On the Decidability of Metric Temporal Logic Joel Ouaknine
- Parallel Assignments in Software Model Murray Stokely 1
- Discrete Analysis of Continuous Behaviour in Real-Time Concurrent Systems
- Automated, Compositional and Iterative Deadlock Detection Sagar Chaki Edmund Clarke Joel Ouaknine Natasha Sharygina
- Alternating Timed Automata over Bounded Time Mark Jenkins
- On Searching for Small Kochen-Specker Vector Systems
- Electronic Notes in Theoretical Computer Science 89 No. 3 (2003) URL: http://www.elsevier.nl/locate/entcs/volume89.html 16 pages
- Sudoku as a SAT Problem Ines Lynce
- On timed models and full abstraction Gavin Lowe and Joel Ouaknine 1
- Fundamenta Informaticae XX (2008) 133 1 Universality Analysis for One-Clock Timed Automata
- Revisiting Digitization, Robustness, and Decidability for Timed Automata Joel Ouaknine
- Parallel Assignments in Software Model Murray Stokely 1
- Logical Methods in Computer Science Volume 00, Number 0, Pages 000--000
- Under consideration for publication in Formal Aspects of Computing Concurrent Software Verification with
- The Cost of Punctuality Patricia Bouyer 1,2,# Nicolas Markey 1 Joel Ouaknine 2 James Worrell 2
- Nets with tokens which carry data Ranko Lazic 1,# , Tom Newcomb 2 , Joel Ouaknine 2 ,
- ZoneBased Universality Analysis for SingleClock Timed Automata
- On Searching for Small Kochen-Specker Vector Systems (extended version)
- Static Livelock Analysis in CSP Joel Ouaknine, Hristina Palikareva, A. W. Roscoe, and James Worrell
- The Church Synthesis Problem with Metric Mark Jenkins1
- Static Livelock Analysis in CSP # Joel Ouaknine, Hristina Palikareva, A. W. Roscoe, and James Worrell
