Jean-François Raskin

According to our database1, Jean-François Raskin authored at least 210 papers between 1997 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Symbolic Model Checking in Non-Boolean Domains.
Proceedings of the Handbook of Model Checking., 2018

Mean-payoff games with partial observation.
Theor. Comput. Sci., 2018

Visibly pushdown transducers.
J. Comput. Syst. Sci., 2018

Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives.
Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives.
CoRR, 2018

Beyond admissibility: Dominance between chains of strategies.
CoRR, 2018

Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints.
CoRR, 2018

Rational Synthesis Under Imperfect Information.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

A Pattern Logic for Automata with Outputs.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Beyond Admissibility: Dominance Between Chains of Strategies.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

Parameterized complexity of games with monotonically ordered omega-regular objectives.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
The first reactive synthesis competition (SYNTCOMP 2014).
STTT, 2017

Doomsday equilibria for omega-regular games.
Inf. Comput., 2017

Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games.
Inf. Comput., 2017

Percentile queries in multi-dimensional Markov decision processes.
Formal Methods in System Design, 2017

The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results.
Proceedings of the Proceedings Sixth Workshop on Synthesis, 2017

Decidable Weighted Expressions with Presburger Combinators.
CoRR, 2017

On Delay and Regret Determinization of Max-Plus Automata.
CoRR, 2017

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata.
CoRR, 2017

Games with lexicographically ordered $ω$-regular objectives.
CoRR, 2017

Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes.
CoRR, 2017

Admissibility in Concurrent Games.
CoRR, 2017

Reactive synthesis without regret.
Acta Inf., 2017

Assume-admissible synthesis.
Acta Inf., 2017

Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.
Acta Inf., 2017

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Minkowski Games.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

On delay and regret determinization of max-plus automata.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Admissiblity in Concurrent Games.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

On the Existence of Weak Subgame Perfect Equilibria.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Decidable Weighted Expressions with Presburger Combinators.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Admissibility in Games with Imperfect Information (Invited Talk).
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Admissible Strategies in Timed Games.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

Optimizing Expectation with Guarantees in POMDPs.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
A Tutorial on Mean-payoff and Energy Games.
Proceedings of the Dependable Software Systems Engineering, 2016

The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results.
Proceedings of the Proceedings Fifth Workshop on Synthesis, 2016

Optimizing Expectation with Guarantees in POMDPs (Technical Report).
CoRR, 2016

On the existence of weak subgame perfect equilibria.
CoRR, 2016

Admissibility in Quantitative Graph Games.
CoRR, 2016

Minkowski games.
CoRR, 2016

Non-Zero Sum Games for Reactive Synthesis.
Proceedings of the Language and Automata Theory and Applications, 2016

The Complexity of Rational Synthesis.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Admissibility in Quantitative Graph Games.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Minimizing Regret in Discounted-Sum Games.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

On the Complexity of Heterogeneous Multidimensional Games.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
On the Verification of Concurrent, Asynchronous Programs with Waiting Queues.
ACM Trans. Embedded Comput. Syst., 2015

The complexity of multi-mean-payoff and multi-energy games.
Inf. Comput., 2015

Looking at mean-payoff and total-payoff through windows.
Inf. Comput., 2015

ω-Petri Nets: Algorithms and Complexity.
Fundam. Inform., 2015

Quantitative Languages Defined by Functional Automata
Logical Methods in Computer Science, 2015

The Second Reactive Synthesis Competition (SYNTCOMP 2015).
Proceedings of the Proceedings Fourth Workshop on Synthesis, 2015

The First Reactive Synthesis Competition (SYNTCOMP 2014).
CoRR, 2015

Minimizing Regret in Discounted-Sum Games.
CoRR, 2015

Looking at Mean-Payoff through Foggy Windows.
CoRR, 2015

Reactive Synthesis Without Regret.
CoRR, 2015

Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives.
CoRR, 2015

