Publications

2024

Théodore Lopez, Benjamin Monmege, and Jean-Marc Talbot. 2024. Regular D-length: A tool for improved prefix-stable forward Ramsey factorisations. Information Processing Letters 187: 106497. DOI-link PDF-link

@article{lopez:hal-04562306,
  title = {{Regular ${D}$-length: A tool for improved prefix-stable forward Ramsey factorisations}},
  author = {Lopez, Th{\'e}odore and Monmege, Benjamin and Talbot, Jean-Marc},
  url = {https://hal.science/hal-04562306},
  journal = {{Information Processing Letters}},
  publisher = {{Elsevier}},
  volume = {187},
  pages = {106497},
  year = {2024},
  doi = {10.1016/j.ipl.2024.106497},
  keywords = {Ramsey factorisation ; Green's relations ; Fast infix query evaluation},
  pdf = {https://hal.science/hal-04562306/file/note-IPL.pdf},
  hal_id = {hal-04562306},
  hal_version = {v1}
}

Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer, et al. 2024. Games on Graphs. . To be published by Cambridge University Press in 2024. DOI-link PDF-link

@book{fijalkow:hal-04273394,
  title = {{Games on Graphs}},
  author = {Fijalkow, Nathana{\"e}l and Bertrand, Nathalie and Bouyer, Patricia and Brenguier, Romain and Carayol, Arnaud and Fearnley, John and Gimbert, Hugo and Horn, Florian and Ibsen-Jensen, Rasmus and Markey, Nicolas and Monmege, Benjamin and Novotny, Petr and Randour, Mickael and Sankur, Ocan and Schmitz, Sylvain and Serre, Olivier and Skomra, Mateusz},
  url = {https://hal.science/hal-04273394},
  note = {To be published by Cambridge University Press in 2024},
  hal_local_reference = {Rapport LAAS n{\textdegree} 23450},
  pages = {1-491},
  year = {2024},
  doi = {10.48550/arXiv.2305.10546},
  keywords = {Computer Science and Game Theory (cs.GT) ; Formal Languages and Automata Theory (cs.FL) ; Logic in Computer Science (cs.LO)},
  pdf = {https://hal.science/hal-04273394/file/2305.10546.pdf},
  hal_id = {hal-04273394},
  hal_version = {v1}
}

2023

Benjamin Monmege. 2023. Les jeux à la rescousse de la vérification. Interstices. PDF-link

@article{monmege:hal-04230642,
  title = {{Les jeux {\`a} la rescousse de la v{\'e}rification}},
  author = {Monmege, Benjamin},
  url = {https://hal.science/hal-04230642},
  journal = {{Interstices}},
  publisher = {{INRIA}},
  year = {2023},
  keywords = {Logiciel ; Theorie des jeux ; v{\'e}rification programme ; suret{\'e} logiciel},
  pdf = {https://hal.science/hal-04230642/file/Les%20jeux%20%C3%A0%20la%20rescousse%20de%20la%20v%C3%A9rification%20-%20Interstices%20-%20Interstices.pdf},
  hal_id = {hal-04230642},
  hal_version = {v1}
}

Damien Busatto-Gaston, Benjamin Monmege, and Pierre-Alain Reynier. 2023. Optimal controller synthesis for timed systems. Logical Methods in Computer Science Volume 19, Issue 1. DOI-link PDF-link

@article{busattogaston:hal-04442588,
  title = {{Optimal controller synthesis for timed systems}},
  author = {Busatto-Gaston, Damien and Monmege, Benjamin and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-04442588},
  journal = {{Logical Methods in Computer Science}},
  publisher = {{Logical Methods in Computer Science Association}},
  volume = {Volume 19, Issue 1},
  year = {2023},
  month = mar,
  doi = {10.46298/lmcs-19(1:20)2023},
  keywords = {weighted timed games ; computational game theory ; timed automata ; quantitative constraints},
  pdf = {https://hal.science/hal-04442588/file/2104.12577.pdf},
  hal_id = {hal-04442588},
  hal_version = {v1}
}

Shibashis Guha, Ë L Jecker, Karoliina Lehtinen, Martin Zimmermann, and I Jecker. 2023. A BIT OF NONDETERMINISM MAKES PUSHDOWN AUTOMATA EXPRESSIVE AND SUCCINCT. Logical Methods in Computer Science. PDF-link
```
@article{guha:hal-04281616,
  title = {{A BIT OF NONDETERMINISM MAKES PUSHDOWN AUTOMATA EXPRESSIVE AND SUCCINCT}},
  author = {Guha, Shibashis and Jecker, {\"E} L and Lehtinen, Karoliina and Zimmermann, Martin and Jecker, I},
  url = {https://hal.science/hal-04281616},
  journal = {{Logical Methods in Computer Science}},
  publisher = {{Logical Methods in Computer Science Association}},
  year = {2023},
  pdf = {https://hal.science/hal-04281616/file/GFG_PDA_finite_LMCS%20%285%29.pdf},
  hal_id = {hal-04281616},
  hal_version = {v1}
}
```

Dhruv Nevatia and Benjamin Monmege. 2023. An Automata Theoretic Characterization of Weighted First-Order Logic. International Symposium on Automated Technology for Verification and Analysis, Springer Nature Switzerland, 115–133. DOI-link PDF-link

@inproceedings{nevatia:hal-04281052,
  title = {{An Automata Theoretic Characterization of Weighted First-Order Logic}},
  author = {Nevatia, Dhruv and Monmege, Benjamin},
  url = {https://amu.hal.science/hal-04281052},
  booktitle = {{International Symposium on Automated Technology for Verification and Analysis}},
  address = {Singapore, Singapore},
  publisher = {{Springer Nature Switzerland}},
  series = {Lecture Notes in Computer Science},
  volume = {14215},
  pages = {115-133},
  year = {2023},
  doi = {10.1007/978-3-031-45329-8\_6},
  keywords = {weighted logics ; weighted automata ; aperiodic monoids},
  pdf = {https://amu.hal.science/hal-04281052/file/conf.pdf},
  hal_id = {hal-04281052},
  hal_version = {v1}
}

Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, and Patrick Totzke. 2023. History-deterministic Timed Automata. Retrieved from https://hal.science/hal-04271355. working paper or preprint. PDF-link
```
@unpublished{bose:hal-04271355,
  title = {{History-deterministic Timed Automata}},
  author = {Bose, Sougata and Henzinger, Thomas A. and Lehtinen, Karoliina and Schewe, Sven and Totzke, Patrick},
  url = {https://hal.science/hal-04271355},
  note = {working paper or preprint},
  year = {2023},
  month = nov,
  keywords = {History-determinism ; Good-for-games ; fair simulation ; synthesis ; Timed Automata},
  pdf = {https://hal.science/hal-04271355/file/main%20%281%29.pdf},
  hal_id = {hal-04271355},
  hal_version = {v1}
}
```

Udi Boker and Karoliina Lehtinen. 2023. Token Games and History-Deterministic Quantitative-Automata. Logical Methods in Computer Science Volume19,Issue4. DOI-link PDF-link

@article{boker:hal-04271341,
  title = {{Token Games and History-Deterministic Quantitative-Automata}},
  author = {Boker, Udi and Lehtinen, Karoliina},
  url = {https://hal.science/hal-04271341},
  journal = {{Logical Methods in Computer Science}},
  publisher = {{Logical Methods in Computer Science Association}},
  volume = {Volume19,Issue4},
  year = {2023},
  month = nov,
  doi = {10.46298/lmcs-19(4:8)2023},
  keywords = {Quantitative Automata ; History-determinism ; Token games},
  pdf = {https://hal.science/hal-04271341/file/2110.14308.pdf},
  hal_id = {hal-04271341},
  hal_version = {v1}
}

Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, and Martin Zimmermann. 2023. History-deterministic Parikh Automata. 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. DOI-link PDF-link

@inproceedings{erlich:hal-04222543,
  title = {{History-deterministic Parikh Automata}},
  author = {Erlich, Enzo and Guha, Shibashis and Jecker, Isma{\"e}l and Lehtinen, Karoliina and Zimmermann, Martin},
  url = {https://hal.science/hal-04222543},
  booktitle = {{34th International Conference on Concurrency Theory}},
  address = {Antwerp, Belgium},
  publisher = {{Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik}},
  year = {2023},
  month = sep,
  doi = {10.4230/LIPIcs.CONCUR.2023.31},
  keywords = {Parikh automata ; History-determinism ; Reversal-bounded Counter Machines ; Theory of computation $\rightarrow$ Formal languages and automata theory},
  pdf = {https://hal.science/hal-04222543/file/2209.07745.pdf},
  hal_id = {hal-04222543},
  hal_version = {v1}
}

Udi Boker and Karoliina Lehtinen. 2023. When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism. ACM SIGLOG News 10: 24–51. DOI-link PDF-link

@article{boker:hal-03994548,
  title = {{When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism}},
  author = {Boker, Udi and Lehtinen, Karoliina},
  url = {https://hal.science/hal-03994548},
  journal = {{ACM SIGLOG News}},
  publisher = {{ACM}},
  series = {ACM SIGLOG News},
  volume = {10},
  pages = {24-51},
  year = {2023},
  month = jan,
  doi = {10.1145/3584676.3584682},
  keywords = {history-determinism good-for-games automata nondeterminism ; history-determinism ; good-for-games automata ; nondeterminism},
  pdf = {https://hal.science/hal-03994548/file/main-survey.pdf},
  hal_id = {hal-03994548},
  hal_version = {v1}
}

2022

Clara Bertolissi. 2022. Formal methods applied to access control policy design, verification and enforcement. Retrieved from https://hal.science/tel-03921970. PDF-link

@phdthesis{bertolissi:tel-03921970,
  title = {{Formal methods applied to access control policy design, verification and enforcement}},
  author = {Bertolissi, Clara},
  url = {https://hal.science/tel-03921970},
  school = {{Aix-Marseile Universit{\'e}, France}},
  year = {2022},
  month = nov,
  keywords = {Rewriting Systems ; Logics ; Access control policies and models ; Politiques de contr{\^o}le d'acc{\`e}s ; logique ; r{\'e}{\'e}criture},
  type = {Habilitation {\`a} diriger des recherches},
  pdf = {https://hal.science/tel-03921970/file/VF-manuscrit-apres-correction%20%2810%29.pdf},
  hal_id = {tel-03921970},
  hal_version = {v1}
}

Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, and Martin Zimmermann. 2022. History-deterministic Parikh Automata. Retrieved from https://hal.science/hal-03858319. working paper or preprint. DOI-link PDF-link
```
@unpublished{erlich:hal-03858319,
  title = {{History-deterministic Parikh Automata}},
  author = {Erlich, Enzo and Guha, Shibashis and Jecker, Isma{\"e}l and Lehtinen, Karoliina and Zimmermann, Martin},
  url = {https://hal.science/hal-03858319},
  note = {working paper or preprint},
  year = {2022},
  month = nov,
  doi = {10.48550/arXiv.2209.07745},
  pdf = {https://hal.science/hal-03858319/file/hdparikh_arxiv.pdf},
  hal_id = {hal-03858319},
  hal_version = {v1}
}
```

Sougata Bose, Thomas A Henzinger, Karoliina Lehtinen, Sven Schewe, and Patrick Totzke. 2022. History-Deterministic Timed Automata Are Not Determinizable. 16th International Conference on Reachability Problems 2022, Springer International Publishing, 67–76. DOI-link PDF-link

@inproceedings{bose:hal-03849398,
  title = {{History-Deterministic Timed Automata Are Not Determinizable}},
  author = {Bose, Sougata and Henzinger, Thomas A and Lehtinen, Karoliina and Schewe, Sven and Totzke, Patrick},
  url = {https://hal.science/hal-03849398},
  booktitle = {{16th International Conference on Reachability Problems 2022}},
  address = {KAISERSLAUTERN, Germany},
  publisher = {{Springer International Publishing}},
  series = {Lecture Notes in Computer Science},
  volume = {13608},
  pages = {67-76},
  year = {2022},
  month = oct,
  doi = {10.1007/978-3-031-19135-0\_5},
  pdf = {https://hal.science/hal-03849398/file/BHLST2022.pdf},
  hal_id = {hal-03849398},
  hal_version = {v1}
}

Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, and Martin Zimmermann. 2022. Parikh Automata over Infinite Words. FSTTCS. PDF-link
```
@inproceedings{guha:hal-03857989,
  title = {{Parikh Automata over Infinite Words}},
  author = {Guha, Shibashis and Jecker, Isma{\"e}l and Lehtinen, Karoliina and Zimmermann, Martin},
  url = {https://hal.science/hal-03857989},
  booktitle = {{FSTTCS}},
  address = {Madras, India},
  year = {2022},
  pdf = {https://hal.science/hal-03857989/file/omegaparikh_arxiv.pdf},
  hal_id = {hal-03857989},
  hal_version = {v1}
}
```

Udi Boker and Karoliina Lehtinen. 2022. Token Games and History-Deterministic Quantitative Automata. FoSSaCS, Springer International Publishing, 120–139. DOI-link PDF-link

@inproceedings{boker:hal-03857930,
  title = {{Token Games and History-Deterministic Quantitative Automata}},
  author = {Boker, Udi and Lehtinen, Karoliina},
  url = {https://hal.science/hal-03857930},
  booktitle = {{FoSSaCS}},
  address = {Munich, Germany},
  publisher = {{Springer International Publishing}},
  series = {Lecture Notes in Computer Science},
  volume = {13242},
  pages = {120-139},
  year = {2022},
  doi = {10.1007/978-3-030-99253-8\_7},
  keywords = {Automata ; History-determinism ; Token games ; Synthesis},
  pdf = {https://hal.science/hal-03857930/file/TokensAndHD.pdf},
  hal_id = {hal-03857930},
  hal_version = {v1}
}

Thomas A Henzinger, Karoliina Lehtinen, and Patrick Totzke. 2022. History-Deterministic Timed Automata. CONCUR. DOI-link PDF-link

@inproceedings{henzinger:hal-03849404,
  title = {{History-Deterministic Timed Automata}},
  author = {Henzinger, Thomas A and Lehtinen, Karoliina and Totzke, Patrick},
  url = {https://hal.science/hal-03849404},
  booktitle = {{CONCUR}},
  address = {Warsaw, Poland},
  volume = {243},
  year = {2022},
  doi = {10.4230/LIPIcs.CONCUR.2022.14},
  keywords = {phrases Timed Automata ; History-determinism ; Good-for-games ; fair simulation ; synthesis},
  pdf = {https://hal.science/hal-03849404/file/LIPIcs-CONCUR-2022-14.pdf},
  hal_id = {hal-03849404},
  hal_version = {v1}
}

Antonis Achilleos, Léo Exibard, Adrian Francalanza, Karoliina Lehtinen, and Jasmine Xuereb. 2022. A Synthesis Tool for Optimal Monitors in a Branching-Time Setting. 17th International Federated Conference on Distributed Computing Techniques, DisCoTec 2022, Springer International Publishing, 181–199. DOI-link PDF-link

@inproceedings{achilleos:hal-03849385,
  title = {{A Synthesis Tool for Optimal Monitors in a Branching-Time Setting}},
  author = {Achilleos, Antonis and Exibard, L{\'e}o and Francalanza, Adrian and Lehtinen, Karoliina and Xuereb, Jasmine},
  url = {https://hal.science/hal-03849385},
  booktitle = {{17th International Federated Conference on Distributed Computing Techniques, DisCoTec 2022,}},
  address = {Lucca, Italy},
  publisher = {{Springer International Publishing}},
  series = {Lecture Notes in Computer Science},
  volume = {13271},
  pages = {181 - 199},
  year = {2022},
  month = jun,
  doi = {10.1007/978-3-031-08143-9\_11},
  keywords = {Runtime Verification ; Monitor Synthesis ; Branching-time specifications ; Runtime Verication ; Branching-time specications},
  pdf = {https://hal.science/hal-03849385/file/toolpaper.pdf},
  hal_id = {hal-03849385},
  hal_version = {v1}
}

Udi Boker, Karoliina Lehtinen, and Salomon Sickert. 2022. On the Translation of Automata to Linear Temporal Logic. FOSSACS, Springer International Publishing, 140–160. DOI-link PDF-link

@inproceedings{boker:hal-03849354,
  title = {{On the Translation of Automata to Linear Temporal Logic}},
  author = {Boker, Udi and Lehtinen, Karoliina and Sickert, Salomon},
  url = {https://hal.science/hal-03849354},
  booktitle = {{FOSSACS}},
  address = {Munich, Germany},
  publisher = {{Springer International Publishing}},
  series = {Lecture Notes in Computer Science},
  volume = {13242},
  pages = {140-160},
  year = {2022},
  month = apr,
  doi = {10.1007/978-3-030-99253-8\_8},
  pdf = {https://hal.science/hal-03849354/file/HAL.pdf},
  hal_id = {hal-03849354},
  hal_version = {v1}
}

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, and Benjamin Monmege. 2022. One-Clock Priced Timed Games with Arbitrary Weights. Logical Methods in Computer Science 18, 3: 51. PDF-link

@article{brihaye:hal-02424743,
  title = {{One-Clock Priced Timed Games with Arbitrary Weights}},
  author = {Brihaye, Thomas and Geeraerts, Gilles and Haddad, Axel and Lefaucheux, Engel and Monmege, Benjamin},
  url = {https://hal.science/hal-02424743},
  journal = {{Logical Methods in Computer Science}},
  publisher = {{Logical Methods in Computer Science Association}},
  volume = {18},
  number = {3},
  pages = {51},
  year = {2022},
  month = aug,
  keywords = {Game theory ; Priced timed games ; Real-time systems},
  pdf = {https://hal.science/hal-02424743v2/file/2009.03074.pdf},
  hal_id = {hal-02424743},
  hal_version = {v2}
}

Benjamin Monmege. 2022. Game Theory for Real-Time Synthesis: Decision, Approximation, and Randomness. Retrieved from https://hal.science/tel-03663275. PDF-link

@phdthesis{monmege:tel-03663275,
  title = {{Game Theory for Real-Time Synthesis: Decision, Approximation, and Randomness}},
  author = {Monmege, Benjamin},
  url = {https://hal.science/tel-03663275},
  school = {{Aix-Marseille Universit{\'e}}},
  year = {2022},
  month = apr,
  keywords = {game theory ; timed automaton ; th{\'e}orie des jeux ; automate temporis{\'e}},
  type = {Habilitation {\`a} diriger des recherches},
  pdf = {https://hal.science/tel-03663275/file/HDR.pdf},
  hal_id = {tel-03663275},
  hal_version = {v1}
}

Karoliina Lehtinen, Pawel Parys, Sven Schewe, and Dominik Wojtczak. 2022. A Recursive Approach to Solving Parity Games in Quasipolynomial Time. Logical Methods in Computer Science Volume 18, 1: 8:1–8:18. PDF-link

@article{lehtinen:hal-03320012,
  title = {{A Recursive Approach to Solving Parity Games in Quasipolynomial Time}},
  author = {Lehtinen, Karoliina and Parys, Pawel and Schewe, Sven and Wojtczak, Dominik},
  url = {https://hal.science/hal-03320012},
  journal = {{Logical Methods in Computer Science}},
  publisher = {{Logical Methods in Computer Science Association}},
  volume = {Volume 18},
  number = {1},
  pages = {8:1-8:18},
  year = {2022},
  month = jan,
  pdf = {https://hal.science/hal-03320012/file/2104.09717.pdf},
  hal_id = {hal-03320012},
  hal_version = {v1}
}

Karoliina Lehtinen and Martin Zimmermann. 2022. Good-for-games ω-Pushdown Automata. Logical Methods in Computer Science Volume 18, Issue 1. DOI-link PDF-link

@article{lehtinen:hal-03522789,
  title = {{Good-for-games $\omega$-Pushdown Automata}},
  author = {Lehtinen, Karoliina and Zimmermann, Martin},
  url = {https://hal.science/hal-03522789},
  journal = {{Logical Methods in Computer Science}},
  publisher = {{Logical Methods in Computer Science Association}},
  volume = {Volume 18, Issue 1},
  year = {2022},
  month = jan,
  doi = {10.46298/lmcs-18(1:3)2022},
  pdf = {https://hal.science/hal-03522789/file/2001.04392.pdf},
  hal_id = {hal-03522789},
  hal_version = {v1}
}

Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, and Jean-Marc Talbot. 2022. Weighted Automata and Expressions over Pre-Rational Monoids. 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). DOI-link PDF-link
```
@inproceedings{baudru:hal-03545602,
  title = {{Weighted Automata and Expressions over Pre-Rational Monoids}},
  author = {Baudru, Nicolas and Dando, Louis-Marie and Lhote, Nathan and Monmege, Benjamin and Reynier, Pierre-Alain and Talbot, Jean-Marc},
  url = {https://hal.science/hal-03545602},
  booktitle = {{30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}},
  address = {G{\"o}ttingen, France},
  year = {2022},
  month = feb,
  doi = {10.4230/LIPIcs.CSL.2022.6},
  pdf = {https://hal.science/hal-03545602/file/LIPIcs-CSL-2022-6.pdf},
  hal_id = {hal-03545602},
  hal_version = {v1}
}
```

2021

Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, and Martin Zimmermann. 2021. A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). DOI-link PDF-link

@inproceedings{guha:hal-03320016,
  title = {{A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct}},
  author = {Guha, Shibashis and Jecker, Isma{\"e}l and Lehtinen, Karoliina and Zimmermann, Martin},
  url = {https://hal.science/hal-03320016},
  booktitle = {{46th International Symposium on  Mathematical Foundations of Computer Science (MFCS 2021)}},
  address = {Tallinn, Estonia},
  editor = {Bonchi, Filippo and Puglisi, Simon J.},
  series = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
  volume = {202},
  year = {2021},
  month = aug,
  doi = {10.4230/LIPIcs.MFCS.2021.53},
  pdf = {https://hal.science/hal-03320016/file/2105.02611.pdf},
  hal_id = {hal-03320016},
  hal_version = {v1}
}

Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, and Karoliina Lehtinen. 2021. The Best a Monitor Can Do. 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). PDF-link
```
@inproceedings{aceto:hal-03320006,
  title = {{The Best a Monitor Can Do}},
  author = {Aceto, Luca and Achilleos, Antonis and Francalanza, Adrian and Ing{\'o}lfsd{\'o}ttir, Anna and Lehtinen, Karoliina},
  url = {https://hal.science/hal-03320006},
  booktitle = {{29th EACSL Annual Conference on Computer Science Logic (CSL 2021)}},
  address = {Ljubljana, Slovenia},
  year = {2021},
  month = jan,
  pdf = {https://hal.science/hal-03320006/file/LIPIcs-CSL-2021-7.pdf},
  hal_id = {hal-03320006},
  hal_version = {v1}
}
```
Clara Bertolissi, Maribel Fernandez, and Bhavani Thuraisingham. 2021. Graph-Based Specification of Admin-CBAC Policies. CODASPY ’21: Eleventh ACM Conference on Data and Application Security and Privacy, ACM, 173–184. DOI-link
```
@inproceedings{bertolissi:hal-03592278,
  title = {{Graph-Based Specification of Admin-CBAC Policies}},
  author = {Bertolissi, Clara and Fernandez, Maribel and Thuraisingham, Bhavani},
  url = {https://hal.science/hal-03592278},
  booktitle = {{CODASPY '21: Eleventh ACM Conference on Data and Application Security and Privacy}},
  address = {Virtual Event USA, France},
  publisher = {{ACM}},
  pages = {173-184},
  year = {2021},
  month = apr,
  doi = {10.1145/3422337.3447850},
  hal_id = {hal-03592278},
  hal_version = {v1}
}
```
Emmanuel Filiot and Pierre-Alain Reynier. 2021. Copyful Streaming String Transducers. Fundamenta Informaticae 178, 1-2: 59–76. DOI-link
```
@article{filiot:hal-03559507,
  title = {{Copyful Streaming String Transducers}},
  author = {Filiot, Emmanuel and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-03559507},
  journal = {{Fundamenta Informaticae}},
  publisher = {{Polskie Towarzystwo Matematyczne}},
  volume = {178},
  number = {1-2},
  pages = {59-76},
  year = {2021},
  month = jan,
  doi = {10.3233/FI-2021-1998},
  hal_id = {hal-03559507},
  hal_version = {v1}
}
```
Benjamin Monmege and Markus Bläser. 2021. 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). .
```
@book{monmege:hal-03518289,
  title = {{38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)}},
  author = {Monmege, Benjamin and Bl{\"a}ser, Markus},
  url = {https://hal.science/hal-03518289},
  year = {2021},
  hal_id = {hal-03518289},
  hal_version = {v1}
}
```

Duncan Paul Attard, Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, and Karoliina Lehtinen. 2021. Better Late Than Never or: Verifying Asynchronous Components at Runtime. 41st International Conference on Formal Techniques for Distributed Objects, Components, and Systems, 207–225. DOI-link PDF-link

@inproceedings{attard:hal-03320023,
  title = {{Better Late Than Never or: Verifying Asynchronous Components at Runtime}},
  author = {Attard, Duncan Paul and Aceto, Luca and Achilleos, Antonis and Francalanza, Adrian and Ing{\'o}lfsd{\'o}ttir, Anna and Lehtinen, Karoliina},
  url = {https://hal.science/hal-03320023},
  booktitle = {{41st International Conference on Formal Techniques for Distributed Objects, Components, and Systems}},
  address = {Valletta, Malta},
  pages = {207 - 225},
  year = {2021},
  month = jun,
  doi = {10.1007/978-3-030-78089-0\_14},
  keywords = {Runtime verification ; Instrumentation ; Monitoring},
  pdf = {https://hal.science/hal-03320023/file/paper.pdf},
  hal_id = {hal-03320023},
  hal_version = {v1}
}

Udi Boker and Karoliina Lehtinen. 2021. History Determinism vs. Good for Gameness in Quantitative Automata. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021). DOI-link PDF-link
```
@inproceedings{boker:hal-03455733,
  title = {{History Determinism vs. Good for Gameness in Quantitative Automata}},
  author = {Boker, Udi and Lehtinen, Karoliina},
  url = {https://hal.science/hal-03455733},
  booktitle = {{41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)}},
  address = {Online, India},
  year = {2021},
  month = dec,
  doi = {10.4230/LIPIcs.FSTTCS.2021.38},
  pdf = {https://hal.science/hal-03455733/file/LIPIcs-FSTTCS-2021-38.pdf},
  hal_id = {hal-03455733},
  hal_version = {v1}
}
```

Benjamin Monmege, Julie Parreaux, and Pierre-Alain Reynier. 2021. Playing Stochastically in Weighted Timed Games to Emulate Memory. 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). DOI-link PDF-link

@inproceedings{monmege:hal-03282049,
  title = {{Playing Stochastically in Weighted Timed Games to Emulate Memory}},
  author = {Monmege, Benjamin and Parreaux, Julie and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-03282049},
  booktitle = {{48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}},
  address = {Glasgow (virtual), United Kingdom},
  year = {2021},
  month = jul,
  doi = {10.4230/LIPIcs.ICALP.2021.137},
  keywords = {Formal software verification ; Weighted timed games ; Algorithmic game theory ; Randomisation},
  pdf = {https://hal.science/hal-03282049/file/LIPIcs-ICALP-2021-137.pdf},
  hal_id = {hal-03282049},
  hal_version = {v1}
}

2020

Clara Bertolissi, Maribel Fernández, and Bhavani Thuraisingham. 2020. Admin-CBAC. CODASPY ’20: Tenth ACM Conference on Data and Application Security and Privacy, ACM, 73–84. DOI-link
```
@inproceedings{bertolissi:hal-03592292,
  title = {{Admin-CBAC}},
  author = {Bertolissi, Clara and Fern{\'a}ndez, Maribel and Thuraisingham, Bhavani},
  url = {https://hal.science/hal-03592292},
  booktitle = {{CODASPY '20: Tenth ACM Conference on Data and Application Security and Privacy}},
  address = {New Orleans LA USA, France},
  publisher = {{ACM}},
  pages = {73-84},
  year = {2020},
  month = mar,
  doi = {10.1145/3374664.3375725},
  hal_id = {hal-03592292},
  hal_version = {v1}
}
```
Nicolas Baudru and Pierre-Alain Reynier. 2020. From Two-Way Transducers to Regular Function Expressions. International Journal of Foundations of Computer Science 31, 06: 843–873. DOI-link
```
@article{baudru:hal-03559506,
  title = {{From Two-Way Transducers to Regular Function Expressions}},
  author = {Baudru, Nicolas and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-03559506},
  journal = {{International Journal of Foundations of Computer Science}},
  publisher = {{World Scientific Publishing}},
  volume = {31},
  number = {06},
  pages = {843-873},
  year = {2020},
  month = sep,
  doi = {10.1142/S0129054120410087},
  hal_id = {hal-03559506},
  hal_version = {v1}
}
```

Benjamin Monmege, Julie Parreaux, and Pierre-Alain Reynier. 2020. Reaching Your Goal Optimally by Playing at Random with No Memory. 31st International Conference on Concurrency Theory (CONCUR 2020). DOI-link PDF-link

@inproceedings{monmege:hal-02925540,
  title = {{Reaching Your Goal Optimally by Playing at Random with No Memory}},
  author = {Monmege, Benjamin and Parreaux, Julie and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-02925540},
  booktitle = {{31st International Conference on Concurrency Theory (CONCUR 2020)}},
  address = {Vienna, Austria},
  year = {2020},
  doi = {10.4230/LIPIcs.CONCUR.2020.26},
  keywords = {Weighted games ; Algorithmic game theory ; Randomisation},
  pdf = {https://hal.science/hal-02925540/file/LIPIcs-CONCUR-2020-26.pdf},
  hal_id = {hal-02925540},
  hal_version = {v1}
}

Nicolas Baudru and Severine Fratani. 2020. On exteriority notions in book embeddings and treewidth. Discrete Mathematics 343, 4: 111703. DOI-link PDF-link

@article{baudru:hal-02401981,
  title = {{On exteriority notions in book embeddings and treewidth}},
  author = {Baudru, Nicolas and Fratani, Severine},
  url = {https://amu.hal.science/hal-02401981},
  journal = {{Discrete Mathematics}},
  publisher = {{Elsevier}},
  volume = {343},
  number = {4},
  pages = {111703},
  year = {2020},
  month = apr,
  doi = {10.1016/j.disc.2019.111703},
  keywords = {Graph theory ; Book embedding ; Exteriority ; Outerplanar-like measure ; Treewidth},
  pdf = {https://amu.hal.science/hal-02401981/file/HAL_treewidthOfBookEmbbeding.pdf},
  hal_id = {hal-02401981},
  hal_version = {v1}
}

2019

Severine Fratani and El Makki Voundy. 2019. Epsilon-reducible context-free languages and characterizations of indexed languages. Information and Computation 269: 104444. DOI-link PDF-link

@article{fratani:hal-02413392,
  title = {{Epsilon-reducible context-free languages and characterizations of indexed languages}},
  author = {Fratani, Severine and Voundy, El Makki},
  url = {https://hal.science/hal-02413392},
  journal = {{Information and Computation}},
  publisher = {{Elsevier}},
  volume = {269},
  pages = {104444},
  year = {2019},
  doi = {10.1016/j.ic.2019.104444},
  keywords = {context-free grammars ; homomorphic characterizations ; transductions ; indexed languages},
  pdf = {https://hal.science/hal-02413392/file/lata_long.pdf},
  hal_id = {hal-02413392},
  hal_version = {v1}
}

Pierre-Alain Reynier and Frédéric Servais. 2019. On the computation of the minimal coverability set of Petri nets. 13th International Conference on Reachability Problems. DOI-link PDF-link
```
@inproceedings{reynier:hal-02442611,
  title = {{On the computation of the minimal coverability set of Petri nets}},
  author = {Reynier, Pierre-Alain and Servais, Fr{\'e}d{\'e}ric},
  url = {https://hal.science/hal-02442611},
  booktitle = {{13th International Conference on Reachability Problems}},
  address = {Bruxelles, Belgium},
  year = {2019},
  month = sep,
  doi = {10.1007/978-3-030-30806-3\_13},
  pdf = {https://hal.science/hal-02442611/file/petri.pdf},
  hal_id = {hal-02442611},
  hal_version = {v1}
}
```
Clara Bertolissi, Jerry den Hartog, and Nicola Zannone. 2019. Using Provenance for Secure Data Fusion in Cooperative Systems. the 24th ACM Symposium SACMAT, ACM Press, 185–194. DOI-link
```
@inproceedings{bertolissi:hal-02440487,
  title = {{Using Provenance for Secure Data Fusion in Cooperative Systems}},
  author = {Bertolissi, Clara and den Hartog, Jerry and Zannone, Nicola},
  url = {https://hal.science/hal-02440487},
  booktitle = {{the 24th ACM Symposium SACMAT}},
  address = {Toronto ON, France},
  publisher = {{ACM Press}},
  pages = {185-194},
  year = {2019},
  month = jun,
  doi = {10.1145/3322431.3325100},
  hal_id = {hal-02440487},
  hal_version = {v1}
}
```

Léo Exibard, Emmanuel Filiot, and Pierre-Alain Reynier. 2019. Synthesis of Data Word Transducers. CONCUR 2019. DOI-link PDF-link

@inproceedings{exibard:hal-02439660,
  title = {{Synthesis of Data Word Transducers}},
  author = {Exibard, L{\'e}o and Filiot, Emmanuel and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-02439660},
  booktitle = {{CONCUR 2019}},
  address = {Amsterdam, Netherlands},
  year = {2019},
  month = aug,
  doi = {10.4230/LIPIcs.CONCUR.2019.24},
  keywords = {Register Automata ; Synthesis ; Data words ; Transducers},
  pdf = {https://hal.science/hal-02439660/file/LIPIcs-CONCUR-2019-24.pdf},
  hal_id = {hal-02439660},
  hal_version = {v1}
}

Damien Busatto-Gaston. 2019. Symbolic controller synthesis for timed systems: robustness and optimality. Retrieved from https://hal.science/tel-02436831. PDF-link

@phdthesis{busattogaston:tel-02436831,
  title = {{Symbolic controller synthesis for timed systems: robustness and optimality}},
  author = {Busatto-Gaston, Damien},
  url = {https://hal.science/tel-02436831},
  school = {{Aix Marseille Universit{\'e}}},
  year = {2019},
  month = dec,
  keywords = {Timed automata ; Synthesis ; Robustness ; Weighted games ; Jeux pond{\'e}r{\'e} ; Synth{\`e}se ; Robustesse ; Automates temporis{\'e}s},
  type = {Theses},
  pdf = {https://hal.science/tel-02436831/file/theseBusattoDamien_depot_final.pdf},
  hal_id = {tel-02436831},
  hal_version = {v1}
}

Didier Villevalois. 2019. Simplifying Transducers using Sequentiality. Retrieved from https://hal.science/tel-02436759. PDF-link

@phdthesis{villevalois:tel-02436759,
  title = {{Simplifying Transducers using Sequentiality}},
  author = {Villevalois, Didier},
  url = {https://hal.science/tel-02436759},
  school = {{Aix-Marseille Universit{\'e} (AMU)}},
  year = {2019},
  month = nov,
  keywords = {Minimisation ; sequentiality ; transducers ; twinning property ; Minimisation ; s{\'e}quantialit{\'e} ; transducteurs ; propri{\'e}t{\'e} de jumelage},
  type = {Theses},
  pdf = {https://hal.science/tel-02436759/file/these_Didier_final.pdf},
  hal_id = {tel-02436759},
  hal_version = {v1}
}

Pierre-Alain Reynier and Didier Villevalois. 2019. Sequentiality of String-to-Context Transducers. 46th International Colloquium on Automata, Languages, and Programming. DOI-link PDF-link

@inproceedings{reynier:hal-02436585,
  title = {{Sequentiality of String-to-Context Transducers}},
  author = {Reynier, Pierre-Alain and Villevalois, Didier},
  url = {https://hal.science/hal-02436585},
  booktitle = {{46th International Colloquium on Automata, Languages, and Programming}},
  address = {Patras, Greece},
  year = {2019},
  month = jul,
  doi = {10.4230/LIPIcs.ICALP.2019.123},
  keywords = {Transducers ; Sequentiality ; Twinning Property ; Two-Way Transducers},
  pdf = {https://hal.science/hal-02436585/file/main.pdf},
  hal_id = {hal-02436585},
  hal_version = {v1}
}

Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, and Bruno Quoitin. 2019. Dynamics on Games: Simulation-Based Techniques and Applications to Routing. 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). DOI-link PDF-link

@inproceedings{brihaye:hal-02414987,
  title = {{Dynamics on Games: Simulation-Based Techniques and Applications to Routing}},
  author = {Brihaye, Thomas and Geeraerts, Gilles and Hallet, Marion and Monmege, Benjamin and Quoitin, Bruno},
  url = {https://hal.science/hal-02414987},
  booktitle = {{39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)}},
  address = {Bombay, India},
  year = {2019},
  month = dec,
  doi = {10.4230/LIPIcs.FSTTCS.2019.35},
  keywords = {games on graphs ; dynamics ; simulation ; network},
  pdf = {https://hal.science/hal-02414987/file/LIPIcs-FSTTCS-2019-35.pdf},
  hal_id = {hal-02414987},
  hal_version = {v1}
}

Théodore Lopez, Benjamin Monmege, and Jean-Marc Talbot. 2019. Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. 44th International Symposium on Mathematical Foundations of Computer Science. DOI-link PDF-link

@inproceedings{lopez:hal-02268107,
  title = {{Determinisation of Finitely-Ambiguous Copyless Cost Register Automata}},
  author = {Lopez, Th{\'e}odore and Monmege, Benjamin and Talbot, Jean-Marc},
  url = {https://hal.science/hal-02268107},
  booktitle = {{44th International Symposium on Mathematical Foundations of Computer Science}},
  address = {Aachen, Germany},
  series = {44th International Symposium on Mathematical Foundations of Computer Science},
  year = {2019},
  month = aug,
  doi = {10.4230/LIPIcs.MFCS.2019.75},
  keywords = {Cost-register automata ; Look-ahead removal ; Unambiguity ; Determinisation},
  pdf = {https://hal.science/hal-02268107/file/LIPIcs-MFCS-2019-75.pdf},
  hal_id = {hal-02268107},
  hal_version = {v1}
}

Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, and Ocan Sankur. 2019. Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. CAV 2019 - 31st International Conference on Computer Aided Verification, Springer, 572–590. DOI-link PDF-link

@inproceedings{busattogaston:hal-02264083,
  title = {{Robust Controller Synthesis in Timed B{\"u}chi Automata: A Symbolic Approach}},
  author = {Busatto-Gaston, Damien and Monmege, Benjamin and Reynier, Pierre-Alain and Sankur, Ocan},
  url = {https://hal.science/hal-02264083},
  booktitle = {{CAV 2019 - 31st International Conference on Computer Aided Verification}},
  address = {New-York, United States},
  publisher = {{Springer}},
  series = {LNCS},
  pages = {572-590},
  year = {2019},
  month = jul,
  doi = {10.1007/978-3-030-25540-4\_33},
  pdf = {https://hal.science/hal-02264083/file/paper.pdf},
  hal_id = {hal-02264083},
  hal_version = {v1}
}

Luc Dartois, Emmanuel Filiot, and Jean-Marc Talbot. 2019. Two-Way Parikh Automata with a Visibly Pushdown Stack. FOSSACS 2019, Springer, 189–206. DOI-link PDF-link

@inproceedings{dartois:hal-02162279,
  title = {{Two-Way Parikh Automata with a Visibly Pushdown Stack}},
  author = {Dartois, Luc and Filiot, Emmanuel and Talbot, Jean-Marc},
  url = {https://hal.science/hal-02162279},
  booktitle = {{FOSSACS 2019}},
  address = {Pragues, Czech Republic},
  editor = {Boja{\'n}czyk M., Simpson A.},
  publisher = {{Springer}},
  series = {Lecture Notes in Computer Science},
  volume = {11425},
  pages = {189-206},
  year = {2019},
  month = apr,
  doi = {10.1007/978-3-030-17127-8\_11},
  pdf = {https://hal.science/hal-02162279/file/Dartois2019_Chapter_Two-WayParikhAutomataWithAVisi.pdf},
  hal_id = {hal-02162279},
  hal_version = {v1}
}

Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, and Frédéric Servais. 2019. Streamability of nested word transductions. Logical Methods in Computer Science.
```
@article{filiot:hal-02103898,
  title = {{Streamability of nested word transductions}},
  author = {Filiot, Emmanuel and Gauwin, Olivier and Reynier, Pierre-Alain and Servais, Fr{\'e}d{\'e}ric},
  url = {https://hal.science/hal-02103898},
  journal = {{Logical Methods in Computer Science}},
  publisher = {{Logical Methods in Computer Science Association}},
  year = {2019},
  month = apr,
  hal_id = {hal-02103898},
  hal_version = {v1}
}
```

2018

Léo Exibard, Emmanuel Filiot, and Ismaël Jecker. 2018. The Complexity of Transducer Synthesis from Multi-Sequential Specifications. MFCS 2018. DOI-link PDF-link

@inproceedings{exibard:hal-02134273,
  title = {{The Complexity of Transducer Synthesis from Multi-Sequential Specifications}},
  author = {Exibard, L{\'e}o and Filiot, Emmanuel and Jecker, Isma{\"e}l},
  url = {https://hal.science/hal-02134273},
  booktitle = {{MFCS 2018}},
  address = {Liverpool, United Kingdom},
  series = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018).},
  year = {2018},
  month = aug,
  doi = {10.4230/LIPIcs.MFCS.2018.46},
  keywords = {Transducers ; Synthesis ; Multi-Sequentiality},
  pdf = {https://hal.science/hal-02134273/file/MultiSequentialMFCS.pdf},
  hal_id = {hal-02134273},
  hal_version = {v1}
}

Igor Potapov and Pierre-Alain Reynier. 2018. Reachability Problems. Springer.
```
@book{potapov:hal-02126180,
  title = {{Reachability Problems}},
  author = {Potapov, Igor and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-02126180},
  publisher = {{Springer}},
  series = {Theoretical Computer Science and General Issues},
  volume = {11123},
  number = {1},
  year = {2018},
  hal_id = {hal-02126180},
  hal_version = {v1}
}
```

Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, and Jean-Marc Talbot. 2018. Visibly pushdown transducers. Journal of Computer and System Sciences 97: 147–181. DOI-link PDF-link

@article{filiot:hal-02093318,
  title = {{Visibly pushdown transducers}},
  author = {Filiot, Emmanuel and Raskin, Jean-Fran{\c c}ois and Reynier, Pierre-Alain and Servais, Fr{\'e}d{\'e}ric and Talbot, Jean-Marc},
  url = {https://hal.science/hal-02093318},
  journal = {{Journal of Computer and System Sciences}},
  publisher = {{Elsevier}},
  volume = {97},
  pages = {147-181},
  year = {2018},
  doi = {10.1016/j.jcss.2018.05.002},
  keywords = {Visbily Pushdown Automata ; Transducers ; Functionality},
  pdf = {https://hal.science/hal-02093318/file/jcss18.pdf},
  hal_id = {hal-02093318},
  hal_version = {v1}
}

Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, and Jean-Marc Talbot. 2018. Decision problems of tree transducers with origin. Information and Computation 261: 311–335. DOI-link PDF-link

@article{filiot:hal-02093317,
  title = {{Decision problems of tree transducers with origin}},
  author = {Filiot, Emmanuel and Maneth, Sebastian and Reynier, Pierre-Alain and Talbot, Jean-Marc},
  url = {https://hal.science/hal-02093317},
  journal = {{Information and Computation}},
  publisher = {{Elsevier}},
  volume = {261},
  pages = {311-335},
  year = {2018},
  doi = {10.1016/j.ic.2018.02.011},
  keywords = {top-down and MSO tree transducers ; origin ; decidability ; equivalence ; injectivity ; query determinacy},
  pdf = {https://hal.science/hal-02093317/file/InfComp18.pdf},
  hal_id = {hal-02093317},
  hal_version = {v1}
}

Clara Bertolissi, Daniel Ricardo dos Santos, and Silvio Ranise. 2018. Solving Multi-Objective Workflow Satisfiability Problems with Optimization Modulo Theories Techniques. SACMAT.
```
@inproceedings{bertolissi:hal-02092833,
  title = {{Solving Multi-Objective Workflow Satisfiability Problems with Optimization Modulo Theories Techniques.}},
  author = {Bertolissi, Clara and dos Santos, Daniel Ricardo and Ranise, Silvio},
  url = {https://hal.science/hal-02092833},
  booktitle = {{SACMAT}},
  address = {Indianapolis IN, United States},
  year = {2018},
  month = jun,
  hal_id = {hal-02092833},
  hal_version = {v1}
}
```

Damien Busatto-Gaston, Benjamin Monmege, and Pierre-Alain Reynier. 2018. Symbolic Approximation of Weighted Timed Games. 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). DOI-link PDF-link

@inproceedings{busattogaston:hal-02014051,
  title = {{Symbolic Approximation of Weighted Timed Games}},
  author = {Busatto-Gaston, Damien and Monmege, Benjamin and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-02014051},
  booktitle = {{38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)}},
  address = {Ahmedabad, India},
  series = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
  year = {2018},
  month = dec,
  doi = {10.4230/LIPIcs.FSTTCS.2018.28},
  keywords = {Weighted timed games ; Real-time systems ; Game theory ; Approximation},
  pdf = {https://hal.science/hal-02014051/file/LIPIcs-FSTTCS-2018-28.pdf},
  hal_id = {hal-02014051},
  hal_version = {v1}
}

Thomas Brihaye, Arthur Milchior, Gilles Geeraerts, Hsi-Ming Ho, and Benjamin Monmege. 2018. Efficient algorithms and tools for MITL model-checking and synthesis. 23rd International Conference on Engineering of Complex Computer Systems (ICECCS). PDF-link

@inproceedings{brihaye:hal-02014073,
  title = {{Efficient algorithms and tools for MITL model-checking and synthesis}},
  author = {Brihaye, Thomas and Milchior, Arthur and Geeraerts, Gilles and Ho, Hsi-Ming and Monmege, Benjamin},
  url = {https://hal.science/hal-02014073},
  booktitle = {{23rd International Conference on Engineering of Complex Computer Systems (ICECCS)}},
  address = {Melbourne, Australia},
  year = {2018},
  month = dec,
  keywords = {MITL ; Model-checking ; Synthesis ; Timed automata},
  pdf = {https://hal.science/hal-02014073/file/main.pdf},
  hal_id = {hal-02014073},
  hal_version = {v1}
}

Luc Dartois, Ismaël Jecker, and Pierre-Alain Reynier. 2018. Aperiodic String Transducers. International Journal of Foundations of Computer Science. PDF-link
```
@article{dartois:hal-02003676,
  title = {{Aperiodic String Transducers}},
  author = {Dartois, Luc and Jecker, Isma{\"e}l and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-02003676},
  journal = {{International Journal of Foundations of Computer Science}},
  publisher = {{World Scientific Publishing}},
  year = {2018},
  month = mar,
  pdf = {https://hal.science/hal-02003676/file/ijfcs18.pdf},
  hal_id = {hal-02003676},
  hal_version = {v1}
}
```

Nicolas Baudru and Pierre-Alain Reynier. 2018. From Two-Way Transducers to Regular Function Expressions. 22nd International Conference on Developments in Language Theory (DLT 2018), Springer-Verlag, 96–108. DOI-link PDF-link

@inproceedings{baudru:hal-02003430,
  title = {{From Two-Way Transducers to Regular Function Expressions}},
  author = {Baudru, Nicolas and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-02003430},
  booktitle = {{22nd International Conference on Developments in Language Theory (DLT 2018)}},
  address = {Tokyo, Japan},
  editor = {Hoshi, Mizuho and Seki, Shinnosuke},
  publisher = {{Springer-Verlag}},
  series = {Developments in Language Theory 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings},
  volume = {11088},
  pages = {96-108},
  year = {2018},
  month = sep,
  doi = {10.1007/978-3-319-98654-8\_8},
  pdf = {https://hal.science/hal-02003430/file/main.pdf},
  hal_id = {hal-02003430},
  hal_version = {v1}
}

Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, and Pierre-Alain Reynier. 2018. Optimal and Robust Controller Synthesis. FM 2018 - International Symposium on Formal Methods, Springer, 203–221. DOI-link PDF-link

@inproceedings{bacci:hal-01889222,
  title = {{Optimal and Robust Controller Synthesis}},
  author = {Bacci, Giovanni and Bouyer, Patricia and Fahrenberg, Uli and Larsen, Kim Guldstrand and Markey, Nicolas and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-01889222},
  booktitle = {{FM 2018 - International Symposium on Formal Methods}},
  address = {Oxford, United Kingdom},
  publisher = {{Springer}},
  series = {LNCS},
  volume = {10951},
  pages = {203-221},
  year = {2018},
  month = jul,
  doi = {10.1007/978-3-319-95582-7\_12},
  pdf = {https://hal.science/hal-01889222/file/fm2018-BBFLMR.pdf},
  hal_id = {hal-01889222},
  hal_version = {v1}
}

Serge Haddad and Benjamin Monmege. 2018. Interval Iteration Algorithm for MDPs and IMDPs. Theoretical Computer Science 735: 111–131. DOI-link PDF-link

@article{haddad:hal-01809094,
  title = {{Interval Iteration Algorithm for MDPs and IMDPs}},
  author = {Haddad, Serge and Monmege, Benjamin},
  url = {https://hal.science/hal-01809094},
  journal = {{Theoretical Computer Science}},
  publisher = {{Elsevier}},
  volume = {735},
  pages = {111 - 131},
  year = {2018},
  month = jul,
  doi = {10.1016/j.tcs.2016.12.003},
  keywords = {Markov decision processes ; value iteration ; stochastic verification},
  pdf = {https://hal.science/hal-01809094/file/tcs-version.pdf},
  hal_id = {hal-01809094},
  hal_version = {v1}
}

Paul Gastin and Benjamin Monmege. 2018. A Unifying Survey on Weighted Logics and Weighted Automata. Soft Computing 22, 4: 1047–1065. DOI-link PDF-link

@article{gastin:hal-01130216,
  title = {{A Unifying Survey on Weighted Logics and Weighted Automata}},
  author = {Gastin, Paul and Monmege, Benjamin},
  url = {https://hal.science/hal-01130216},
  journal = {{Soft Computing}},
  publisher = {{Springer Verlag}},
  volume = {22},
  number = {4},
  pages = {1047-1065},
  year = {2018},
  month = feb,
  doi = {10.1007/s00500-015-1952-6},
  keywords = {weighted automata ; weighted logic},
  pdf = {https://hal.science/hal-01130216v2/file/unified-weights.pdf},
  hal_id = {hal-01130216},
  hal_version = {v2}
}

2017

El Makki Voundy. 2017. Langages epsilon-sûrs et caractérisations des langages d’ordres supérieurs. Retrieved from https://enac.hal.science/tel-02453297. PDF-link

@phdthesis{voundy:tel-02453297,
  title = {{Langages epsilon-s{\^u}rs et caract{\'e}risations des langages d'ordres sup{\'e}rieurs}},
  author = {Voundy, El Makki},
  url = {https://enac.hal.science/tel-02453297},
  school = {{Aix-Marseille Universit{\'e}}},
  year = {2017},
  month = nov,
  keywords = {Formal languages ; Representation theorems ; Chomsky--Sch{\"u}tzenberger theorem ; Higher order Epsilon-Safe languages ; Langages formels ; th{\'e}or{\`e}mes de repr{\'e}sentation ; th{\'e}or{\`e}me de  Chomsky--Sch{\"u}tzenberger ; langages epsilon-s{\^u}rs d'ordre sup{\'e}rieur},
  type = {Theses},
  pdf = {https://enac.hal.science/tel-02453297/file/171115_VOUNDY_125qrkfd43qpml681ycyunl870whiuxh_TH.pdf},
  hal_id = {tel-02453297},
  hal_version = {v1}
}

Alexis Bonnecaze, Stéphane Ballet, Nicolas Baudru, and Mila Tukumuli. 2017. On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation. Comptes Rendus. Mathématique 355, 7: 729–733. DOI-link PDF-link

@article{bonnecaze:hal-01705865,
  title = {{On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation}},
  author = {Bonnecaze, Alexis and Ballet, St{\'e}phane and Baudru, Nicolas and Tukumuli, Mila},
  url = {https://hal.science/hal-01705865},
  journal = {{Comptes Rendus. Math{\'e}matique}},
  publisher = {{Acad{\'e}mie des sciences (Paris)}},
  volume = {355},
  number = {7},
  pages = {729 - 733},
  year = {2017},
  month = jul,
  doi = {10.1016/j.crma.2017.06.002},
  pdf = {https://hal.science/hal-01705865/file/1-s2.0-S1631073X17301577-main.pdf},
  hal_id = {hal-01705865},
  hal_version = {v1}
}

Clara Bertolissi, Omar Boucelma, and Worachet Uttha. 2017. Enhancing Security in the Cloud: when Traceability meets Access Control. The 12th International Conference for Internet Technology and Secured Transactions ICITST 2017. PDF-link
```
@inproceedings{bertolissi:hal-01787036,
  title = {{Enhancing Security in the Cloud: when Traceability meets Access Control}},
  author = {Bertolissi, Clara and Boucelma, Omar and Uttha, Worachet},
  url = {https://hal.science/hal-01787036},
  booktitle = {{The 12th International Conference for Internet Technology and Secured Transactions ICITST 2017}},
  address = {Cambridge, United Kingdom},
  year = {2017},
  month = dec,
  pdf = {https://hal.science/hal-01787036/file/icitst17.pdf},
  hal_id = {hal-01787036},
  hal_version = {v1}
}
```

S Demri, E Lozes, and Denis Lugiez. 2017. On Symbolic Heaps Modulo Permission Theories. 37th IARCS Foundation on Software Technology and Theoretical Computer Science. DOI-link PDF-link

@inproceedings{demri:hal-01788798,
  title = {{On Symbolic Heaps Modulo Permission Theories}},
  author = {Demri, S and Lozes, E and Lugiez, Denis},
  url = {https://amu.hal.science/hal-01788798},
  booktitle = {{37th IARCS Foundation on Software Technology and Theoretical Computer Science}},
  address = {Kanpur, India},
  year = {2017},
  month = dec,
  doi = {10.4230/LIPIcs.FSTTCS.2017.25},
  keywords = {separation logic ; entailment ; permission ; reasoning modulo theories},
  pdf = {https://amu.hal.science/hal-01788798/file/dll-final-fsttcs17.pdf},
  hal_id = {hal-01788798},
  hal_version = {v1}
}

Emmanuel Filiot and Pierre-Alain Reynier. 2017. Copyful Streaming String Transducers. 11th International Workshop on Reachability Problems (RP 2017). PDF-link
```
@inproceedings{filiot:hal-01782442,
  title = {{Copyful Streaming String Transducers}},
  author = {Filiot, Emmanuel and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-01782442},
  booktitle = {{11th International Workshop on Reachability Problems (RP 2017)}},
  address = {London, United Kingdom},
  year = {2017},
  month = sep,
  pdf = {https://hal.science/hal-01782442/file/rp17.pdf},
  hal_id = {hal-01782442},
  hal_version = {v1}
}
```
Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, and Didier Villevalois. 2017. Degree of sequentiality of weighted automata. 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017). PDF-link
```
@inproceedings{daviaud:hal-01782446,
  title = {{Degree of sequentiality of weighted automata}},
  author = {Daviaud, Laure and Jecker, Isma{\"e}l and Reynier, Pierre-Alain and Villevalois, Didier},
  url = {https://hal.science/hal-01782446},
  booktitle = {{20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017)}},
  address = {Uppsala, Sweden},
  year = {2017},
  month = apr,
  pdf = {https://hal.science/hal-01782446/file/fossacs17b.pdf},
  hal_id = {hal-01782446},
  hal_version = {v1}
}
```

Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, and Benjamin Monmege. 2017. Timed-Automata-Based Verification of MITL over Signals. 24th International Symposium on Temporal Representation and Reasoning (TIME 2017), 7:1–7:19. DOI-link PDF-link

@inproceedings{brihaye:hal-01526986,
  title = {{Timed-Automata-Based Verification of MITL over Signals}},
  author = {Brihaye, Thomas and Geeraerts, Gilles and Ho, Hsi-Ming and Monmege, Benjamin},
  url = {https://hal.science/hal-01526986},
  booktitle = {{24th International Symposium on Temporal Representation and Reasoning (TIME 2017)}},
  address = {Mons, France},
  editor = {fuer Informatik, Schloss Dagstuhl - Leibniz-Zentrum},
  volume = {90},
  pages = {7:1--7:19},
  year = {2017},
  month = oct,
  doi = {10.4230/LIPIcs.TIME.2017.7},
  pdf = {https://hal.science/hal-01526986/file/main.pdf},
  hal_id = {hal-01526986},
  hal_version = {v1}
}

Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, and Benjamin Monmege. 2017. MightyL: A Compositional Translation from MITL to Timed Automata. 29th International Conference on Computer Aided Verification (CAV’17), Springer, 421–440. DOI-link PDF-link

@inproceedings{brihaye:hal-01525524,
  title = {{MightyL: A Compositional Translation from MITL to Timed Automata}},
  author = {Brihaye, Thomas and Geeraerts, Gilles and Ho, Hsi-Ming and Monmege, Benjamin},
  url = {https://hal.science/hal-01525524},
  booktitle = {{29th International Conference on Computer Aided Verification (CAV'17)}},
  address = {Heidelberg, Germany},
  editor = {Majumdar, Rupak and Kun{\v c}ak, Victor},
  publisher = {{Springer}},
  series = {Proceedings of the 29th International Conference on Computer Aided Verification, Part I (CAV'17)},
  volume = {10426},
  pages = {421-440},
  year = {2017},
  month = jul,
  doi = {10.1007/978-3-319-63387-9\_21},
  pdf = {https://hal.science/hal-01525524/file/main-final.pdf},
  hal_id = {hal-01525524},
  hal_version = {v1}
}

Damien Busatto-Gaston, Benjamin Monmege, and Pierre-Alain Reynier. 2017. Optimal Reachability in Divergent Weighted Timed Games. 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS’17), Springer, 162–178. DOI-link PDF-link

@inproceedings{busattogaston:hal-01522546,
  title = {{Optimal Reachability in Divergent Weighted Timed Games}},
  author = {Busatto-Gaston, Damien and Monmege, Benjamin and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-01522546},
  booktitle = {{20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17)}},
  address = {Uppsala, Sweden},
  editor = {Esparza, Javier and Murawski, Andrzej S.},
  publisher = {{Springer}},
  series = {Foundations of Software Science and Computation Structures. 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings},
  volume = {10203},
  pages = {162-178},
  year = {2017},
  month = apr,
  doi = {10.1007/978-3-662-54458-7\_10},
  pdf = {https://hal.science/hal-01522546/file/paper.pdf},
  hal_id = {hal-01522546},
  hal_version = {v1}
}

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, and Benjamin Monmege. 2017. Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Informatica 54, 1: 85–125. DOI-link PDF-link

@article{brihaye:hal-01414114,
  title = {{Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games}},
  author = {Brihaye, Thomas and Geeraerts, Gilles and Haddad, Axel and Monmege, Benjamin},
  url = {https://hal.science/hal-01414114},
  journal = {{Acta Informatica}},
  publisher = {{Springer Verlag}},
  series = {Special Issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015)},
  volume = {54},
  number = {1},
  pages = {85--125},
  year = {2017},
  month = feb,
  doi = {10.1007/s00236-016-0276-z},
  pdf = {https://hal.science/hal-01414114/file/priced-games.pdf},
  hal_id = {hal-01414114},
  hal_version = {v1}
}

2016

Severine Fratani and El Makki Voundy. 2016. Homomorphic Characterizations of Indexed Languages. Language and Automata Theory and Applications (LATA) 2016. DOI-link PDF-link

@inproceedings{fratani:hal-01478780,
  title = {{Homomorphic Characterizations of Indexed Languages}},
  author = {Fratani, Severine and Voundy, El Makki},
  url = {https://hal.science/hal-01478780},
  booktitle = {{Language and Automata Theory and Applications (LATA) 2016}},
  address = {Prague, Czech Republic},
  series = {Language and Automata Theory and Applications 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings},
  volume = {9618},
  year = {2016},
  month = mar,
  doi = {10.1007/978-3-319-30000-9\_28},
  keywords = {grammars ;  homomorphic characterizations ;  transductions ;  indexed languages},
  pdf = {https://hal.science/hal-01478780/file/main.pdf},
  hal_id = {hal-01478780},
  hal_version = {v1}
}

Stéphane Ballet, Nicolas Baudru, Alexis Bonnecaze, and Mila Tukumuli. 2016. On The Effective Construction of Asymmetric Chudnovsky Multiplication Algorithms in Finite Fields Without Derivated Evaluation. Retrieved from https://hal.science/hal-01478942. arXiv admin note: text overlap with arXiv:1510.00090.
```
@unpublished{ballet:hal-01478942,
  title = {{On The Effective Construction of Asymmetric Chudnovsky Multiplication Algorithms in Finite Fields Without Derivated Evaluation}},
  author = {Ballet, St{\'e}phane and Baudru, Nicolas and Bonnecaze, Alexis and Tukumuli, Mila},
  url = {https://hal.science/hal-01478942},
  note = {arXiv admin note: text overlap with arXiv:1510.00090},
  year = {2016},
  month = nov,
  hal_id = {hal-01478942},
  hal_version = {v1}
}
```
Emmanuel Filiot and Pierre-Alain Reynier. 2016. Transducers, logic and algebra for functions of finite words. SIGLOG News 3, 3: 4–19. DOI-link
```
@article{filiot:hal-01475445,
  title = {{Transducers, logic and algebra for functions of finite words}},
  author = {Filiot, Emmanuel and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-01475445},
  journal = {{SIGLOG News}},
  volume = {3},
  number = {3},
  pages = {4--19},
  year = {2016},
  doi = {10.1145/2984450.2984453},
  hal_id = {hal-01475445},
  hal_version = {v1}
}
```
Luc Dartois, Ismaël Jecker, and Pierre-Alain Reynier. 2016. Aperiodic String Transducers. Proc. 20th International Conference on Developments in Language Theory (DLT 2016), Springer, 125–137. DOI-link
```
@inproceedings{dartois:hal-01475444,
  title = {{Aperiodic String Transducers}},
  author = {Dartois, Luc and Jecker, Isma{\"e}l and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-01475444},
  booktitle = {{Proc. 20th International Conference on Developments in Language Theory (DLT 2016)}},
  address = {Unknown, Unknown Region},
  publisher = {{Springer}},
  series = {Lecture Notes in Computer Science},
  volume = {9840},
  pages = {125-137},
  year = {2016},
  doi = {10.1007/978-3-662-53132-7\_11},
  hal_id = {hal-01475444},
  hal_version = {v1}
}
```
Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, and Jean-Marc Talbot. 2016. Two-Way Visibly Pushdown Automata and Transducers. Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’16), ACM, 217–226. DOI-link
```
@inproceedings{dartois:hal-01475442,
  title = {{Two-Way Visibly Pushdown Automata and Transducers}},
  author = {Dartois, Luc and Filiot, Emmanuel and Reynier, Pierre-Alain and Talbot, Jean-Marc},
  url = {https://hal.science/hal-01475442},
  booktitle = {{Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16)}},
  address = {Unknown, Unknown Region},
  publisher = {{ACM}},
  pages = {217--226},
  year = {2016},
  doi = {10.1145/2933575.2935315},
  hal_id = {hal-01475442},
  hal_version = {v1}
}
```
Laure Daviaud, Pierre-Alain Reynier, and Jean-Marc Talbot. 2016. A Generalized Twinning Property for Minimisation of Cost Register Automata. Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’16), ACM, 857–866. DOI-link
```
@inproceedings{daviaud:hal-01475441,
  title = {{A Generalized Twinning Property for Minimisation of Cost Register Automata}},
  author = {Daviaud, Laure and Reynier, Pierre-Alain and Talbot, Jean-Marc},
  url = {https://hal.science/hal-01475441},
  booktitle = {{Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16)}},
  address = {Unknown, Unknown Region},
  publisher = {{ACM}},
  pages = {857--866},
  year = {2016},
  doi = {10.1145/2933575.2934549},
  hal_id = {hal-01475441},
  hal_version = {v1}
}
```
Clara Bertolissi, Jean-Marc Talbot, and Didier Villevalois. 2016. Analysis of access control policy updates through narrowing. Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, Pages 62–75.
```
@inproceedings{bertolissi:hal-01452928,
  title = {{Analysis of access control policy updates through narrowing}},
  author = {Bertolissi, Clara and Talbot, Jean-Marc and Villevalois, Didier},
  url = {https://hal.science/hal-01452928},
  booktitle = {{Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming}},
  address = {Edinburgh, United Kingdom},
  series = {ACM},
  pages = {Pages 62-75},
  year = {2016},
  month = sep,
  hal_id = {hal-01452928},
  hal_version = {v1}
}
```

Thomas T Brihaye, Amit K Kumar Dhar, Gilles Geeraerts, Axel Haddad, and Benjamin Monmege. 2016. Efficient Energy Distribution in a Smart Grid using Multi-Player Games. Cassting Workshop on Games for the Synthesis of Complex Systems (Cassting’16) , EPTCS, 1–12. DOI-link PDF-link

@inproceedings{brihaye:hal-01452611,
  title = {{Efficient Energy Distribution in a Smart Grid using Multi-Player Games}},
  author = {Brihaye, Thomas T and Kumar Dhar, Amit K and Geeraerts, Gilles and Haddad, Axel and Monmege, Benjamin},
  url = {https://inria.hal.science/hal-01452611},
  booktitle = {{Cassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16) }},
  address = {Eindhoven, Netherlands},
  publisher = {{EPTCS}},
  series = {Proceedings of the Cassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16) and the 3rd International Workshop on Synthesis of Complex Parameters (SynCoP'16)},
  volume = {220},
  pages = {1 - 12},
  year = {2016},
  month = apr,
  doi = {10.4204/EPTCS.220.1},
  pdf = {https://inria.hal.science/hal-01452611/file/BrihayeDharGeeraertsHaddadMonmege%20-%2016%20-%20Efficient%20Energy%20Distribution%20in%20a%20Smart%20Grid%20Using%20Multi-Player%20Games.pdf},
  hal_id = {hal-01452611},
  hal_version = {v1}
}

Sundararaman Akshay, Loïc Hélouët, Claude Jard, and Pierre-Alain Reyniers. 2016. Robustness of Time Petri Nets under Guard Enlargement. Fundamenta Informaticae 143, 3-4. DOI-link PDF-link

@article{akshay:hal-01379431,
  title = {{Robustness of Time Petri Nets under Guard Enlargement}},
  author = {Akshay, Sundararaman and H{\'e}lou{\"e}t, Lo{\"i}c and Jard, Claude and Reyniers, Pierre-Alain},
  url = {https://inria.hal.science/hal-01379431},
  journal = {{Fundamenta Informaticae}},
  publisher = {{Polskie Towarzystwo Matematyczne}},
  volume = {143},
  number = {3-4},
  year = {2016},
  doi = {10.3233/FI-2016-1312},
  keywords = {Petri nets ;  Robustness ; timed automata},
  pdf = {https://inria.hal.science/hal-01379431/file/HelouetFundamenta15%28d%C3%A9pos%C3%A9%29.pdf},
  hal_id = {hal-01379431},
  hal_version = {v1}
}

Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, and Nathalie Sznajder. 2016. Real-time Synthesis is Hard! 14th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS’16), Springer, 105–120. DOI-link PDF-link

@inproceedings{brihaye:hal-01344684,
  title = {{Real-time Synthesis is Hard!}},
  author = {Brihaye, Thomas and Esti{\'e}venart, Morgane and Geeraerts, Gilles and Ho, Hsi-Ming and Monmege, Benjamin and Sznajder, Nathalie},
  url = {https://hal.sorbonne-universite.fr/hal-01344684},
  booktitle = {{14th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'16)}},
  address = {Qu{\'e}bec City, Canada},
  editor = {Fr{\"a}nzle, Martin and Markey, Nicolas},
  publisher = {{Springer}},
  series = {Lecture Notes in Computer Science},
  volume = {9884},
  pages = {105-120},
  year = {2016},
  month = aug,
  doi = {10.1007/978-3-319-44878-7\_7},
  pdf = {https://hal.sorbonne-universite.fr/hal-01344684/file/main.pdf},
  hal_id = {hal-01344684},
  hal_version = {v1}
}

2015

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, and Benjamin Monmege. 2015. Simple Priced Timed Games Are Not That Simple. Proceedings of the 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’15), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 278–292. DOI-link PDF-link

@inproceedings{brihaye:hal-01452621,
  title = {{Simple Priced Timed Games Are Not That Simple}},
  author = {Brihaye, Thomas and Geeraerts, Gilles and Haddad, Axel and Lefaucheux, Engel and Monmege, Benjamin},
  url = {https://inria.hal.science/hal-01452621},
  booktitle = {{Proceedings of the 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15)}},
  address = {Bangalore, India},
  editor = {Harsha, Prahladh and Ramalingam, G.},
  publisher = {{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}},
  series = {Leibniz International Proceedings in Informatics },
  volume = {45},
  pages = {278-292},
  year = {2015},
  month = dec,
  doi = {10.4230/LIPIcs.FSTTCS.2015.p},
  keywords = {Priced timed games ; Real-time systems ; Game theory},
  pdf = {https://inria.hal.science/hal-01452621/file/main.pdf},
  hal_id = {hal-01452621},
  hal_version = {v1}
}

Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, and Jean-Marc Talbot. 2015. Decision Problems of Tree Transducers with Origin. 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015). DOI-link
```
@inproceedings{filiot:hal-01285566,
  title = {{Decision Problems of Tree Transducers with Origin}},
  author = {Filiot, Emmanuel and Maneth, Sebastian and Reynier, Pierre-Alain and Talbot, Jean-Marc},
  url = {https://hal.science/hal-01285566},
  booktitle = {{42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015)}},
  address = {Kyoto, Japan},
  year = {2015},
  month = jul,
  doi = {10.1007/978-3-662-47666-6\_17},
  hal_id = {hal-01285566},
  hal_version = {v1}
}
```

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, and Benjamin Monmege. 2015. To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. Proceedings of the 26th International Conference on Concurrency Theory (CONCUR’15), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 297–310. DOI-link PDF-link

@inproceedings{brihaye:hal-01273475,
  title = {{To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games}},
  author = {Brihaye, Thomas and Geeraerts, Gilles and Haddad, Axel and Monmege, Benjamin},
  url = {https://hal.science/hal-01273475},
  booktitle = {{Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15)}},
  address = {Madrid, Spain},
  publisher = {{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}},
  series = {Leibniz International Proceedings in Informatics },
  volume = {42},
  pages = {297-310},
  year = {2015},
  month = sep,
  doi = {10.4230/LIPIcs.CONCUR.2015.297},
  keywords = {Games on graphs ; Reachability ; Quantitative games ; Value iteration},
  pdf = {https://hal.science/hal-01273475/file/12.pdf},
  hal_id = {hal-01273475},
  hal_version = {v1}
}

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, and Gabriel Renault. 2015. Quantitative Games under Failures. 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’15), 293–306. DOI-link PDF-link

@inproceedings{brihaye:hal-01273251,
  title = {{Quantitative Games under Failures}},
  author = {Brihaye, Thomas and Geeraerts, Gilles and Haddad, Axel and Monmege, Benjamin and P{\'e}rez, Guillermo A. and Renault, Gabriel},
  url = {https://hal.science/hal-01273251},
  booktitle = {{35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15)}},
  address = {Bangalore, India},
  series = {Leibniz International Proceedings in Informatics },
  volume = {45},
  pages = {293-306},
  year = {2015},
  month = dec,
  doi = {10.4230/LIPIcs.FSTTCS.2015.293},
  pdf = {https://hal.science/hal-01273251/file/6.pdf},
  hal_id = {hal-01273251},
  hal_version = {v1}
}

Laure Daviaud, Pierre-Alain Reynier, and Jean-Marc Talbot. 2015. A Generalised Twinning Property for Minimisation of Cost Register Automata. Retrieved from https://hal.science/hal-01201704. working paper or preprint. PDF-link
```
@unpublished{daviaud:hal-01201704,
  title = {{A Generalised Twinning Property for Minimisation of Cost Register Automata}},
  author = {Daviaud, Laure and Reynier, Pierre-Alain and Talbot, Jean-Marc},
  url = {https://hal.science/hal-01201704},
  note = {working paper or preprint},
  year = {2015},
  month = sep,
  keywords = {Weighted automata ; cost register automata ; twinning property ; minimisation},
  pdf = {https://hal.science/hal-01201704/file/main.pdf},
  hal_id = {hal-01201704},
  hal_version = {v1}
}
```

2014

Youssouf Oualhadj, Pierre-Alain Reynier, and Ocan Sankur. 2014. Probabilistic Robust Timed Games. . 42 pages. PDF-link
```
@techreport{oualhadj:hal-01010813,
  title = {{Probabilistic Robust Timed Games}},
  author = {Oualhadj, Youssouf and Reynier, Pierre-Alain and Sankur, Ocan},
  url = {https://hal.science/hal-01010813},
  note = {42 pages},
  year = {2014},
  month = jun,
  keywords = {timed automata ; games ; synthesis ; robustness},
  pdf = {https://hal.science/hal-01010813/file/rtg.pdf},
  hal_id = {hal-01010813},
  hal_version = {v1}
}
```
Pierre-Alain Reynier and Jean-Marc Talbot. 2014. Visibly Pushdown Transducers with Well-nested Outputs. . PDF-link
```
@techreport{reynier:hal-00988129,
  title = {{Visibly Pushdown Transducers with Well-nested Outputs}},
  author = {Reynier, Pierre-Alain and Talbot, Jean-Marc},
  url = {https://hal.science/hal-00988129},
  year = {2014},
  month = may,
  keywords = {Transduction ; Visibly Pushdown Transducers ; Nested words},
  pdf = {https://hal.science/hal-00988129/file/wnVPT.pdf},
  hal_id = {hal-00988129},
  hal_version = {v1}
}
```

2013

Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, and Frédéric Servais. 2013. From Two-Way to One-Way Finite State Transducers. 28th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE Computer Society, 468–477. DOI-link PDF-link
```
@inproceedings{filiot:hal-00946161,
  title = {{From Two-Way to One-Way Finite State Transducers}},
  author = {Filiot, Emmanuel and Gauwin, Olivier and Reynier, Pierre-Alain and Servais, Fr{\'e}d{\'e}ric},
  url = {https://hal.science/hal-00946161},
  booktitle = {{28th Annual ACM/IEEE Symposium on Logic in Computer Science}},
  address = {New Orleans, United States},
  publisher = {{IEEE Computer Society}},
  pages = {468-477},
  year = {2013},
  month = jun,
  doi = {10.1109/LICS.2013.53},
  pdf = {https://hal.science/hal-00946161/file/lics13.pdf},
  hal_id = {hal-00946161},
  hal_version = {v1}
}
```

2012

Sundararaman Akshay, Loic Helouet, Claude Jard, and Pierre-Alain Reynier. 2012. Robustness of Time Petri Nets under Guard Enlargement. Reachability Problems, Springer, 92–106. PDF-link

@inproceedings{akshay:hal-00879832,
  title = {{Robustness of Time Petri Nets under Guard Enlargement}},
  author = {Akshay, Sundararaman and Helouet, Loic and Jard, Claude and Reynier, Pierre-Alain},
  url = {https://inria.hal.science/hal-00879832},
  booktitle = {{Reachability Problems}},
  address = {Bordeaux, France},
  organization = {{LABRI}},
  editor = {Finkel, Alain and Leroux, J{\'e}r{\^o}me and Potapov, Igor},
  publisher = {{Springer}},
  series = {Lecture Notes in Computer Science},
  number = {7550},
  pages = {92-106},
  year = {2012},
  month = sep,
  pdf = {https://inria.hal.science/hal-00879832/file/RP12_robustTPN.pdf},
  hal_id = {hal-00879832},
  hal_version = {v1}
}

Florent Avellaneda and Rémi Morin. 2012. Vector Addition Systems with States vs. Petri Nets. . PDF-link

@techreport{avellaneda:hal-00686444,
  title = {{Vector Addition Systems with States vs. Petri Nets}},
  author = {Avellaneda, Florent and Morin, R{\'e}mi},
  url = {https://hal.science/hal-00686444},
  year = {2012},
  month = oct,
  keywords = {Petri nets ; vector addition systems with states ; non-branching process semantics ; reachability ; boundedness ; covering ; Mazurkiewicz traces ; universality problem},
  pdf = {https://hal.science/hal-00686444v2/file/HAL-00686444_v2.0.pdf},
  hal_id = {hal-00686444},
  hal_version = {v2}
}

Mathieu Caralp, Pierre-Alain Reynier, and Jean-Marc Talbot. 2012. Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. . PDF-link
```
@techreport{caralp:hal-00697091,
  title = {{Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness}},
  author = {Caralp, Mathieu and Reynier, Pierre-Alain and Talbot, Jean-Marc},
  url = {https://hal.science/hal-00697091},
  year = {2012},
  month = may,
  keywords = {Weighted tree automata ; Visibly Pushdown Automata ; Multiplicity ; Boundedness},
  pdf = {https://hal.science/hal-00697091/file/nvpa.pdf},
  hal_id = {hal-00697091},
  hal_version = {v1}
}
```

2011

Séverine Fratani and Jean-Marc Talbot. 2011. An Accurate Type System for Information Flow in Presence of Arrays. 13th Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 31th International Conference on FORmal TEchniques for Networked and Distributed Systems (FORTE), Springer, 153–167. DOI-link PDF-link

@inproceedings{fratani:hal-01583316,
  title = {{An Accurate Type System for Information Flow in Presence of Arrays}},
  author = {Fratani, S{\'e}verine and Talbot, Jean-Marc},
  url = {https://inria.hal.science/hal-01583316},
  booktitle = {{13th Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 31th International Conference on FORmal TEchniques for Networked and Distributed Systems (FORTE)}},
  address = {Reykjavik,, Iceland},
  editor = {Bruni, Roberto and Dingel, Juergen},
  publisher = {{Springer}},
  series = {Formal Techniques for Distributed Systems},
  volume = {LNCS-6722},
  pages = {153-167},
  year = {2011},
  month = jun,
  doi = {10.1007/978-3-642-21461-5\_10},
  pdf = {https://inria.hal.science/hal-01583316/file/978-3-642-21461-5_10_Chapter.pdf},
  hal_id = {hal-01583316},
  hal_version = {v1}
}

Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, and Frederic Servais. 2011. Streamability of Nested Word Transductions. FSTTCS - 31st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science - 2011, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 312–324. DOI-link PDF-link

@inproceedings{filiot:inria-00566409,
  title = {{Streamability of Nested Word Transductions}},
  author = {Filiot, Emmanuel and Gauwin, Olivier and Reynier, Pierre-Alain and Servais, Frederic},
  url = {https://inria.hal.science/inria-00566409},
  booktitle = {{FSTTCS - 31st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science - 2011}},
  address = {Mumbai, India},
  editor = {Chakraborty, Supratik and Kumar, Amit},
  publisher = {{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}},
  series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  volume = {13},
  pages = {312-324},
  year = {2011},
  month = dec,
  doi = {10.4230/LIPIcs.FSTTCS.2011.312},
  pdf = {https://inria.hal.science/inria-00566409v2/file/bounded-memory-vpt.pdf},
  hal_id = {inria-00566409},
  hal_version = {v2}
}

Mathieu Caralp, Pierre-Alain Reynier, and Jean-Marc Talbot. 2011. A polynomial procedure for trimming visibly pushdown automata. . PDF-link
```
@techreport{caralp:hal-00606778,
  title = {{A polynomial procedure for trimming visibly pushdown automata}},
  author = {Caralp, Mathieu and Reynier, Pierre-Alain and Talbot, Jean-Marc},
  url = {https://hal.science/hal-00606778},
  year = {2011},
  month = jul,
  keywords = {Visibily Pushdown Automata ; Trimming},
  pdf = {https://hal.science/hal-00606778v2/file/trimming.pdf},
  hal_id = {hal-00606778},
  hal_version = {v2}
}
```
Pierre-Alain Reynier and Frédéric Servais. 2011. Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. Retrieved from https://hal.science/hal-00554919. working paper or preprint. PDF-link
```
@unpublished{reynier:hal-00554919,
  title = {{Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning}},
  author = {Reynier, Pierre-Alain and Servais, Fr{\'e}d{\'e}ric},
  url = {https://hal.science/hal-00554919},
  note = {working paper or preprint},
  year = {2011},
  month = jan,
  keywords = {Petri nets ; Coverability},
  pdf = {https://hal.science/hal-00554919/file/cover.pdf},
  hal_id = {hal-00554919},
  hal_version = {v1}
}
```

2010

Stéphane Demri and Denis Lugiez. 2010. Complexity of Modal Logics with Presburger Constraints. Journal of Applied Logic 8, 3: 233–252. DOI-link PDF-link

@article{demri:hal-03188381,
  title = {{Complexity of Modal Logics with Presburger Constraints}},
  author = {Demri, St{\'e}phane and Lugiez, Denis},
  url = {https://hal.science/hal-03188381},
  journal = {{Journal of Applied Logic}},
  publisher = {{Elsevier}},
  volume = {8},
  number = {3},
  pages = {233-252},
  year = {2010},
  doi = {10.1016/j.jal.2010.03.001},
  keywords = {complexity ; regularity constraint ; arithmetical constraint ; Ladner-like algorithm ; modal logic ; Presburger arithmetic ; small model property},
  pdf = {https://hal.science/hal-03188381/file/DL-jal10.pdf},
  hal_id = {hal-03188381},
  hal_version = {v1}
}

Dorina Ghindici, Isabelle Simplot-Ryl, and Jean-Marc Talbot. 2010. A sound analysis for secure information flow using abstract memory graph. Proc. 3rd IPM International Conference on Fundamentals of Software Engineering, FSEN 2009, Revised Selected papers, Springer, 355–370. DOI-link

@inproceedings{ghindici:inria-00544943,
  title = {{A sound analysis for secure information flow using abstract memory graph}},
  author = {Ghindici, Dorina and Simplot-Ryl, Isabelle and Talbot, Jean-Marc},
  url = {https://inria.hal.science/inria-00544943},
  booktitle = {{Proc. 3rd IPM International Conference on Fundamentals of Software Engineering, FSEN 2009, Revised Selected papers}},
  address = {Kish Island, Persian Gulf, Iran, Iran},
  editor = {Arbab, Farhad and Sirjani, Marjan},
  publisher = {{Springer}},
  series = {Lectures Notes in Computer Science},
  volume = {5961},
  pages = {355--370},
  year = {2010},
  doi = {10.1007/978-3-642-11623-0\_21},
  hal_id = {inria-00544943},
  hal_version = {v1}
}

Remi Jaubert and Pierre-Alain Reynier. 2010. Quantitative Robustness Analysis of Flat Timed Automata. Retrieved from https://hal.science/hal-00534896. working paper or preprint. PDF-link
```
@unpublished{jaubert:hal-00534896,
  title = {{Quantitative Robustness Analysis of Flat Timed Automata}},
  author = {Jaubert, Remi and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-00534896},
  note = {working paper or preprint},
  year = {2010},
  month = oct,
  keywords = {reachability ; robustness ; Timed Automata ; symbolic algorithm},
  pdf = {https://hal.science/hal-00534896/file/JR2010.pdf},
  hal_id = {hal-00534896},
  hal_version = {v1}
}
```

Emmanuel Filiot, Jean-Marc Talbot, and Sophie Tison. 2010. Tree Automata With Global Constraints. International Journal of Foundations of Computer Science 21, 4: 571–596. DOI-link

@article{filiot:hal-00526987,
  title = {{Tree Automata With Global Constraints}},
  author = {Filiot, Emmanuel and Talbot, Jean-Marc and Tison, Sophie},
  url = {https://hal.science/hal-00526987},
  journal = {{International Journal of Foundations of Computer Science}},
  publisher = {{World Scientific Publishing}},
  volume = {21},
  number = {4},
  pages = {571-596},
  year = {2010},
  month = aug,
  doi = {10.1142/S012905411000743X},
  keywords = {Trees ; automata ; equality constraints},
  hal_id = {hal-00526987},
  hal_version = {v1}
}

Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, and Jean-Marc Talbot. 2010. Properties of Visibly Pushdown Transducers. 35th International Symposium on Mathematical Foundations of Computer Science, xxx. PDF-link
```
@inproceedings{filiot:inria-00492241,
  title = {{Properties of Visibly Pushdown Transducers}},
  author = {Filiot, Emmanuel and Raskin, Jean-Fran{\c c}ois and Reynier, Pierre-Alain and Servais, Fr{\'e}d{\'e}ric and Talbot, Jean-Marc},
  url = {https://inria.hal.science/inria-00492241},
  booktitle = {{35th International Symposium on Mathematical Foundations of Computer Science}},
  address = {Brno, Czech Republic},
  pages = {xxx},
  year = {2010},
  month = aug,
  pdf = {https://inria.hal.science/inria-00492241v2/file/vpts-mfcs.pdf},
  hal_id = {inria-00492241},
  hal_version = {v2}
}
```

2009

Françoise Gire and Jean-Marc Talbot. 2009. Nested Sibling Tree Automata. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA) 43, 2: 379–402. DOI-link
```
@article{gire:hal-00663203,
  title = {{Nested Sibling Tree Automata}},
  author = {Gire, Fran{\c c}oise and Talbot, Jean-Marc},
  url = {https://paris1.hal.science/hal-00663203},
  journal = {{RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)}},
  publisher = {{EDP Sciences}},
  volume = {43},
  number = {2},
  pages = {379-402},
  year = {2009},
  month = apr,
  doi = {10.1051/ita/2009006},
  hal_id = {hal-00663203},
  hal_version = {v1}
}
```

Franck Cassez, Jan J. Jessen, Kim Guldstrand Larsen, Jean-François Raskin, and Pierre-Alain Reynier. 2009. Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study. International Conference on Hybrid Systems: Computation and Control (HSCC’09), 90–104. PDF-link

@inproceedings{cassez:inria-00493634,
  title = {{Automatic Synthesis of Robust and Optimal Controllers -- An Industrial Case Study}},
  author = {Cassez, Franck and Jessen, Jan J. and Larsen, Kim Guldstrand and Raskin, Jean-Fran{\c c}ois and Reynier, Pierre-Alain},
  url = {https://inria.hal.science/inria-00493634},
  booktitle = {{International Conference on Hybrid Systems: Computation and Control (HSCC'09)}},
  address = {San Francisco, United States},
  series = {LNCS},
  volume = {5469},
  pages = {90--104},
  year = {2009},
  month = apr,
  pdf = {https://inria.hal.science/inria-00493634/file/hscc-09.pdf},
  hal_id = {inria-00493634},
  hal_version = {v1}
}

Stéphane Martin and Denis Lugiez. 2009. Research report : Collaborative Peer 2 Peer Edition: Avoiding Conflicts is Better than Solving Conflicts. Retrieved from https://hal.science/hal-00429612. 12 pages. PDF-link
```
@unpublished{martin:hal-00429612,
  title = {{Research report : Collaborative Peer 2 Peer Edition: Avoiding Conflicts is Better than Solving Conflicts}},
  author = {Martin, St{\'e}phane and Lugiez, Denis},
  url = {https://hal.science/hal-00429612},
  note = {12 pages},
  year = {2009},
  month = oct,
  keywords = {Collaborative Editing ; XML ; Peer to Peer ; Optimistic Reconciliation ; Consistence Maintenance ; Distributed Computing},
  pdf = {https://hal.science/hal-00429612v3/file/Rapport.pdf},
  hal_id = {hal-00429612},
  hal_version = {v3}
}
```
Pierre-Alain Reynier and Arnaud Sangnier. 2009. Weak Time Petri Nets strike back! Retrieved from https://hal.science/hal-00374482. working paper or preprint. PDF-link
```
@unpublished{reynier:hal-00374482,
  title = {{Weak Time Petri Nets strike back!}},
  author = {Reynier, Pierre-Alain and Sangnier, Arnaud},
  url = {https://hal.science/hal-00374482},
  note = {working paper or preprint},
  year = {2009},
  month = apr,
  keywords = {Time Petri Nets ; Decidability ; Expressivity},
  pdf = {https://hal.science/hal-00374482v3/file/TPN.pdf},
  hal_id = {hal-00374482},
  hal_version = {v3}
}
```
Omer Landry Nguena Timo and Pierre-Alain Reynier. 2009. On Characteristic Formulae for Event-Recording Automata. Retrieved from https://hal.science/hal-00383203. working paper or preprint. PDF-link
```
@unpublished{nguenatimo:hal-00383203,
  title = {{On Characteristic Formulae for Event-Recording Automata}},
  author = {Nguena Timo, Omer Landry and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-00383203},
  note = {working paper or preprint},
  year = {2009},
  month = may,
  keywords = {Charcateristic Formulae ; Timed Logic ; Bisimulation},
  pdf = {https://hal.science/hal-00383203/file/WTmu.pdf},
  hal_id = {hal-00383203},
  hal_version = {v1}
}
```
Severine Fratani. 2009. The theory of successor extended by several predicates. Retrieved from https://hal.science/hal-00379251. working paper or preprint. PDF-link
```
@unpublished{fratani:hal-00379251,
  title = {{The theory of successor extended by several predicates}},
  author = {Fratani, Severine},
  url = {https://hal.science/hal-00379251},
  note = {working paper or preprint},
  hal_local_reference = {http://www.cmi.univ-mrs.fr/~sfratani/},
  year = {2009},
  month = feb,
  pdf = {https://hal.science/hal-00379251v1/file/esc.pdf},
  hal_id = {hal-00379251},
  hal_version = {v1}
}
```
Severine Fratani. 2009. Regular sets over extended tree structures. Retrieved from https://hal.science/hal-00379256. working paper or preprint. PDF-link
```
@unpublished{fratani:hal-00379256,
  title = {{Regular sets over extended tree structures}},
  author = {Fratani, Severine},
  url = {https://hal.science/hal-00379256},
  note = {working paper or preprint},
  hal_local_reference = {http://www.cmi.univ-mrs.fr/~sfratani/},
  year = {2009},
  month = feb,
  pdf = {https://hal.science/hal-00379256/file/reck.pdf},
  hal_id = {hal-00379256},
  hal_version = {v1}
}
```

2008

Hubert Comon, Max Dauchet, Rémi Gilleron, et al. 2008. Tree Automata Techniques and Applications. . PDF-link
```
@book{comon:hal-03367725,
  title = {{Tree Automata Techniques and Applications}},
  author = {Comon, Hubert and Dauchet, Max and Gilleron, R{\'e}mi and Jacquemard, Florent and Lugiez, Denis and L{\"o}ding, Christof and Tison, Sophie and Tommasi, Marc},
  url = {https://inria.hal.science/hal-03367725},
  pages = {262},
  year = {2008},
  pdf = {https://inria.hal.science/hal-03367725/file/tata.pdf},
  hal_id = {hal-03367725},
  hal_version = {v1}
}
```
Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, and Ralf Treinen. 2008. Symbolic Protocol Analysis for Monoidal Equational Theories. Information and Computation 206, 2-4: 312–351. DOI-link PDF-link
```
@article{delaune:hal-00496352,
  title = {{Symbolic Protocol Analysis for Monoidal Equational Theories}},
  author = {Delaune, St{\'e}phanie and Lafourcade, Pascal and Lugiez, Denis and Treinen, Ralf},
  url = {https://hal.science/hal-00496352},
  journal = {{Information and Computation}},
  publisher = {{Elsevier}},
  volume = {206},
  number = {2-4},
  pages = {312-351},
  year = {2008},
  doi = {10.1016/j.ic.2007.07.005},
  pdf = {https://hal.science/hal-00496352/file/DLLT-ic07.pdf},
  hal_id = {hal-00496352},
  hal_version = {v1}
}
```

Patricia Bouyer, Nicolas Markey, and Pierre-Alain Reynier. 2008. Robust Analysis of Timed Automata via Channel Machines. Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS’08), Springer, 157–171. DOI-link PDF-link

@inproceedings{bouyer:hal-01194593,
  title = {{Robust Analysis of Timed Automata via Channel Machines}},
  author = {Bouyer, Patricia and Markey, Nicolas and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-01194593},
  booktitle = {{Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08)}},
  address = {Budapest, Hungary},
  editor = {Amadio, Roberto},
  publisher = {{Springer}},
  series = {Lecture Notes in Computer Science},
  volume = {4962},
  pages = {157-171},
  year = {2008},
  doi = {10.1007/978-3-540-78499-9\_12},
  pdf = {https://hal.science/hal-01194593/file/BMR-fossacs08.pdf},
  hal_id = {hal-01194593},
  hal_version = {v1}
}

Emmanuel Filiot, Jean-Marc Talbot, and Sophie Tison. 2008. Tree Automata with Global Constraints. 12th International Conference on Developments in Language Theory (DLT), 314–326. PDF-link
```
@inproceedings{filiot:inria-00292027,
  title = {{Tree Automata with Global Constraints}},
  author = {Filiot, Emmanuel and Talbot, Jean-Marc and Tison, Sophie},
  url = {https://inria.hal.science/inria-00292027},
  booktitle = {{12th International Conference on Developments in Language Theory (DLT)}},
  address = {Kyoto, Japan},
  pages = {314-326},
  year = {2008},
  month = sep,
  pdf = {https://inria.hal.science/inria-00292027v2/file/dlt-full.pdf},
  hal_id = {inria-00292027},
  hal_version = {v2}
}
```
Denis Lugiez and Stéphane Martin. 2008. Peer to Peer Optimistic Collaborative Editing on XML-like trees. Retrieved from https://hal.science/hal-00343484. working paper or preprint. PDF-link
```
@unpublished{lugiez:hal-00343484,
  title = {{Peer to Peer Optimistic Collaborative Editing on XML-like trees}},
  author = {Lugiez, Denis and Martin, St{\'e}phane},
  url = {https://hal.science/hal-00343484},
  note = {working paper or preprint},
  year = {2008},
  month = oct,
  keywords = {Peer to Peer ; Concurrent Processes ; Collaborative Editing ; Optimistic reconciliation ; XML},
  pdf = {https://hal.science/hal-00343484/file/main.pdf},
  hal_id = {hal-00343484},
  hal_version = {v1}
}
```

2007

Pascal Lafourcade, Denis Lugiez, and Ralf Treinen. 2007. Intruder deduction for the equational theory of Abelian groups with distributive encryption. Information and Computation 205, 4: 581–623. DOI-link PDF-link
```
@article{lafourcade:hal-00496353,
  title = {{Intruder deduction for the equational theory of Abelian groups with distributive encryption}},
  author = {Lafourcade, Pascal and Lugiez, Denis and Treinen, Ralf},
  url = {https://hal.science/hal-00496353},
  journal = {{Information and Computation}},
  publisher = {{Elsevier}},
  volume = {205},
  number = {4},
  pages = {581-623},
  year = {2007},
  doi = {10.1016/j.ic.2006.10.008},
  pdf = {https://hal.science/hal-00496353/file/LLT-icomp07.pdf},
  hal_id = {hal-00496353},
  hal_version = {v1}
}
```

Yannick Chevalier, Denis Lugiez, and Michael Rusinowitch. 2007. Verifying Cryptographic Protocols with Subterms Constraints. 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning - LPAR 2007, Springer, 181–195. The original publication is available at www.springerlink.com. DOI-link

@inproceedings{chevalier:inria-00557710,
  title = {{Verifying Cryptographic Protocols with Subterms Constraints}},
  author = {Chevalier, Yannick and Lugiez, Denis and Rusinowitch, Michael},
  url = {https://inria.hal.science/inria-00557710},
  note = {The original publication is available at www.springerlink.com},
  booktitle = {{14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning - LPAR 2007}},
  address = {Yerevan, Armenia},
  editor = {Dershowitz and Nachum and Voronkov and Andrei},
  publisher = {{Springer}},
  series = {Lecture Notes in Artificial Intelligence},
  volume = {4790},
  pages = {181-195},
  year = {2007},
  month = oct,
  doi = {10.1007/978-3-540-75560-9\_15},
  hal_id = {inria-00557710},
  hal_version = {v1}
}

Yannick Chevalier, Denis Lugiez, and Michael Rusinowitch. 2007. Towards an Automatic Analysis of Web Service Security. 6th International Symposium on Frontiers of Combining Systems - FroCoS’07, Springer, 133–147. The original publication is available at www.springerlink.com. DOI-link

@inproceedings{chevalier:inria-00557707,
  title = {{Towards an Automatic Analysis of Web Service Security}},
  author = {Chevalier, Yannick and Lugiez, Denis and Rusinowitch, Michael},
  url = {https://inria.hal.science/inria-00557707},
  note = {The original publication is available at www.springerlink.com},
  booktitle = {{6th International Symposium on Frontiers of Combining Systems - FroCoS'07}},
  address = {Liverpool, United Kingdom},
  editor = {Konev and Boris and Wolter and Franck},
  publisher = {{Springer}},
  series = {Lecture Notes in Artificial Intelligence},
  volume = {4720},
  pages = {133-147},
  year = {2007},
  month = sep,
  doi = {10.1007/978-3-540-74621-8\_9},
  keywords = {Security ; Web services ; verification ; cryptographic protocols ; combination of decision procedures ; equational theories ; rewriting},
  hal_id = {inria-00557707},
  hal_version = {v1}
}

Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, and Claude Kirchner. 2007. Towards a sharing strategy for the graph rewriting calculus. 7th International Workshop on Reduction Strategies in Rewriting and Programming - WRS 2007, Elsevier.

@inproceedings{baldan:inria-00186141,
  title = {{Towards a sharing strategy for the graph rewriting calculus}},
  author = {Baldan, Paolo and Bertolissi, Clara and Cirstea, Horatiu and Kirchner, Claude},
  url = {https://inria.hal.science/inria-00186141},
  booktitle = {{7th International Workshop on Reduction Strategies in Rewriting and Programming - WRS 2007}},
  address = {Paris, France},
  editor = {Giesl, J{\"u}rgen},
  publisher = {{Elsevier}},
  series = {Electronic Notes in Theoretical Computer Science},
  volume = {204},
  year = {2007},
  month = jun,
  hal_id = {inria-00186141},
  hal_version = {v1}
}

Dorina Ghindici, Isabelle Simplot-Ryl, and Jean-Marc Talbot. 2007. A sound dependency analysis for secure information flow (extended version). INRIA. PDF-link

@techreport{ghindici:inria-00185263,
  title = {{A sound dependency analysis for secure information flow (extended version)}},
  author = {Ghindici, Dorina and Simplot-Ryl, Isabelle and Talbot, Jean-Marc},
  url = {https://inria.hal.science/inria-00185263},
  type = {Research Report},
  number = {RT-0347},
  institution = {{INRIA}},
  year = {2007},
  keywords = {Information flow ; static analysis ; Java bytecode ; abstract interpretation ; non-interference},
  pdf = {https://inria.hal.science/inria-00185263v3/file/RT-0347.pdf},
  hal_id = {inria-00185263},
  hal_version = {v3}
}

Emmanuel Filiot, Jean-Marc Talbot, and Sophie Tison. 2007. Satisfiability of a Spatial Logic with Tree Variables. 16th EACSL Annual Conference on Computer Science and Logic, Springer Berlin / Heidelberg, 130–145. DOI-link PDF-link

@inproceedings{filiot:inria-00148462,
  title = {{Satisfiability of a Spatial Logic with Tree Variables}},
  author = {Filiot, Emmanuel and Talbot, Jean-Marc and Tison, Sophie},
  url = {https://inria.hal.science/inria-00148462},
  booktitle = {{16th EACSL Annual Conference on Computer Science and Logic}},
  address = {Lausanne, Switzerland},
  publisher = {{Springer Berlin / Heidelberg}},
  series = {Lecture Notes in Computer Science},
  volume = {4646},
  pages = {130-145},
  year = {2007},
  month = sep,
  doi = {10.1007/978-3-540-74915-8\_13},
  keywords = {logic ; tree automata ; tree isomorphisms ; query ; MSO},
  pdf = {https://inria.hal.science/inria-00148462v1/file/csl07-tql.pdf},
  hal_id = {inria-00148462},
  hal_version = {v1}
}

Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, and Sophie Tison. 2007. Polynomial Time Fragments of XPath with Variables. 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 205–214. PDF-link
```
@inproceedings{filiot:inria-00135678,
  title = {{Polynomial Time Fragments of XPath with Variables}},
  author = {Filiot, Emmanuel and Niehren, Joachim and Talbot, Jean-Marc and Tison, Sophie},
  url = {https://inria.hal.science/inria-00135678},
  booktitle = {{26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems}},
  address = {Beijing, China},
  pages = {205-214},
  year = {2007},
  month = jun,
  pdf = {https://inria.hal.science/inria-00135678/file/0.pdf},
  hal_id = {inria-00135678},
  hal_version = {v1}
}
```

Yannick Chevalier, Denis Lugiez, and Michael Rusinowitch. 2007. Toward an Automatic Analysis of Web Service Security. . PDF-link

@techreport{chevalier:inria-00133996,
  title = {{Toward an Automatic Analysis of Web Service Security}},
  author = {Chevalier, Yannick and Lugiez, Denis and Rusinowitch, Michael},
  url = {https://inria.hal.science/inria-00133996},
  type = {Research Report},
  pages = {40},
  year = {2007},
  keywords = {Security ; web services ; cryptographic protocols ; combination of decision procedures ; equational theories ; rewriting},
  pdf = {https://inria.hal.science/inria-00133996v1/file/pmain.pdf},
  hal_id = {inria-00133996},
  hal_version = {v1}
}

Clara Bertolissi and Claude Kirchner. 2007. The Rewriting Calculus as a Combinatory Reduction System. Tenth International Conference on Foundations of Software Science and Computations Structures - FoSSaCS 2007, Springer-Verlag, 78–92. DOI-link

@inproceedings{bertolissi:inria-00121792,
  title = {{The Rewriting Calculus as a Combinatory Reduction System}},
  author = {Bertolissi, Clara and Kirchner, Claude},
  url = {https://inria.hal.science/inria-00121792},
  booktitle = {{Tenth International Conference on Foundations of Software Science and Computations Structures - FoSSaCS 2007}},
  address = {Braga, Portugal},
  editor = {Seidl, Helmut},
  publisher = {{Springer-Verlag}},
  series = {Lecture Notes in Computer Science},
  volume = {4423},
  pages = {78-92},
  year = {2007},
  month = mar,
  doi = {10.1007/978-3-540-71389-0\_7},
  keywords = {rewriting calculus ; CRS},
  hal_id = {inria-00121792},
  hal_version = {v1}
}

2006

Stéphane Demri and Denis Lugiez. 2006. Presburger Modal Logic Is PSPACE-Complete. IJCAR 2006 - Automated Reasoning, Third International Joint Conference, Springer, 541–556. DOI-link PDF-link

@inproceedings{demri:hal-03201487,
  title = {{Presburger Modal Logic Is PSPACE-Complete}},
  author = {Demri, St{\'e}phane and Lugiez, Denis},
  url = {https://hal.science/hal-03201487},
  booktitle = {{IJCAR 2006 - Automated Reasoning, Third International Joint Conference}},
  address = {Seattle, United States},
  organization = {{Ulrich Furbach and Natarajan Shankar}},
  editor = {Furbach, Ulrich and Shankar, Natarajan},
  publisher = {{Springer}},
  pages = {541-556},
  year = {2006},
  month = aug,
  doi = {10.1007/11814771\_44},
  keywords = {sheaves logic SL ; tree model property ; Presburger arithmetic ; modal logic ; graded modal logic ; regularity constraint ; graded modality ; complexity ; PSPACE},
  pdf = {https://hal.science/hal-03201487/file/dl-final-ijcar.pdf},
  hal_id = {hal-03201487},
  hal_version = {v1}
}

Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, and Ralf Treinen. 2006. Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or. Automata, Languages and Programming, 33rd International Colloquium, {ICALP}. PDF-link
```
@inproceedings{delaune:hal-01759947,
  title = {{Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or}},
  author = {Delaune, St{\'e}phanie and Lafourcade, Pascal and Lugiez, Denis and Treinen, Ralf},
  url = {https://hal.science/hal-01759947},
  booktitle = {{Automata, Languages and Programming, 33rd International Colloquium,                \{ICALP\}}},
  address = {Venise, Italy},
  year = {2006},
  month = jul,
  pdf = {https://hal.science/hal-01759947/file/DLLT-icalp06.pdf},
  hal_id = {hal-01759947},
  hal_version = {v1}
}
```

Silvano Dal Zilio and Denis Lugiez. 2006. XML schema, tree logic and sheaves automata. Applicable Algebra in Engineering, Communication and Computing 17: 337–377. DOI-link PDF-link

@article{dalzilio:hal-00109288,
  title = {{XML schema, tree logic and sheaves automata}},
  author = {Dal Zilio, Silvano and Lugiez, Denis},
  url = {https://hal.science/hal-00109288},
  journal = {{Applicable Algebra in Engineering, Communication and Computing}},
  publisher = {{Springer Verlag}},
  volume = {17},
  pages = {337-377},
  year = {2006},
  month = oct,
  doi = {10.1007/s00200-006-0016-7},
  keywords = {Tree automata ; Modal logic ; XML ; XML schema},
  pdf = {https://hal.science/hal-00109288/file/xml.pdf},
  hal_id = {hal-00109288},
  hal_version = {v1}
}

Patricia Bouyer, Nicolas Markey, and Pierre-Alain Reynier. 2006. Robust Model-Checking of Linear-Time Properties in Timed Automata. Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN’06), Springer, 238–249. DOI-link PDF-link

@inproceedings{bouyer:hal-01194610,
  title = {{Robust Model-Checking of Linear-Time Properties in Timed Automata}},
  author = {Bouyer, Patricia and Markey, Nicolas and Reynier, Pierre-Alain},
  url = {https://hal.science/hal-01194610},
  booktitle = {{Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN'06)}},
  address = {Valdivia, Chile},
  editor = {Correa and R., Jose and Hevia and Alejandro and Kiwi and Marcos},
  publisher = {{Springer}},
  series = {Lecture Notes in Computer Science},
  volume = {3887},
  pages = {238-249},
  year = {2006},
  doi = {10.1007/11682462\_25},
  pdf = {https://hal.science/hal-01194610/file/BMR-latin06.pdf},
  hal_id = {hal-01194610},
  hal_version = {v1}
}

Clara Bertolissi. 2006. Developments in the rewriting calculus. . PDF-link
```
@techreport{bertolissi:inria-00121212,
  title = {{Developments in the rewriting calculus}},
  author = {Bertolissi, Clara},
  url = {https://inria.hal.science/inria-00121212},
  type = {Research Report},
  year = {2006},
  pdf = {https://inria.hal.science/inria-00121212v3/file/paper.pdf},
  hal_id = {inria-00121212},
  hal_version = {v3}
}
```

2005

Pascal Lafourcade, Denis Lugiez, and Ralf Treinen. 2005. Intruder Deduction for AC-like Equational Theories with Homomorphisms. Term Rewriting and Applications, 16th International Conference, RTA’05. PDF-link
```
@inproceedings{lafourcade:hal-01759946,
  title = {{Intruder Deduction for AC-like Equational Theories with Homomorphisms}},
  author = {Lafourcade, Pascal and Lugiez, Denis and Treinen, Ralf},
  url = {https://hal.science/hal-01759946},
  booktitle = {{Term Rewriting and Applications, 16th International Conference, RTA'05}},
  address = {Nara, Japan},
  year = {2005},
  month = apr,
  pdf = {https://hal.science/hal-01759946/file/Rapport.pdf},
  hal_id = {hal-01759946},
  hal_version = {v1}
}
```

Karine Altisen, Nicolas Markey, Pierre-Alain Reynier, and Stavros Tripakis. 2005. Implémentabilité des automates temporisés. Actes du 5ème Colloque sur la Modélisation des Systèmes Réactifs (MSR’05), Hermès, 395–406. PDF-link

@inproceedings{altisen:hal-01194614,
  title = {{Impl{\'e}mentabilit{\'e} des automates temporis{\'e}s}},
  author = {Altisen, Karine and Markey, Nicolas and Reynier, Pierre-Alain and Tripakis, Stavros},
  url = {https://hal.science/hal-01194614},
  booktitle = {{Actes du 5{\`e}me Colloque sur la Mod{\'e}lisation des Syst{\`e}mes R{\'e}actifs (MSR'05)}},
  address = {Autrans, France},
  editor = {Alla and Hassane and Rutten and {\'E}ric},
  publisher = {{Herm{\`e}s}},
  pages = {395-406},
  year = {2005},
  pdf = {https://hal.science/hal-01194614/file/MSR05-impl.pdf},
  hal_id = {hal-01194614},
  hal_version = {v1}
}

Nicolas Baudru and Rémi Morin. 2005. Polynomial Synthesis of Asynchronous Automata. Retrieved from https://hal.science/hal-00005587. The MOdelling and VErification (MOVE) team. PDF-link
```
@unpublished{baudru:hal-00005587,
  title = {{Polynomial Synthesis of Asynchronous Automata}},
  author = {Baudru, Nicolas and Morin, R{\'e}mi},
  url = {https://hal.science/hal-00005587},
  note = {The MOdelling and VErification (MOVE) team},
  year = {2005},
  month = jun,
  keywords = {concurrency theory ; automata ; formal languages},
  pdf = {https://hal.science/hal-00005587/file/baudru_morin_hal.pdf},
  hal_id = {hal-00005587},
  hal_version = {v1}
}
```

2003

Roberto Amadio, Denis Lugiez, and Vincent Vanackere. 2003. On the symbolic reduction of processes with cryptographic functions. Theoretical Computer Science 290: 695–740.
```
@article{amadio:hal-00147013,
  title = {{On the symbolic reduction of processes with cryptographic functions}},
  author = {Amadio, Roberto and Lugiez, Denis and Vanackere, Vincent},
  url = {https://hal.science/hal-00147013},
  journal = {{Theoretical Computer Science}},
  publisher = {{Elsevier}},
  volume = {290},
  pages = {695-740},
  year = {2003},
  month = jan,
  hal_id = {hal-00147013},
  hal_version = {v1}
}
```
Roberto Amadio and Denis Lugiez. 2003. CONCUR 2003 - Concurrency Theory, 14th International Conference. Springer Verlag.
```
@book{amadio:hal-00146995,
  title = {{CONCUR 2003 - Concurrency Theory, 14th International Conference}},
  author = {Amadio, Roberto and Lugiez, Denis},
  url = {https://hal.science/hal-00146995},
  publisher = {{Springer Verlag}},
  pages = {512},
  year = {2003},
  month = sep,
  hal_id = {hal-00146995},
  hal_version = {v1}
}
```

2000

Jean-Marc Talbot, Philippe Devienne, and Sophie Tison. 2000. Generalized Definite Set Constraints. Constraints 5, 1/2: 161–202. DOI-link
```
@article{talbot:hal-02193768,
  title = {{Generalized Definite Set Constraints}},
  author = {Talbot, Jean-Marc and Devienne, Philippe and Tison, Sophie},
  url = {https://hal.science/hal-02193768},
  journal = {{Constraints}},
  publisher = {{Springer Verlag}},
  volume = {5},
  number = {1/2},
  pages = {161-202},
  year = {2000},
  doi = {10.1023/A:1009826603139},
  hal_id = {hal-02193768},
  hal_version = {v1}
}
```