Gilles Geeraerts

According to our database1, Gilles Geeraerts
  • authored at least 52 papers between 2004 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks.
CoRR, 2017

Admissibility in Concurrent Games.
CoRR, 2017

Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games.
Acta Inf., 2017

Models and Algorithms for Chronology.
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

Timed-Automata-Based Verification of MITL over Signals.
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

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

MightyL: A Compositional Translation from MITL to Timed Automata.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Real-Time Synthesis is Hard!
CoRR, 2016

Efficient Energy Distribution in a Smart Grid using Multi-Player Games.
Proceedings of the Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters and 3rd International Workshop on Synthesis of Complex Parameters, 2016

Real-Time Synthesis is Hard!
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2016

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

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

Quantitative Games under Failures.
CoRR, 2015

Simple Priced Timed Games Are Not That Simple.
CoRR, 2015

Quantitative Games under Failures.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Simple Priced Timed Games are not That Simple.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

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

Synthesising Succinct Strategies in Safety Games.
CoRR, 2014

Adding Negative Prices to Priced Timed Games.
CoRR, 2014

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.
CoRR, 2014

On MITL and alternating timed automata over infinite words.
CoRR, 2014

Synthesising Succinct Strategies in Safety and Reachability Games.
Proceedings of the Reachability Problems - 8th International Workshop, 2014

On MITL and Alternating Timed Automata over Infinite Words.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2014

Adding Negative Prices to Priced Timed Games.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm.
Real-Time Systems, 2013

On MITL and alternating timed automata
CoRR, 2013

ω-Petri nets
CoRR, 2013

On MITL and Alternating Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 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

Queue-Dispatch Asynchronous Systems
CoRR, 2012

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

A faster exact multiprocessor schedulability test for sporadic tasks
CoRR, 2011

On Reachability for Hybrid Automata over Bounded Time
CoRR, 2011

A faster exact multiprocessor schedulability test for sporadic tasks.
Proceedings of the 19th International Conference on Real-Time and Network Systems, 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

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

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

Lattice-Valued Binary Decision Diagrams.
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

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

2007
Well-structured languages.
Acta Inf., 2007

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

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

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

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

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


  Loading...