Jean-François Raskin

From MaRDI portal
(Redirected from Person:453497)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The adversarial Stackelberg value in quantitative games2026-03-18Paper
As soon as possible but rationally2026-02-10Paper
LTL reactive synthesis with a few hints
Journal of Automated Reasoning
2025-10-22Paper
Rational verification for Nash and subgame-perfect equilibria in graph games2024-12-03Paper
Pareto-rational verification2024-08-13Paper
Strategy synthesis for global window PCTL2024-06-24Paper
The complexity of SPEs in mean-payoff games2024-06-24Paper
Stackelberg-Pareto synthesis
ACM Transactions on Computational Logic
2024-04-25Paper
On the Complexity of SPEs in Parity Games
(available as arXiv preprint)
2024-04-10Paper
LTL reactive synthesis with a few hints2024-04-05Paper
Subgame-perfect Equilibria in Mean-payoff Games (journal version)
Logical Methods in Computer Science
2024-01-16Paper
scientific article; zbMATH DE number 7730610 (Why is no real title available?)
(available as arXiv preprint)
2023-08-21Paper
scientific article; zbMATH DE number 7730629 (Why is no real title available?)
(available as arXiv preprint)
2023-08-21Paper
scientific article; zbMATH DE number 7730611 (Why is no real title available?)
(available as arXiv preprint)
2023-08-21Paper
scientific article; zbMATH DE number 7649921 (Why is no real title available?)2023-02-03Paper
Energy mean-payoff games
(available as arXiv preprint)
2023-02-03Paper
scientific article; zbMATH DE number 7650329 (Why is no real title available?)
(available as arXiv preprint)
2023-02-03Paper
Lifted model checking for relational MDPs
Machine Learning
2022-11-28Paper
Correction to: ``Reactive synthesis without regret''
Acta Informatica
2022-09-26Paper
scientific article; zbMATH DE number 7559496 (Why is no real title available?)
(available as arXiv preprint)
2022-07-18Paper
scientific article; zbMATH DE number 7559473 (Why is no real title available?)2022-07-18Paper
scientific article; zbMATH DE number 7533335 (Why is no real title available?)
(available as arXiv preprint)
2022-05-28Paper
Active learning of sequential transducers with side information about the domain
(available as arXiv preprint)
2022-03-25Paper
Safe learning for near-optimal scheduling
(available as arXiv preprint)
2022-03-24Paper
scientific article; zbMATH DE number 7447731 (Why is no real title available?)2021-12-17Paper
Parameterized complexity of games with monotonically ordered \(\omega\)-regular objectives
(available as arXiv preprint)
2021-08-04Paper
Learning-based mean-payoff optimization in an unknown MDP under omega-regular constraints
(available as arXiv preprint)
2021-08-04Paper
Expectations or guarantees? I want it all! A crossroad between games and MDPs2021-06-22Paper
Expectations or guarantees? I want it all! A crossroad between games and MDPs
(available as arXiv preprint)
2021-06-22Paper
Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
Information and Computation
2021-06-03Paper
A pattern logic for automata with outputs
International Journal of Foundations of Computer Science
2021-04-19Paper
On the existence of weak subgame perfect equilibria
Information and Computation
2021-02-08Paper
Mixing probabilistic and non-probabilistic objectives in Markov decision processes
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
2021-01-21Paper
Rational synthesis under imperfect information
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
2021-01-20Paper
On delay and regret determinization of max-plus automata2021-01-19Paper
On delay and regret determinization of max-plus automata
(available as arXiv preprint)
2021-01-19Paper
The complexity of subgame perfect equilibria in quantitative reachability games
(available as arXiv preprint)
2020-12-15Paper
The complexity of subgame perfect equilibria in quantitative reachability games2020-12-15Paper
From LTL and limit-deterministic Büchi automata to deterministic parity automata
Tools and Algorithms for the Construction and Analysis of Systems
2020-08-05Paper
Admissiblity in concurrent games
(available as arXiv preprint)
2020-05-27Paper
Threshold constraints with guarantees for parity objectives in Markov decision processes
(available as arXiv preprint)
2020-05-27Paper
Admissible strategies in timed games
Lecture Notes in Computer Science
2020-02-24Paper
Partial solvers for generalized parity games
(available as arXiv preprint)
2019-10-22Paper
Decidable weighted expressions with Presburger combinators
Journal of Computer and System Sciences
2019-08-30Paper
Looking at mean payoff through foggy windows
Acta Informatica
2018-12-12Paper
A pattern logic for automata with outputs
(available as arXiv preprint)
2018-11-22Paper
Minkowski games
ACM Transactions on Computational Logic
2018-10-24Paper
Visibly pushdown transducers
Journal of Computer and System Sciences
2018-09-07Paper
Symbolic model checking in non-Boolean domains
Handbook of Model Checking
2018-07-20Paper
Mean-payoff games with partial observation
Theoretical Computer Science
2018-06-05Paper
Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
2018-04-23Paper
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)
2018-04-23Paper
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)
2018-04-23Paper
scientific article; zbMATH DE number 6862142 (Why is no real title available?)
(available as arXiv preprint)
2018-04-19Paper
scientific article; zbMATH DE number 6862070 (Why is no real title available?)
(available as arXiv preprint)
2018-04-19Paper
On the complexity of heterogeneous multidimensional games2018-03-21Paper
Pareto curves of multidimensional mean-payoff games2018-03-01Paper
Percentile queries in multi-dimensional Markov decision processes
Computer Aided Verification
2018-03-01Paper
The complexity of rational synthesis2017-12-19Paper
Decidable weighted expressions with Presburger combinators
Lecture Notes in Computer Science
2017-11-22Paper
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
Acta Informatica
2017-10-09Paper
Assume-admissible synthesis2017-09-12Paper
Reactive Synthesis Without Regret2017-09-12Paper
scientific article; zbMATH DE number 6767615 (Why is no real title available?)
(available as arXiv preprint)
2017-08-31Paper
Minimizing regret in discounted-sum games
(available as arXiv preprint)
2017-07-19Paper
Durations and parametric model-checking in timed automata
ACM Transactions on Computational Logic
2017-07-12Paper
A classification of symbolic transition systems
ACM Transactions on Computational Logic
2017-07-12Paper
On the existence of weak subgame perfect equilibria
Lecture Notes in Computer Science
2017-05-19Paper
Energy and mean-payoff timed games
Proceedings of the 17th international conference on Hybrid systems: computation and control
2017-05-16Paper
Percentile queries in multi-dimensional Markov decision processes
Formal Methods in System Design
2017-05-15Paper
Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
Information and Computation
2017-05-12Paper
Doomsday equilibria for omega-regular games
Information and Computation
2017-05-12Paper
Multiple-environment Markov decision processes
(available as arXiv preprint)
2017-04-25Paper
Finite-valued weighted automata2017-04-25Paper
Quantitative games with interval objectives
(available as arXiv preprint)
2017-04-25Paper
Reactive synthesis without regret
Acta Informatica
2017-04-03Paper
Assume-admissible synthesis
Acta Informatica
2017-04-03Paper
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
(available as arXiv preprint)
2017-03-03Paper
The logic of ``initially'' and ``next'': complete axiomatization and complexity
Information Processing Letters
2016-06-16Paper
-Petri nets: algorithms and complexity
Fundamenta Informaticae
2016-05-11Paper
Non-zero sum games for reactive synthesis
Language and Automata Theory and Applications
2016-04-13Paper
Looking at mean-payoff through foggy windows
Automated Technology for Verification and Analysis
2016-01-08Paper
Quantitative languages defined by functional automata
Logical Methods in Computer Science
2015-10-29Paper
Mean-payoff games with partial-observation (extended abstract)
Lecture Notes in Computer Science
2015-10-28Paper
Looking at mean-payoff and total-payoff through windows
Information and Computation
2015-06-01Paper
The complexity of multi-mean-payoff and multi-energy games
Information and Computation
2015-05-04Paper
Variations on the stochastic shortest path problem
Lecture Notes in Computer Science
2015-02-04Paper
On regions and zones for event-clock automata
Formal Methods in System Design
2015-01-19Paper
Doomsday equilibria for omega-regular games
Lecture Notes in Computer Science
2015-01-13Paper
Time-bounded reachability for monotonic hybrid automata: complexity and fixed points
Automated Technology for Verification and Analysis
2014-07-08Paper
Looking at mean-payoff and total-payoff through windows
Automated Technology for Verification and Analysis
2014-07-08Paper
Strategy synthesis for multi-dimensional quantitative objectives
Acta Informatica
2014-07-03Paper
Games for counting abstractions2013-09-26Paper
On the -language expressive power of extended Petri nets2013-09-25Paper
Petri nets with non-blocking arcs are difficult to analyze2013-09-09Paper
Monotonic extensions of Petri nets: forward and backward search revisited2013-08-16Paper
Optimal bounds for multiweighted and parametrised energy games
Theories of Programming and Formal Methods
2013-08-16Paper
Synthesis from LTL specifications with mean-payoff objectives
Tools and Algorithms for the Construction and Analysis of Systems
2013-08-05Paper
\(\omega \)-Petri nets
Application and Theory of Petri Nets and Concurrency
2013-06-28Paper
Controllers with minimal observation power (application to timed systems)
Automated Technology for Verification and Analysis
2012-11-21Paper
Antichains and compositional algorithms for LTL synthesis
Formal Methods in System Design
2012-09-27Paper
Quantitative Languages Defined by Functional Automata
Lecture Notes in Computer Science
2012-09-25Paper
Strategy synthesis for multi-dimensional quantitative objectives
Lecture Notes in Computer Science
2012-09-25Paper
Generalized mean-payoff and energy games2012-08-29Paper
Generalized mean-payoff and energy games
(available as arXiv preprint)
2012-08-29Paper
Event clock automata: from theory to practice
Lecture Notes in Computer Science
2011-10-07Paper
Reachability Problems for Hybrid Automata
Lecture Notes in Computer Science
2011-10-07Paper
Antichain-Based QBF Solving
Automated Technology for Verification and Analysis
2011-10-07Paper
scientific article; zbMATH DE number 5954369 (Why is no real title available?)2011-10-05Paper
On reachability for hybrid automata over bounded time
Automata, Languages and Programming
2011-07-07Paper
Faster algorithms for mean-payoff games
Formal Methods in System Design
2011-05-23Paper
Fixed point guided abstraction refinement for alternating automata
Theoretical Computer Science
2010-10-07Paper
Compositional algorithms for LTL synthesis
Automated Technology for Verification and Analysis
2010-10-04Paper
Lattice-valued binary decision diagrams
Automated Technology for Verification and Analysis
2010-10-04Paper
Safraless Procedures for Timed Specifications
Lecture Notes in Computer Science
2010-09-10Paper
Energy and mean-payoff games with imperfect information
Computer Science Logic
2010-09-03Paper
Iterated regret minimization in game graphs
Mathematical Foundations of Computer Science 2010
2010-09-03Paper
Properties of visibly pushdown transducers
Mathematical Foundations of Computer Science 2010
2010-09-03Paper
Antichain algorithms for finite automata
Tools and Algorithms for the Construction and Analysis of Systems
2010-04-27Paper
Realizability of real-time logics
Lecture Notes in Computer Science
2009-12-01Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science
2009-08-06Paper
Fixpoint Guided Abstraction Refinement for Alternating Automata
Implementation and Application of Automata
2009-07-09Paper
Robust safety of timed automata
Formal Methods in System Design
2009-07-06Paper
An Antichain Algorithm for LTL Realizability
Computer Aided Verification
2009-06-30Paper
Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study
Hybrid Systems: Computation and Control
2009-04-30Paper
Antichains for the Automata-Based Approach to Model-Checking
Logical Methods in Computer Science
2009-04-29Paper
Algorithms for Omega-Regular Games with Imperfect Information
Computer Science Logic
2009-03-12Paper
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
Petri Nets and Other Models of Concurrency – ICATPN 2007
2009-03-11Paper
Fixpoint-Guided Abstraction Refinements
Static Analysis
2009-03-03Paper
From many places to few: automatic abstraction refinement for Petri nets2009-02-12Paper
EQUIVALENCE OF LABELED MARKOV CHAINS
International Journal of Foundations of Computer Science
2008-11-24Paper
Visibly Pushdown Transducers
Automata, Languages and Programming
2008-08-19Paper
Timed Control with Observation Based and Stuttering Invariant Strategies
Automated Technology for Verification and Analysis
2008-07-03Paper
On the Efficient Computation of the Minimal Coverability Set for Petri Nets
Automated Technology for Verification and Analysis
2008-07-03Paper
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
Tools and Algorithms for the Construction and Analysis of Systems
2008-04-11Paper
On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game
Computers and Games
2008-01-04Paper
Minimum-Time Reachability in Timed Games
Automata, Languages and Programming
2007-11-28Paper
Algorithms for Omega-Regular Games with Imperfect Information
Logical Methods in Computer Science
2007-11-15Paper
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
2007-10-11Paper
Real-Time Model-Checking: Parameters everywhere
Logical Methods in Computer Science
2007-10-11Paper
Hybrid Systems: Computation and Control
Lecture Notes in Computer Science
2007-09-25Paper
Antichains: A New Algorithm for Checking Universality of Finite Automata
Computer Aided Verification
2007-09-05Paper
Improved Algorithms for the Automata-Based Approach to Model-Checking
Tools and Algorithms for the Construction and Analysis of Systems
2007-09-03Paper
Well-structured languages
Acta Informatica
2007-08-17Paper
Hybrid Systems: Computation and Control
Lecture Notes in Computer Science
2007-05-02Paper
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science
2007-02-12Paper
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science
2006-11-14Paper
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science
2006-11-14Paper
Model checking restricted sets of timed paths
Theoretical Computer Science
2006-09-13Paper
On model-checking timed automata with stopwatch observers
Information and Computation
2006-06-09Paper
Computer Aided Verification
Lecture Notes in Computer Science
2006-01-10Paper
FM 2005: Formal Methods
Lecture Notes in Computer Science
2006-01-10Paper
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
2005-12-13Paper
CONCUR 2004 - Concurrency Theory
Lecture Notes in Computer Science
2005-08-23Paper
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Lecture Notes in Computer Science
2005-08-19Paper
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Lecture Notes in Computer Science
2005-08-19Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science
2005-08-12Paper
scientific article; zbMATH DE number 2085321 (Why is no real title available?)2004-08-09Paper
scientific article; zbMATH DE number 2080048 (Why is no real title available?)2004-08-04Paper
scientific article; zbMATH DE number 1962855 (Why is no real title available?)2003-08-11Paper
scientific article; zbMATH DE number 1864595 (Why is no real title available?)2003-02-06Paper
scientific article; zbMATH DE number 1796141 (Why is no real title available?)2002-09-04Paper
Axioms for real-time logics
Theoretical Computer Science
2002-03-03Paper
scientific article; zbMATH DE number 1617325 (Why is no real title available?)2001-07-11Paper
scientific article; zbMATH DE number 1538050 (Why is no real title available?)2000-12-03Paper
scientific article; zbMATH DE number 1444348 (Why is no real title available?)2000-09-18Paper
scientific article; zbMATH DE number 1400049 (Why is no real title available?)2000-03-20Paper
scientific article; zbMATH DE number 1304994 (Why is no real title available?)2000-01-12Paper
scientific article; zbMATH DE number 1324668 (Why is no real title available?)1999-08-17Paper


Research outcomes over time


This page was built for person: Jean-François Raskin