Patricia Bouyer

Proceedings of the 26th International Symposium on Temporal Representation and Reasoning, 2019

Nash Equilibria in Games over Graphs Equipped with a Communication Mechanism.

[BibT_eX]

[DOI]

Nathan Thomasset

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Concurrent Parameterized Games.

[BibT_eX]

[DOI]

Nathalie Bertrand

Anirban Majumdar

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Identifiers in Registers - Describing Network Algorithms with Logic.

[BibT_eX]

[DOI]

Benedikt Bollig

Fabian Reiter

Proceedings of the Foundations of Software Science and Computation Structures, 2019

A Note on Game Theory and Verification.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2019

2018

Model Checking Real-Time Systems.

[BibT_eX]

[DOI]

Uli Fahrenberg

Joël Ouaknine

James Worrell

Proceedings of the Handbook of Model Checking., 2018

When are stochastic transition systems tameable?

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2018

Multi-weighted Markov Decision Processes with Reachability Objectives.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Average-energy games.

[BibT_eX]

[DOI]

Acta Informatica, 2018

Efficient Timed Diagnosis Using Automata with Timed Domains.

[BibT_eX]

[DOI]

Samy Jaziri

Proceedings of the Runtime Verification - 18th International Conference, 2018

Games on Graphs with a Public Signal Monitoring.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2018

Finite Bisimulations for Dynamical Systems with Overlapping Trajectories.

[BibT_eX]

[DOI]

Béatrice Bérard

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017

Timed-automata abstraction of switched dynamical systems using control invariants.

[BibT_eX]

[DOI]

Philipp Schlehuber-Caissier

Nicolas Perrin

Real Time Syst., 2017

Nash equilibria in symmetric graph games with partial observation.

[BibT_eX]

[DOI]

Steen Vester

Inf. Comput., 2017

Courcelle's Theorem Made Dynamic.

[BibT_eX]

[DOI]

Patricia Bouyer-Decitre

CoRR, 2017

Dynamic Complexity of the Dyck Reachability.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2017

Bounding Average-Energy Games.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2017

On the Determinization of Timed Systems.

[BibT_eX]

[DOI]

Samy Jaziri

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

Unbounded Product-Form Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Concurrency Theory, 2017

Timed Temporal Logics.

[BibT_eX]

[DOI]

Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016

On the semantics of Strategy Logic.

[BibT_eX]

[DOI]

Patrick Gardy

Inf. Process. Lett., 2016

Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games.

[BibT_eX]

[DOI]

Daniel Stan

Proceedings of the Seventh International Symposium on Games, 2016

Dynamic Complexity of Parity Games with Bounded Tree-Width.

[BibT_eX]

[DOI]

CoRR, 2016

Optimal Reachability in Weighted Timed Automata and Games.

[BibT_eX]

[DOI]

Patricia Bouyer-Decitre

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Stochastic Timed Games Revisited.

[BibT_eX]

[DOI]

S. Akshay

Shankara Narayanan Krishna

Lakshmi Manasa

Ashutosh Trivedi

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Reachability in Networks of Register Protocols under Stochastic Schedulers.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Analysing Decisive Stochastic Processes.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Compositional Design of Stochastic Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2016

Symbolic Optimal Reachability in Weighted Timed Automata.

[BibT_eX]

[DOI]

Maximilien Colange

Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015

Robust reachability in timed automata and games: A game-based approach.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Permissive strategies in timed automata and games.

[BibT_eX]

[DOI]

Erwin Fang

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2015

Average-energy games (full version).

[BibT_eX]

[DOI]

CoRR, 2015

Pure Nash Equilibria in Concurrent Deterministic Games.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2015

On the optimal reachability problem in weighted timed automata and games.

[BibT_eX]

Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

Weighted Strategy Logic with Boolean Goals Over One-Counter Games.

[BibT_eX]

[DOI]

Patrick Gardy

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels.

[BibT_eX]

[DOI]

Philipp Schlehuber-Caissier

Nicolas Perrin

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

On the Value Problem in Weighted Timed Games.

[BibT_eX]

[DOI]

Samy Jaziri

Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014

Lower-bound-constrained runs in weighted timed automata.

[BibT_eX]

[DOI]

Kim G. Larsen

Perform. Evaluation, 2014

Shrinking timed automata.

[BibT_eX]

[DOI]

Inf. Comput., 2014

Nash Equilibria in Symmetric Games with Partial Observation.

[BibT_eX]

[DOI]

Steen Vester

Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

Stochastic Timed Automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

Mixed Nash Equilibria in Concurrent Terminal-Reward Games.

[BibT_eX]

[DOI]

Daniel Stan

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Averaging in LTL.

[BibT_eX]

[DOI]

Raj Mohan Matteplackel

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Quantitative Verification of Weighted Kripke Structures.

[BibT_eX]

[DOI]

Patrick Gardy

Proceedings of the Automated Technology for Verification and Analysis, 2014

2013

Robustness in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 7th International Workshop, 2013

Robust Weighted Timed Automata and Games.

[BibT_eX]

[DOI]

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

Robust Controller Synthesis in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012

On termination and invariance for faulty channel machines.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2012

Almost-Sure Model-Checking of Reactive Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

Robust Reachability in Timed Automata: A Game-Based Approach.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Concurrent Games with Ordered Objectives.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011

Timed Modal Logics for Real-Time Systems - Specification, Verification and Control.

[BibT_eX]

[DOI]

François Laroussinie

J. Log. Lang. Inf., 2011