On the complexity of heterogeneous multidimensional quantitative games.
CoRR, 2015

Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.
CoRR, 2015

Assume-Admissible Synthesis.
CoRR, 2015

Compositional Algorithms for Succinct Safety Games.
Proceedings of the Proceedings Fourth Workshop on Synthesis, 2015

Non-Zero Sum Games for Reactive Synthesis.
CoRR, 2015

The equivalence problem for finite automata: technical perspective.
Commun. ACM, 2015

Variations on the Stochastic Shortest Path Problem.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

Reactive Synthesis Without Regret.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Assume-Admissible Synthesis.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Percentile Queries in Multi-dimensional Markov Decision Processes.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

Pareto Curves of Multidimensional Mean-Payoff Games.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

Looking at Mean-Payoff Through Foggy Windows.
Proceedings of the Automated Technology for Verification and Analysis, 2015

2014
On regions and zones for event-clock automata.
Formal Methods in System Design, 2014

Multiple-Environment Markov Decision Processes.
CoRR, 2014

Variations on the Stochastic Shortest Path Problem.
CoRR, 2014

Percentile Queries in Multi-Dimensional Markov Decision Processes.
CoRR, 2014

Quantitative games with interval objectives.
CoRR, 2014

Secure Equilibria in Weighted Games.
CoRR, 2014

Expectations or Guarantees? I Want It All! A crossroad between games and MDPs.
Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

AbsSynthe: abstract synthesis from succinct safety specifications.
Proceedings of the Proceedings 3rd Workshop on Synthesis, 2014

Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes.
Proceedings of the Proceedings 3rd Workshop on Synthesis, 2014

Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.
CoRR, 2014

Strategy synthesis for multi-dimensional quantitative objectives.
Acta Inf., 2014

Doomsday Equilibria for Omega-Regular Games.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2014

Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Mean-Payoff Games with Partial-Observation - (Extended Abstract).
Proceedings of the Reachability Problems - 8th International Workshop, 2014

Energy and mean-payoff timed games.
Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control (part of CPS Week), 2014

Multiple-Environment Markov Decision Processes.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Quantitative Games with Interval Objectives.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Finite-Valued Weighted Automata.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Secure equilibria in weighted games.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

The complexity of admissibility in Omega-regular games.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Featured Transition Systems: Foundations for Verifying Variability-Intensive Systems and Their Application to LTL Model Checking.
IEEE Trans. Software Eng., 2013

Exploiting structure in LTL synthesis.
STTT, 2013

The Complexity of Admissibility in Omega-Regular Games
CoRR, 2013

Looking at Mean-Payoff and Total-Payoff through Windows
CoRR, 2013

ω-Petri nets
CoRR, 2013

Mean-payoff Games with Incomplete Information.
CoRR, 2013

Doomsday Equilibria for Omega-Regular Games.
CoRR, 2013

Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games.
CoRR, 2013

Synthesis from LTL Specifications with Mean-Payoff Objectives.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Optimal Bounds for Multiweighted and Parametrised Energy Games.
Proceedings of the Theories of Programming and Formal Methods, 2013

Looking at Mean-Payoff and Total-Payoff through Windows.
Proceedings of the Automated Technology for Verification and Analysis, 2013

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points.
Proceedings of the Automated Technology for Verification and Analysis, 2013

ω-Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2013

Queue-Dispatch Asynchronous Systems.
Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2012
Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints
CoRR, 2012

Synthesis from LTL Specifications with Mean-Payoff Objectives
CoRR, 2012

The Complexity of Multi-Mean-Payoff and Multi-Energy Games
CoRR, 2012

Controllers with Minimal Observation Power (Application to Timed Systems)
CoRR, 2012

Strategy Synthesis for Multi-dimensional Quantitative Objectives
CoRR, 2012

Queue-Dispatch Asynchronous Systems
CoRR, 2012

