Handling global conditions in parameterized system verification, Proc. of CAV'99, pp.134-145, 1999. ,
An optimal construction of Hanf sentences, Journal of Applied Logic, vol.10, issue.2, pp.179-186, 2012. ,
DOI : 10.1016/j.jal.2012.01.002
URL : https://hal.archives-ouvertes.fr/hal-00776607
Message-passing automata are expressively equivalent to EMSO logic, Theoretical Computer Science, vol.358, issue.2-3, pp.150-172, 2006. ,
DOI : 10.1016/j.tcs.2006.01.014
Verification of parametric concurrent systems with prioritised fifo resource management. Formal Methods in System Design, pp.129-172, 2008. ,
Reasoning about networks with many identical finite state processes, Information and Computation, vol.81, issue.1, pp.13-31, 1989. ,
DOI : 10.1016/0890-5401(89)90026-6
Weak second order logic and finite automata, Z. Math. Logik, Grundlag. Math, vol.5, pp.66-62, 1960. ,
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences, Proc. of OPODIS'10, pp.119-134, 2010. ,
DOI : 10.1007/3-540-61440-0_163
URL : https://hal.archives-ouvertes.fr/hal-00726071
Parameterized Verification of Ad Hoc Networks, Proc. of CONCUR'10, 2010. ,
DOI : 10.1007/978-3-642-15375-4_22
Decision problems of finite automata design and related arithmetics, Transactions of the American Mathematical Society, vol.98, issue.1, pp.21-52, 1961. ,
DOI : 10.1090/S0002-9947-1961-0139530-9
On Reasoning About Rings, International Journal of Foundations of Computer Science, vol.14, issue.04, pp.527-550, 2003. ,
DOI : 10.1142/S0129054103001881
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces, Information and Computation, vol.208, issue.7, pp.797-816, 2010. ,
DOI : 10.1016/j.ic.2009.12.003
URL : https://hal.archives-ouvertes.fr/hal-00779916
Asynchronous Games over Tree Architectures, Proc. of ICALP'13, pp.275-286, 2013. ,
DOI : 10.1007/978-3-642-39212-2_26
URL : https://hal.archives-ouvertes.fr/hal-00916615
A Kleene theorem and model checking algorithms for existentially bounded communicating automata, Information and Computation, vol.204, issue.6, pp.920-956, 2006. ,
DOI : 10.1016/j.ic.2006.01.005
URL : https://hal.archives-ouvertes.fr/hal-00306261
On communicating automata with bounded channels, Fundam. Inform, vol.80, issue.1-3, pp.147-167, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00306256
Reasoning about systems with many processes, Journal of the ACM, vol.39, issue.3, pp.675-735, 1992. ,
DOI : 10.1145/146637.146681
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.2632
Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract), Proc. of WG'09, pp.154-165, 2010. ,
DOI : 10.1007/978-3-642-11409-0_14
A theory of regular MSC languages, Information and Computation, vol.202, issue.1, pp.1-38, 2005. ,
DOI : 10.1016/j.ic.2004.08.004
Parameterized synthesis, Proc. of TACAS'12, pp.362-376, 2012. ,
Shrinking games and local formulas, Annals of Pure and Applied Logic, vol.128, issue.1-3, pp.215-225, 2004. ,
DOI : 10.1016/j.apal.2004.01.004
URL : http://doi.org/10.1016/j.apal.2004.01.004
Regular sets of infinite message sequence charts, Information and Computation, vol.187, issue.1, pp.80-109, 2003. ,
DOI : 10.1016/S0890-5401(03)00123-8
Local normal forms for first-order logic with applications to games and automata, Discrete Mathematics & Theoretical Computer Science, vol.3, issue.3, pp.109-124, 1999. ,
DOI : 10.1007/BFb0028580
URL : https://hal.archives-ouvertes.fr/hal-00958930
Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical Systems Theory, vol.12, issue.1, pp.57-81, 1968. ,
DOI : 10.1007/BF01691346
Elements of an automata theory over partial orders, Proc. of POMIV 1996, 1996. ,
Finite automata and monadic second order logic. Siberian Math In Russian; English translation in Amer, J Math. Soc. Transl, vol.3, issue.59, pp.103-131, 1962. ,
Notes on finite asynchronous automata, RAIRO - Theoretical Informatics and Applications, vol.21, issue.2, pp.99-135, 1987. ,
DOI : 10.1051/ita/1987210200991