Pierre-Alain Reynier

CoRR, 2024

2023

Optimal controller synthesis for timed systems.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2023

[BibT_eX]

[DOI]

Yahia Idriss Benalioua

Nathan Lhote

CoRR, 2023

2022

Computability of Data-Word Transductions over Different Data Domains.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2022

A Robust Class of Languages of 2-Nested Words.

[BibT_eX]

[DOI]

Séverine Fratani

Guillaume Maurras

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Weighted Automata and Expressions over Pre-Rational Monoids.

[BibT_eX]

[DOI]

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

Decidability of One-Clock Weighted Timed Games with Arbitrary Weights.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

Synthesis of Data Word Transducers.

[BibT_eX]

[DOI]

Léo Exibard

Log. Methods Comput. Sci., 2021

Copyful Streaming String Transducers.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

Optimal and robust controller synthesis using energy timed automata with uncertainty.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2021

Playing Stochastically in Weighted Timed Games to Emulate Memory.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

From Two-Way Transducers to Regular Function Expressions.

[BibT_eX]

[DOI]

Nicolas Baudru

Int. J. Found. Comput. Sci., 2020

Reaching Your Goal Optimally by Playing at Random.

[BibT_eX]

[DOI]

CoRR, 2020

On Computability of Data Word Functions Defined by Transducers.

[BibT_eX]

[DOI]

Léo Exibard

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

Reaching Your Goal Optimally by Playing at Random with No Memory.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Streamability of nested word transductions.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2019

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

[BibT_eX]

[DOI]

Frédéric Servais

Proceedings of the Reachability Problems - 13th International Conference, 2019

Sequentiality of String-to-Context Transducers.

[BibT_eX]

[DOI]

Didier Villevalois

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach.

[BibT_eX]

[DOI]

Ocan Sankur

Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018

Visibly pushdown transducers.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Aperiodic String Transducers.

[BibT_eX]

[DOI]

Luc Dartois

Ismaël Jecker

Int. J. Found. Comput. Sci., 2018

Decision problems of tree transducers with origin.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Symbolic Approximation of Weighted Timed Games.

[BibT_eX]

[DOI]

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

2017

Degree of Sequentiality of Weighted Automata.

[BibT_eX]

[DOI]

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

Optimal Reachability in Divergent Weighted Timed Games.

[BibT_eX]

[DOI]

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

2016

Transducers, logic and algebra for functions of finite words.

[BibT_eX]

[DOI]

ACM SIGLOG News, 2016

Visibly Pushdown Transducers with Well-Nested Outputs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

Robustness of Time Petri Nets under Guard Enlargement.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

A Generalised Twinning Property for Minimisation of Cost Register Automata.

[BibT_eX]

[DOI]

Laure Daviaud

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Two-Way Visibly Pushdown Automata and Transducers.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

Trimming visibly pushdown automata.

[BibT_eX]

[DOI]

Mathieu Caralp

Theor. Comput. Sci., 2015

Aperiodic Transducers.

[BibT_eX]

[DOI]

Luc Dartois

CoRR, 2015

2014

On Streaming String Transducers and HDT0L Systems.

[BibT_eX]

[DOI]

CoRR, 2014

Probabilistic Robust Timed Games.

[BibT_eX]

[DOI]

Youssouf Oualhadj

Ocan Sankur

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

2013

On characteristic formulae for Event-Recording Automata.

[BibT_eX]

[DOI]

Omer Landry Nguena-Timo

RAIRO Theor. Informatics Appl., 2013

Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning.

[BibT_eX]

[DOI]

Frédéric Servais

Fundam. Informaticae, 2013

Expressiveness of Visibly Pushdown Transducers.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, 2013

From Two-Way to One-Way Finite State Transducers.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Robust Controller Synthesis in Timed Automata.

[BibT_eX]

[DOI]

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

2012

Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness.

[BibT_eX]

[DOI]

Mathieu Caralp

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

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

[BibT_eX]

[DOI]

Peter E. Bulychev

Franck Cassez

Alexandre David

Kim Guldstrand Larsen

Jean-François Raskin

Proceedings of the Automated Technology for Verification and Analysis, 2012

2011

Quantitative Robustness Analysis of Flat Timed Automata.

[BibT_eX]

[DOI]

Rémi Jaubert

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

A Hierarchical Approach for the Synthesis of Stabilizing Controllers for Hybrid Systems.

[BibT_eX]

[DOI]

Janusz Malinowski

Peter Niebert

Proceedings of the Automated Technology for Verification and Analysis, 2011

2010

On Functionality of Visibly Pushdown Transducers

[BibT_eX]

[DOI]

CoRR, 2010

Properties of Visibly Pushdown Transducers.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Undecidability Results for Timed Automata with Silent Transitions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

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

[BibT_eX]

[DOI]

Franck Cassez

Jan Jakob Jessen

Kim Guldstrand Larsen

Jean-François Raskin

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

Weak Time Petri Nets Strike Back!.

[BibT_eX]

[DOI]

Arnaud Sangnier

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

2008

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

[BibT_eX]

[DOI]

Inf. Comput., 2008

Robust Analysis of Timed Automata via Channel Machines.

[BibT_eX]

[DOI]

Nicolas Markey

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

2006

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

[BibT_eX]

[DOI]

Nicolas Markey

Proceedings of the LATIN 2006: Theoretical Informatics, 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

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

[BibT_eX]

[DOI]

François Laroussinie