Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson & Yih-Kuen Tsay (1996):
General Decidability Theorems for Infinite-State Systems.
In: Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science,,
pp. 313–321,
doi:10.1109/LICS.1996.561359.
Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier & Riccardo Traverso (2011):
On the Verification of Timed Ad Hoc Networks.
In: Formal Modeling and Analysis of Timed Systems - 9th International Conference, FORMATS,
pp. 256–270,
doi:10.1007/978-3-642-24310-3_18.
A. R. Balasubramanian, Nathalie Bertrand & Nicolas Markey (2018):
Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks.
In: Tools and Algorithms for the Construction and Analysis of Systems - 24th International Conference, TACAS,
pp. 38–54,
doi:10.1007/978-3-319-89963-3_3.
Nathalie Bertrand & Paulin Fournier (2013):
Parameterized Verification of Many Identical Probabilistic Timed Processes.
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS,
pp. 501–513,
doi:10.4230/LIPIcs.FSTTCS.2013.501.
Nathalie Bertrand, Paulin Fournier & Arnaud Sangnier (2014):
Playing with Probabilities in Reconfigurable Broadcast Networks.
In: Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS,
pp. 134–148,
doi:10.1007/978-3-642-54830-7_9.
Nathalie Bertrand, Paulin Fournier & Arnaud Sangnier (2015):
Distributed Local Strategies in Broadcast Networks.
In: 26th International Conference on Concurrency Theory, CONCUR,
pp. 44–57,
doi:10.4230/LIPIcs.CONCUR.2015.44.
Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier & Daniel Stan (2016):
Reachability in Networks of Register Protocols under Stochastic Schedulers.
In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016,
pp. 106:1–106:14,
doi:10.4230/LIPIcs.ICALP.2016.106.
Giorgio Delzanno, Arnaud Sangnier & Riccardo Traverso (2013):
Parameterized Verification of Broadcast Networks of Register Automata.
In: Reachability Problems - 7th International Workshop, RP,
pp. 109–121,
doi:10.1007/978-3-642-41036-9_11.
Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso & Gianluigi Zavattaro (2012):
On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks.
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS,
pp. 289–300,
doi:10.4230/LIPIcs.FSTTCS.2012.289.
Giorgio Delzanno, Arnaud Sangnier & Gianluigi Zavattaro (2010):
Parameterized Verification of Ad Hoc Networks.
In: CONCUR 2010 - Concurrency Theory, 21th International Conference,,
pp. 313–327,
doi:10.1007/978-3-642-15375-4_22.
Giorgio Delzanno, Arnaud Sangnier & Gianluigi Zavattaro (2011):
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks.
In: Foundations of Software Science and Computational Structures - 14th International Conference, FOSSACS,
pp. 441–455,
doi:10.1007/978-3-642-19805-2_30.
Giorgio Delzanno, Arnaud Sangnier & Gianluigi Zavattaro (2012):
Verification of Ad Hoc Networks with Node and Communication Failures.
In: Formal Techniques for Distributed Systems - Joint 14th IFIP WG 6.1 International Conference, FMOODS and 32nd IFIP WG 6.1 International Conference, FORTE,
pp. 235–250,
doi:10.1007/978-3-642-30793-5_15.
Giorgio Delzanno & Riccardo Traverso (2013):
Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks.
In: Language and Automata Theory and Applications - 7th International Conference, LATA 2013,
pp. 238–249,
doi:10.1007/978-3-642-37064-9_22.
Guoli Ding (1992):
Subgraphs and well-quasi-ordering.
Journal of Graph Theory 16(5),
pp. 489–502,
doi:10.1002/jgt.3190160509.
Catherine Dufourd, Alain Finkel & Philippe Schnoebelen (1998):
Reset Nets Between Decidability and Undecidability.
In: Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark,
pp. 103–115,
doi:10.1007/BFb0055044.
Javier Esparza (2014):
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS,
pp. 1–10,
doi:10.4230/LIPIcs.STACS.2014.1.
Alain Finkel & Philippe Schnoebelen (2001):
Well-structured transition systems everywhere!.
Theor. Comput. Sci. 256(1-2),
pp. 63–92,
doi:10.1016/S0304-3975(00)00102-X.
Steven M. German & A. Prasad Sistla (1992):
Reasoning about Systems with Many Processes.
J. ACM 39(3),
pp. 675–735,
doi:10.1145/146637.146681.
Alan J. Hoffman & Robert R. Singleton (1960):
On Moore Graphs with Diameters 2 and 3.
IBM Journal of Research and Development 4(5),
pp. 497–504,
doi:10.1147/rd.45.0497.
eptcs@eptcs.org