Jean-François Raskin

Mathieu Sassolas

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.

[BibT_eX]

[DOI]

Andreas Classen

Maxime Cordy

Patrick Heymans

Axel Legay

IEEE Trans. Software Eng., 2013

Exploiting structure in LTL synthesis.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2013

Mean-payoff Games with Incomplete Information.

[BibT_eX]

[DOI]

Paul Hunter

Guillermo A. Pérez

CoRR, 2013

Synthesis from LTL Specifications with Mean-Payoff Objectives.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Optimal Bounds for Multiweighted and Parametrised Energy Games.

[BibT_eX]

[DOI]

Line Juhl

Proceedings of the Theories of Programming and Formal Methods, 2013

Looking at Mean-Payoff and Total-Payoff through Windows.

[BibT_eX]

[DOI]

Mickael Randour

Proceedings of the Automated Technology for Verification and Analysis, 2013

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2013

ω-Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2013

Queue-Dispatch Asynchronous Systems.

[BibT_eX]

[DOI]

Alexander Heußner

Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2012

Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints

[BibT_eX]

[DOI]

CoRR, 2012

Quantitative Languages Defined by Functional Automata.

[BibT_eX]

[DOI]

Raffaella Gentilini

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Strategy Synthesis for Multi-Dimensional Quantitative Objectives.

[BibT_eX]

[DOI]

Mickael Randour

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Acacia+, a Tool for LTL Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Controllers with Minimal Observation Power (Application to Timed Systems).

[BibT_eX]

[DOI]

Peter E. Bulychev

Alexandre David

Pierre-Alain Reynier

Proceedings of the Automated Technology for Verification and Analysis, 2012

2011

Antichains and compositional algorithms for LTL synthesis.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2011

Faster algorithms for mean-payoff games.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2011

Reachability Problems for Hybrid Automata.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 5th International Workshop, 2011

On Reachability for Hybrid Automata over Bounded Time.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Event Clock Automata: From Theory to Practice.

[BibT_eX]

[DOI]

Nathalie Sznajder

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

Antichain-Based QBF Solving.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2011

Games with imperfect information: theory and algorithms.

[BibT_eX]

Proceedings of the Lectures in Game Theory for Computer Scientists., 2011

2010

Fixed point guided abstraction refinement for alternating automata.

[BibT_eX]

[DOI]

Nicolas Maquet

Theor. Comput. Sci., 2010

On Functionality of Visibly Pushdown Transducers

[BibT_eX]

[DOI]

CoRR, 2010

Antichain Algorithms for Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Properties of Visibly Pushdown Transducers.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Iterated Regret Minimization in Game Graphs.

[BibT_eX]

[DOI]

Tristan Le Gall

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Model checking lots of systems: efficient verification of temporal properties in software product lines.

[BibT_eX]

[DOI]

Andreas Classen

Patrick Heymans

Axel Legay

Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering, 2010

Generalized Mean-payoff and Energy Games.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Safraless Procedures for Timed Specifications.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2010

Quantitative system validation in model driven design.

[BibT_eX]

[DOI]

Holger Hermanns

Jan Tretmans

Proceedings of the 10th International conference on Embedded software, 2010

Energy and Mean-Payoff Games with Imperfect Information.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

Lattice-Valued Binary Decision Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2010

Compositional Algorithms for LTL Synthesis.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Tech. Sci. Informatiques, 2009

Antichains for the Automata-Based Approach to Model-Checking

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2009

Fixpoint Guided Abstraction Refinement for Alternating Automata.

[BibT_eX]

[DOI]

Nicolas Maquet

Proceedings of the Implementation and Application of Automata, 2009

Automatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study.

[BibT_eX]

[DOI]

Jan Jakob Jessen

Pierre-Alain Reynier

Proceedings of the Hybrid Systems: Computation and Control, 12th International Conference, 2009

Realizability of Real-Time Logics.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2009

An Antichain Algorithm for LTL Realizability.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008

Durations and parametric model-checking in timed automata.

[BibT_eX]

[DOI]

Emmanuel Dall'Olio

ACM Trans. Comput. Log., 2008

Equivalence of Labeled Markov Chains.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

Robust safety of timed automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2008

Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Visibly Pushdown Transducers.

[BibT_eX]

[DOI]

Frédéric Servais

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Alaska.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2008

2007

Algorithms for Omega-Regular Games with Imperfect Information.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2007

On the optimal reachability problem of weighted timed automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2007

Well-structured languages.

[BibT_eX]

[DOI]

Acta Informatica, 2007