Quantitative analysis of real-time systems using priced timed automata.

[BibT_eX]

[DOI]

Commun. ACM, 2011

Emptiness and Universality Problems in Timed Automata with Positive Frequency.

[BibT_eX]

[DOI]

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

Nash Equilibria in Concurrent Games with Büchi Objectives.

[BibT_eX]

[DOI]

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

Robust Model-Checking of Timed Automata via Pumping in Channel Machines.

[BibT_eX]

[DOI]

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

Timed Automata Can Always Be Made Implementable.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2011

2010

On the expressiveness of TPTL and MTL.

[BibT_eX]

[DOI]

Inf. Comput., 2010

O-Minimal Hybrid Reachability Games

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

Timed automata with observers under energy constraints.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, 2010

Computing Rational Radical Sums in Uniform TC^0.

[BibT_eX]

[DOI]

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

Computing Equilibria in Two-Player Timed Games <i>via</i> Turn-Based Finite Games.

[BibT_eX]

[DOI]

Romain Brenguier

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

Nash Equilibria for Reachability Objectives in Multi-player Timed Games.

[BibT_eX]

[DOI]

Romain Brenguier

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009

Undecidability Results for Timed Automata with Silent Transitions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Weighted o-minimal hybrid systems.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2009

Reachability in Stochastic Timed Games.

[BibT_eX]

[DOI]

Vojtech Forejt

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

When Are Timed Automata Determinizable?

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Measuring Permissivity in Finite Games.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

Model Checking One-Clock Priced Timed Automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

Timed Petri nets and timed automata: On the discriminating power of zeno sequences.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Optimal infinite scheduling for multi-priced timed automata.

[BibT_eX]

[DOI]

Ed Brinksma

Formal Methods Syst. Des., 2008

On Termination for Faulty Channel Machines.

[BibT_eX]

[DOI]

Proceedings of the STACS 2008, 2008

Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

On Expressiveness and Complexity in Real-Time Model Checking.

[BibT_eX]

[DOI]

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

Robust Analysis of Timed Automata via Channel Machines.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2008

Infinite Runs in Weighted Timed Automata with Energy Constraints.

[BibT_eX]

[DOI]

Ulrich Fahrenberg

Jirí Srba

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

Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets.

[BibT_eX]

[DOI]

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

2007

On the optimal reachability problem of weighted timed automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2007

Model-checking Timed Temporal Logics.

[BibT_eX]

[DOI]

Proceedings of the 5th Workshop on Methods for Modalities, 2007

The Cost of Punctuality.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

Probabilistic and Topological Semantics for Timed Automata.

[BibT_eX]

[DOI]

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

Costs Are Expensive!

[BibT_eX]

[DOI]

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

2006

Lower and upper bounds in zone-based abstractions of timed automata.

[BibT_eX]

[DOI]

Gerd Behrmann

Radek Pelánek

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

Improved undecidability results on weighted timed automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Weighted Timed Automata: Model-Checking and Games.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, 2006

On the Control of Timed and Hybrid Systems.

[BibT_eX]

Bull. EATCS, 2006

Control in o-minimal Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Robust Model-Checking of Linear-Time Properties in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Almost Optimal Strategies in One Clock Priced Timed Games.

[BibT_eX]

[DOI]

Jacob Illum Rasmussen

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

Controller Synthesis for MTL Specifications.

[BibT_eX]

[DOI]

Laura Bozzelli

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Timed Temporal Logics for Abstracting Transient States.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2006

Timed Unfoldings for Networks of Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2006

Extended Timed Automata and Time Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 2006

2005

On Conciseness of Extensions of Timed Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

Fault Diagnosis Using Timed Automata.

[BibT_eX]

[DOI]

Deepak D'Souza

Proceedings of the Foundations of Software Science and Computational Structures, 2005

Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems.

[BibT_eX]

[DOI]

François Laroussinie

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

A New Modality for Almost Everywhere Properties in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Modal Logics for Timed Control.

[BibT_eX]

[DOI]

François Laroussinie

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004

Updatable timed automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Forward Analysis of Updatable Timed Automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2004

Synthesis of Optimal Strategies Using HyTech.

[BibT_eX]

[DOI]

Emmanuel Fleury

Proceedings of the Workshop on Games in Design and Verification, 2004

Staying Alive as Cheaply as Possible.

[BibT_eX]

[DOI]

Ed Brinksma

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

Optimal Strategies in Priced Timed Game Automata.

[BibT_eX]

[DOI]

Emmanuel Fleury

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

2003

The power of reachability testing for timed automata.

[BibT_eX]

[DOI]

Luca Aceto

Augusto Burgueño

Theor. Comput. Sci., 2003

An algebraic approach to data languages and timed languages.

[BibT_eX]

[DOI]

Denis Thérien

Inf. Comput., 2003

Static Guard Analysis in Timed Automata Verification.

[BibT_eX]

[DOI]

Gerd Behrmann

Emmanuel Fleury

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

Untameable Timed Automata!

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Timed Control with Partial Observability.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002

A Kleene/Büchi-like Theorem for Clock Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

A logical characterization of data languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

2001

An Algebraic Characterization of Data and Timed Languages.

[BibT_eX]

[DOI]

Denis Thérien

Proceedings of the CONCUR 2001, 2001

2000

Expressiveness of Updatable Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Are Timed Automata Updatable?

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999

Decomposition and Composition of Timed Automata.

[BibT_eX]

[DOI]