( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized verification of algorithms for oblivious robots on a ring.

, , , и . Formal Methods Syst. Des., 56 (1): 55-89 (2020)

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.

Arnaud Moris

Julien Arnaud

Arnaud Mende

Arnaud Dewalque

Arnaud Casteigts

 

Другие публикации лиц с тем же именем

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