André Arnold

André Arnold, Henryk Michalewski, Damian Niwinski: On the separation question for tree languages. STACS 2012: 396-407

André Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski: On the topological complexity of tree languages. Logic and Automata 2008: 9-28

André Arnold, Igor Walukiewicz: Nondeterministic controllers of nondeterministic processes. Logic and Automata 2008: 29-52

André Arnold, Damian Niwinski: Continuous Separation of Game Languages. Fundam. Inform. 81(1-3): 19-28 (2007)

Luigi Santocanale, André Arnold: Ambiguous classes in mu-calculi hierarchies. Theor. Comput. Sci. 333(1-2): 265-296 (2005)

André Arnold, Aymeric Vincent, Igor Walukiewicz: Games for synthesis of controllers with partial observation. Theor. Comput. Sci. 1(303): 7-34 (2003)

André Arnold, Luigi Santocanale: Ambiguous Classes in the Games µ-Calculus Hierarchy. FoSSaCS 2003: 70-86

André Arnold: Nivat's processes and their synchronization. Theor. Comput. Sci. 281(1-2): 31-36 (2002)

André Arnold, Giacomo Lenzi, Jerzy Marcinkowski: The Hierarchy inside Closed Monadic Sigma₁ Collapses on the Infinite Binary Tree. LICS 2001: 157-166

André Arnold, Gérald Point, Alain Griffault, Antoine Rauzy: The AltaRica Formalism for Describing Concurrent Systems. Fundam. Inform. 40(2-3): 109-124 (1999)

André Arnold: p329 The µ-calculus alternation-depth hierarchy is strict on binary trees. ITA 33(4/5): 329-340 (1999)

André Arnold: Synchronized Products of Transition Systems and Their Analysis. ICATPN 1998: 26-27

André Arnold, M. Kanta, Daniel Krob: Recognizable Subsets of the Two Letter Plactic Monoid. Inf. Process. Lett. 64(2): 53-59 (1997)

André Arnold: A Selection Property of the Boolean µ-Calculus and Some of its Applications. ITA 31(4): 371-384 (1997)

André Arnold, Didier Bégay, Jean-Pierre Radoux: The Embedded Software of an Electricity Meter: An Experience in Using Formal Methods in an Industrial Project. Sci. Comput. Program. 28(2-3): 93-110 (1997)

Mohamed Naimi, Michel Trehel, André Arnold: A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal. J. Parallel Distrib. Comput. 34(1): 1-13 (1996)

André Arnold, Ilaria Castellani: An Algebraic Characterization of Observational Equivalence. Theor. Comput. Sci. 156(1&2): 289-299 (1996)

André Arnold, Didier Bégay, Jean-Pierre Radoux: The Embedded Software of an Electrical Meter: An Experiment in Using Formal Methods in an Industrial Project. AMAST 1996: 19-32

André Arnold, Didier Bégay, Jean-Pierre Radoux: An Example of Use of Formal Methods to Debug an Embedded Software. FME 1996: 649-661

Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan: A relative of the Thue-Morse sequence. Discrete Mathematics 139(1-3): 455-461 (1995)

André Arnold, Srecko Brlek: Automatic Verification of Properties in Transition Systems. Softw., Pract. Exper. 25(6): 579-596 (1995)

André Arnold: An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Lemma. Theor. Comput. Sci. 148(1): 121-132 (1995)

André Arnold: A Topological Property of Rational omega-Languages. Theor. Comput. Sci. 151(1): 29-36 (1995)

André Arnold: Finite transition systems - semantics of communicating systems. Prentice Hall international series in computer science, Prentice Hall 1994, isbn 978-0-13-092990-7, pp. I-VII, 1-177

André Arnold: Hypertransition Systems. STACS 1994: 327-338

André Arnold, Anne Dicky: Equivalences and Preorders of Transition Systems. MFCS 1993: 20-31

André Arnold: Verification and Comparison of Transition Systems. TAPSOFT 1993: 121-135

André Arnold, Anne Dicky, Maurice Nivat: A note about minimal non-deterministic automata. Bulletin of the EATCS 47: 166-169 (1992)

André Arnold, Damian Niwinski: Fixed point characterization of weak monadic logic definable sets of trees. Tree Automata and Languages 1992: 159-188

André Arnold: MEC: A System for Constructing and Analysis Transition Systems. AMAST 1991: 81-82

André Arnold, Damian Niwinski: Fixed Point Characterization of Büchi Automata on Infinite Trees. Elektronische Informationsverarbeitung und Kybernetik 26(8/9): 451-459 (1990)