Quantitative Languages Defined by Functional Automata.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Strategy Synthesis for Multi-Dimensional Quantitative Objectives.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Acacia+, a Tool for LTL Synthesis.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Controllers with Minimal Observation Power (Application to Timed Systems).
Proceedings of the Automated Technology for Verification and Analysis, 2012

2011
Antichains and compositional algorithms for LTL synthesis.
Formal Methods in System Design, 2011

Faster algorithms for mean-payoff games.
Formal Methods in System Design, 2011

Event-Clock Automata: From Theory to Practice
CoRR, 2011

On Reachability for Hybrid Automata over Bounded Time
CoRR, 2011

Reachability Problems for Hybrid Automata.
Proceedings of the Reachability Problems - 5th International Workshop, 2011

On Reachability for Hybrid Automata over Bounded Time.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Event Clock Automata: From Theory to Practice.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

Antichain-Based QBF Solving.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
Fixed point guided abstraction refinement for alternating automata.
Theor. Comput. Sci., 2010

On the Efficient Computation of the Minimal Coverability Set of Petri Nets.
Int. J. Found. Comput. Sci., 2010

Generalized Mean-payoff and Energy Games
CoRR, 2010

Iterated Regret Minimization in Game Graphs
CoRR, 2010

On Functionality of Visibly Pushdown Transducers
CoRR, 2010

Antichain Algorithms for Finite Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Properties of Visibly Pushdown Transducers.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Iterated Regret Minimization in Game Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Model checking lots of systems: efficient verification of temporal properties in software product lines.
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering, 2010

Generalized Mean-payoff and Energy Games.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Safraless Procedures for Timed Specifications.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2010

Quantitative system validation in model driven design.
Proceedings of the 10th International conference on Embedded software, 2010

Energy and Mean-Payoff Games with Imperfect Information.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

Lattice-Valued Binary Decision Diagrams.
Proceedings of the Automated Technology for Verification and Analysis, 2010

Compositional Algorithms for LTL Synthesis.
Proceedings of the Automated Technology for Verification and Analysis, 2010

2009
Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents.
Technique et Science Informatiques, 2009

Antichains for the Automata-Based Approach to Model-Checking
Logical Methods in Computer Science, 2009

Fixpoint Guided Abstraction Refinement for Alternating Automata.
Proceedings of the Implementation and Application of Automata, 2009

Automatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study.
Proceedings of the Hybrid Systems: Computation and Control, 12th International Conference, 2009

Realizability of Real-Time Logics.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2009

An Antichain Algorithm for LTL Realizability.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008
Durations and parametric model-checking in timed automata.
ACM Trans. Comput. Log., 2008

Equivalence of Labeled Markov Chains.
Int. J. Found. Comput. Sci., 2008

From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.
Fundam. Inform., 2008

Robust safety of timed automata.
Formal Methods in System Design, 2008

Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Visibly Pushdown Transducers.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Alaska.
Proceedings of the Automated Technology for Verification and Analysis, 2008

2007
Algorithms for Omega-Regular Games with Imperfect Information.
Logical Methods in Computer Science, 2007

Real-Time Model-Checking: Parameters everywhere.
Logical Methods in Computer Science, 2007

On the optimal reachability problem of weighted timed automata.
Formal Methods in System Design, 2007

Real-Time Model-Checking: Parameters everywhere
CoRR, 2007

Algorithms for Omega-Regular Games with Imperfect Information
CoRR, 2007

Well-structured languages.
Acta Inf., 2007

Improved Algorithms for the Automata-Based Approach to Model-Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

Fixpoint-Guided Abstraction Refinements.
Proceedings of the Static Analysis, 14th International Symposium, 2007

Minimum-Time Reachability in Timed Games.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

On the Efficient Computation of the Minimal Coverability Set for Petri Nets.
Proceedings of the Automated Technology for Verification and Analysis, 2007

Timed Control with Observation Based and Stuttering Invariant Strategies.
Proceedings of the Automated Technology for Verification and Analysis, 2007

