G. Geeraerts

From MaRDI portal
Person:487252

Available identifiers

zbMath Open geeraerts.gillesMaRDI QIDQ487252

List of research outcomes





PublicationDate of PublicationType
Dynamics on Games: Simulation-Based Techniques and Applications to Routing2023-02-03Paper
Timed-automata-based verification of MITL over signals2023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q51013502022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50909772022-07-21Paper
\textsc{MightyL}: a compositional translation from MITL to timed automata2022-07-01Paper
Dynamics and coalitions in sequential games2021-12-14Paper
Admissiblity in concurrent games2020-05-27Paper
On the termination of dynamics in sequential games2020-05-26Paper
Synthesising succinct strategies in safety games with an application to real-time scheduling2018-06-05Paper
Real-time synthesis is hard!2018-02-16Paper
To reach or not to reach? Efficient algorithms for total-payoff games2017-09-12Paper
Simple priced timed games are not that simple2017-07-13Paper
Quantitative games under failures2017-07-13Paper
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games2017-04-03Paper
\(\omega\)-Petri nets: algorithms and complexity2016-05-11Paper
Synthesising Succinct Strategies in Safety and Reachability Games2015-10-28Paper
On MITL and alternating timed automata over infinite words2015-08-06Paper
On regions and zones for event-clock automata2015-01-19Paper
Adding negative prices to priced timed games2014-09-15Paper
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm2014-07-14Paper
Time-bounded reachability for monotonic hybrid automata: complexity and fixed points2014-07-08Paper
On the \(\omega\)-language expressive power of extended Petri nets2013-09-25Paper
On MITL and alternating timed automata2013-08-16Paper
\(\omega \)-Petri nets2013-06-28Paper
Event clock automata: from theory to practice2011-10-07Paper
On reachability for hybrid automata over bounded time2011-07-07Paper
Lattice-valued binary decision diagrams2010-10-04Paper
Safraless Procedures for Timed Specifications2010-09-10Paper
On the efficient computation of the minimal coverability set of Petri nets2010-04-22Paper
Realizability of real-time logics2009-12-01Paper
On the Efficient Computation of the Minimal Coverability Set for Petri Nets2008-07-03Paper
Well-structured languages2007-08-17Paper
Computer Aided Verification2006-01-10Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science2005-08-12Paper

Research outcomes over time

This page was built for person: G. Geeraerts