( en | de | ru )

 

Disambiguation of "Sangnier, Arnaud"

Author of the publication

copydeleteadd this publication to your clipboard
On the Verification of Timed Ad Hoc Networks.

, , , , and . FORMATS, volume 6919 of Lecture Notes in Computer Science, page 256-270. Springer, (2011)

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.

Arnaud Mende

Arnaud Moris

Julien Arnaud

Arnaud Dewalque

Arnaud Casteigts

 

Other publications of authors with the same name

On the Parameterized Verification of Abstract Models of Contact Tracing Protocols., , and . OVERLAY@GandALF, volume 2987 of CEUR Workshop Proceedings, page 61-66. CEUR-WS.org, (2021)Reachability in Distributed Memory Automata., , and . CSL, volume 183 of LIPIcs, page 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Weak Time Petri Nets Strike Back!., and . CONCUR, volume 5710 of Lecture Notes in Computer Science, page 557-571. Springer, (2009)On the Verification of Timed Ad Hoc Networks., , , , and . FORMATS, volume 6919 of Lecture Notes in Computer Science, page 256-270. Springer, (2011)Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic., , and . RP, volume 8762 of Lecture Notes in Computer Science, page 85-97. Springer, (2014)From Time Petri Nets to Timed Automata: An Untimed Approach., , , and . TACAS, volume 4424 of Lecture Notes in Computer Science, page 216-230. Springer, (2007)On the Formalization of Decentralized Contact Tracing Protocols., , , , and . OVERLAY, volume 2785 of CEUR Workshop Proceedings, page 65-70. CEUR-WS.org, (2020)Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous., , and . CONCUR, volume 279 of LIPIcs, page 7:1-7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks., , , and . FSTTCS, volume 18 of LIPIcs, page 289-300. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property?, and . ATVA, volume 9938 of Lecture Notes in Computer Science, page 89-105. (2016)