André Arnold (Ed.): CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings. Lecture Notes in Computer Science 431, Springer 1990, isbn 3-540-52590-4

André Arnold: Recognizable sets of finite bilabelled transition systems. Bulletin of the EATCS 38: 123-134 (1989)

André Arnold, Anne Dicky: An Algebraic Characterization of Transition System Equivalences. Inf. Comput. 82(2): 198-229 (1989)

André Arnold, Srecko Brlek: Optimal Word Chains for the Thue-Morse Word. Inf. Comput. 83(2): 140-151 (1989)

André Arnold: An Example of Sequentialization of a Parallel Algorithm. Sci. Comput. Program. 13(1): 111-116 (1989)

André Arnold: MEC: A System for Constructing and Analysing Transition Systems. Automatic Verification Methods for Finite State Systems 1989: 117-132

André Arnold, Paul Crubille: A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems. Inf. Process. Lett. 29(2): 57-66 (1988)

André Arnold: Logical Definability of Fixed Points. Theor. Comput. Sci. 61: 289-297 (1988)

André Arnold: A Syntactic Congruence for Rational omega-Language. Theor. Comput. Sci. 39: 333-335 (1985)

André Arnold: Deterministic and non ambiguous rational omega-languages. Automata on Infinite Words 1984: 18-27

André Arnold, Pascal Guitton: Un modèle de description de protocoles: les reéseaux fermés d'atuomates triphasés. Symposium on Programming 1984: 1-12

André Arnold: Rational omega-Languages are Non-Ambiguous. Theor. Comput. Sci. 26: 221-223 (1983)

André Arnold: Topological Characterizations of Infinite Behaviours of Transition Systems. ICALP 1983: 28-38

André Arnold: Synchronized Behaviours of Processes and Rational Relations. Acta Inf. 17: 21-29 (1982)

André Arnold, Max Dauchet: Morphismes et Bimorphismes d'Arbres. Theor. Comput. Sci. 20: 33-93 (1982)

André Arnold: Sémantique des Processus Communicants. ITA 15(2): 103-139 (1981)

André Arnold, Maurice Nivat: The metric space of infinite trees. Algebraic and topological properties. Fundam. Inform. 3(4): 445-476 (1980)

André Arnold, Bernard Leguy: Une Propriété des Forêts Algébriques ``de Greibach''. Information and Control 46(2): 108-134 (1980)

André Arnold, Maurice Nivat: Formal Computations of Non Deterministic Recursive Program Schemes. Mathematical Systems Theory 13: 219-236 (1980)

André Arnold: Le Théorème de Transversale Rationnelle dans les Langages d'Arbres. Mathematical Systems Theory 13: 275-282 (1980)

André Arnold, Maurice Nivat: Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs. Theor. Comput. Sci. 11: 181-205 (1980)

André Arnold, Maurice Nivat: Controlling Behaviours of Systems: Some Basic Concepts and some Applications. MFCS 1980: 113-122

André Arnold, Max Dauchet: Théorie des Magmoïdes (II). ITA 13(2) (1979)

André Arnold, Michel Latteux: A New Proof of two Theorems about Rational Transductions. Theor. Comput. Sci. 8: 261-263 (1979)

André Arnold, Bernard Leguy: Forets de Greibach et homomorphismes inverses. FCT 1979: 31-37

André Arnold, Max Dauchet: Forêts Algébriques et Homomorphismes Inverses. Information and Control 37(2): 182-196 (1978)

André Arnold: Sémantique algébrique de l'appel par valeur. ITA 12(2) (1978)

André Arnold, Max Dauchet: Théorie des magmoïdes. ITA 12(3) (1978)

André Arnold, Max Dauchet: Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables. Mathematical Systems Theory 12: 103-128 (1978)

André Arnold, Max Dauchet: Sul l'inversion des morphisms d'arbres. ICALP 1978: 26-35

André Arnold, Maurice Nivat: Non Deterministic Recursive Program Schemes. FCT 1977: 12-21

André Arnold, Max Dauchet: Transductions de Forets Reconnaissables Monadiques Forets Coregulieres. ITA 10(1): 5-28 (1976)

André Arnold, Max Dauchet: Un Théorème de Duplication pour les Forêts Algébriques. J. Comput. Syst. Sci. 13(2): 223-244 (1976)

André Arnold, Max Dauchet: Bi-transductions de forêts. ICALP 1976: 74-86