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
https://portal.mardi4nfdi.de/entity/Q33841682021-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
https://portal.mardi4nfdi.de/entity/Q53577112017-09-12Paper
https://portal.mardi4nfdi.de/entity/Q52753742017-07-13Paper
https://portal.mardi4nfdi.de/entity/Q52753752017-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
ω-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