Improved Algorithms for the Automata-Based Approach to Model-Checking.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

Fixpoint-Guided Abstraction Refinements.

[BibT_eX]

[DOI]

Patrick Cousot

Proceedings of the Static Analysis, 14th International Symposium, 2007

Minimum-Time Reachability in Timed Games.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

On the Efficient Computation of the Minimal Coverability Set for Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2007

Timed Control with Observation Based and Stuttering Invariant Strategies.

[BibT_eX]

[DOI]

Alexandre David

Didier Lime

Proceedings of the Automated Technology for Verification and Analysis, 2007

From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006

On the omega-language expressive power of extended Petri nets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

On model-checking timed automata with stopwatch observers.

[BibT_eX]

[DOI]

Thomas Brihaye

Inf. Comput., 2006

A Complete Abstract Interpretation Framework for Coverability Properties of WSTS.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2006

A Lattice Theory for Solving Games of Imperfect Information.

[BibT_eX]

[DOI]

Martin De Wulf

Proceedings of the Hybrid Systems: Computation and Control, 9th International Workshop, 2006

Algorithms for Omega-Regular Games with Imperfect Information, .

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game.

[BibT_eX]

[DOI]

Sébastien Collette

Frédéric Servais

Proceedings of the Computers and Games, 5th International Conference, 2006

Antichains: A New Algorithm for Checking Universality of Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2005

A classification of symbolic transition systems.

[BibT_eX]

[DOI]

Rupak Majumdar

ACM Trans. Comput. Log., 2005

Automatic Rectangular Refinement of Affine Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

On Optimal Timed Strategies.

[BibT_eX]

[DOI]

Thomas Brihaye

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

Systematic Implementation of Real-Time Models.

[BibT_eX]

[DOI]

Martin De Wulf

Proceedings of the FM 2005: Formal Methods, 2005

Expand, Enlarge and Check... Made Efficient.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 17th International Conference, 2005

An Introduction to Hybrid Automata.

[BibT_eX]

Proceedings of the Handbook of Networked and Embedded Control Systems, 2005

2004

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

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2004

Games for Counting Abstractions.

[BibT_eX]

[DOI]

Mathias Samuelides

Proceedings of the Fouth International Workshop on Automated Verification of Critical Systems, 2004

On the omega-language Expressive Power of Extended Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the 11th International Workshop on Expressiveness in Concurrency, 2004

Almost ASAP Semantics: From Timed Models to Timed Implementations.

[BibT_eX]

[DOI]

Martin De Wulf

Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004

Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Robustness and Implementability of Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques, 2004

Model-Checking for Weighted Timed Automata.

[BibT_eX]

[DOI]

Thomas Brihaye

Proceedings of the Formal Techniques, 2004

Model Checking Restricted Sets of Timed Paths.

[BibT_eX]

[DOI]

Nicolas Markey

Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003

Petri Nets with Non-blocking Arcs are Difficult to Analyze.

[BibT_eX]

[DOI]

Proceedings of INFINITY 2003, 2003

Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic.

[BibT_eX]

[DOI]

Emmanuel Dall'Olio

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.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop), 2002

Towards the Automated Verification of Multithreaded Java Programs.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002

A Comparison of Control Problems for Timed and Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems: Computation and Control, 5th International Workshop, 2002

Game Analysis of Abuse-free Contract Signing.

[BibT_eX]

[DOI]

Steve Kremer

Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW-15 2002), 2002

2001

A Game-Based Verification of Non-repudiation and Fair Exchange Protocols.

[BibT_eX]

[DOI]

Steve Kremer

Proceedings of the CONCUR 2001, 2001

Attacking Symbolic State Explosion.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 13th International Conference, 2001

2000

Symbolic Representation of Upward-Closed Sets.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

Abstract Interpretation of Game Properties.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 7th International Symposium, 2000

Robust Undecidability of Timed and Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems: Computation and Control, Third International Workshop, 2000

1999

Logics, Automata and Classical Theories for Deciding Real Time

[BibT_eX]

[DOI]

PhD thesis, 1999

The Logic of Event Clocks - Decidability, Complexity and Expressiveness.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1999

The Logic of "Initially" and "Next": Complete Axiomatization and Complexity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Model-Generation of a Fictitious Clock Real-Time Logic Using Sharing Trees.

[BibT_eX]

[DOI]

Laurent Ferier

Proceedings of the First International Workshop on Symbolic Model Checking, 1999

1998

The Regular Real-Time Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Axioms for Real-Time Logics.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997

Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1997

State Clock Logic: A Decidable Real-Time Logic.

[BibT_eX]

[DOI]