( en | de | ru )

 

Disambiguation of "Reynier, Pierre-Alain"

Author of the publication

copydeleteadd this publication to your clipboard
A Generalised Twinning Property for Minimisation of Cost Register Automata.

, , and . LICS, page 857-866. ACM, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Pierre-Alain Avouac

Pierre-Alain Dupont

Pierre-Alain Weiß

Pierre-Alain Loizeau

Pierre-Alain Mariaux

 

Other publications of authors with the same name

Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning., and . Petri Nets, volume 6709 of Lecture Notes in Computer Science, page 69-88. Springer, (2011)Visibly Pushdown Transducers with Well-Nested Outputs., and . Int. J. Found. Comput. Sci., 27 (2): 235-258 (2016)On Characteristic Formulae for Event-Recording Automata., and . FICS, page 70-78. Institute of Cybernetics, (2009)Robustness of Time Petri Nets under Guard Enlargement., , , and . Fundam. Informaticae, 143 (3-4): 207-234 (2016)Synthesis of Data Word Transducers., , and . Log. Methods Comput. Sci., (2021)Extended Timed Automata and Time Petri Nets., , and . ACSD, page 91-100. IEEE Computer Society, (2006)On characteristic formulae for Event-Recording Automata., and . RAIRO Theor. Informatics Appl., 47 (1): 69-96 (2013)Synthesis of Data Word Transducers., , and . CONCUR, volume 140 of LIPIcs, page 24:1-24:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Undecidability Results for Timed Automata with Silent Transitions., , and . Fundam. Informaticae, 92 (1-2): 1-25 (2009)Robust Analysis of Timed Automata via Channel Machines., , and . FoSSaCS, volume 4962 of Lecture Notes in Computer Science, page 157-171. Springer, (2008)