From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.
Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006
Model checking restricted sets of timed paths.
Theor. Comput. Sci., 2006

On the omega-language expressive power of extended Petri nets.
Theor. Comput. Sci., 2006

Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS.
J. Comput. Syst. Sci., 2006

On model-checking timed automata with stopwatch observers.
Inf. Comput., 2006

A Complete Abstract Interpretation Framework for Coverability Properties of WSTS.
Proceedings of the Verification, 2006

A Lattice Theory for Solving Games of Imperfect Information.
Proceedings of the Hybrid Systems: Computation and Control, 9th International Workshop, 2006

Algorithms for Omega-Regular Games with Imperfect Information, .
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game.
Proceedings of the Computers and Games, 5th International Conference, 2006

Antichains: A New Algorithm for Checking Universality of Finite Automata.
Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2005
A classification of symbolic transition systems.
ACM Trans. Comput. Log., 2005

Almost ASAP semantics: from timed models to timed implementations.
Formal Asp. Comput., 2005

Games for Counting Abstractions.
Electr. Notes Theor. Comput. Sci., 2005

On the omega-language Expressive Power of Extended Petri Nets.
Electr. Notes Theor. Comput. Sci., 2005

Automatic Rectangular Refinement of Affine Hybrid Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

On Optimal Timed Strategies.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

Systematic Implementation of Real-Time Models.
Proceedings of the FM 2005: Formal Methods, 2005

Expand, Enlarge and Check... Made Efficient.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005

An Introduction to Hybrid Automata.
Proceedings of the Handbook of Networked and Embedded Control Systems, 2005

2004
Covering sharing trees: a compact data structure for parameterized verification.
STTT, 2004

Petri Nets with Non-blocking Arcs are Difficult to Analyze.
Electr. Notes Theor. Comput. Sci., 2004

Almost ASAP Semantics: From Timed Models to Timed Implementations.
Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004

Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Robustness and Implementability of Timed Automata.
Proceedings of the Formal Techniques, 2004

Model-Checking for Weighted Timed Automata.
Proceedings of the Formal Techniques, 2004

Model Checking Restricted Sets of Timed Paths.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
A Game-based Verification of Non-repudiation and Fair Exchange Protocols.
Journal of Computer Security, 2003

Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Real-Time Model-Checking: Parameters Everywhere.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
Axioms for real-time logics.
Theor. Comput. Sci., 2002

Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited.
Electr. Notes Theor. Comput. Sci., 2002

Towards the Automated Verification of Multithreaded Java Programs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002

A Comparison of Control Problems for Timed and Hybrid Systems.
Proceedings of the Hybrid Systems: Computation and Control, 5th International Workshop, 2002

Game Analysis of Abuse-free Contract Signing.
Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW-15 2002), 2002

2001
A Classification of Symbolic Transition Systems
CoRR, 2001

A Game-Based Verification of Non-repudiation and Fair Exchange Protocols.
Proceedings of the CONCUR 2001, 2001

Attacking Symbolic State Explosion.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001

2000
Symbolic Representation of Upward-Closed Sets.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

Abstract Interpretation of Game Properties.
Proceedings of the Static Analysis, 7th International Symposium, 2000

Robust Undecidability of Timed and Hybrid Systems.
Proceedings of the Hybrid Systems: Computation and Control, Third International Workshop, 2000

1999
The Logic of Event Clocks - Decidability, Complexity and Expressiveness.
Journal of Automata, Languages and Combinatorics, 1999

The Logic of "Initially" and "Next": Complete Axiomatization and Complexity.
Inf. Process. Lett., 1999

Model-Generation of a Fictitious Clock Real-Time Logic Using Sharing Trees.
Electr. Notes Theor. Comput. Sci., 1999

1998
The Regular Real-Time Languages.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Axioms for Real-Time Logics.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997
Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1997

State Clock Logic: A Decidable Real-Time Logic.
Proceedings of the Hybrid and Real-Time Systems, 1997


  Loading...