André Arnold

74 papers A* 4A 2B 6Journal 46Unranked 12
YearRankTypeTitle / Venue / Authors
2022 J jnl
Affine Completeness of Some Free Binary Algebras.
Fundam. Informaticae
André Arnold, Patrick Cégielski, Irène Guessarian
2021 B conf
A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation.
CSL
André Arnold, Damian Niwinski, Pawel Parys
2021 J jnl
Affine completeness of some free binary algebras.
CoRR
André Arnold, Patrick Cégielski, Irène Guessarian
2021 J jnl
The algebra of binary trees is affine complete.
Discret. Math. Theor. Comput. Sci.
André Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian
2020 J jnl
The algebra of binary trees is affine complete.
CoRR
André Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian
2014 J jnl
On the Separation Question for Tree Languages.
Theory Comput. Syst.
André Arnold, Henryk Michalewski, Damian Niwinski
2012 A conf
On the separation question for tree languages.
STACS
André Arnold, Henryk Michalewski, Damian Niwinski
2008 — conf
Nondeterministic controllers of nondeterministic processes.
Logic and Automata
André Arnold, Igor Walukiewicz
2008 — conf
On the topological complexity of tree languages.
Logic and Automata
André Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski
2007 J jnl
Continuous Separation of Game Languages.
Fundam. Informaticae
André Arnold, Damian Niwinski
2005 — conf
A generic approach to the control of discrete event systems.
CDC/ECC
André Arnold, Xavier Briand, Gérald Point, Aymeric Vincent
2005 J jnl
Ambiguous classes in mu-calculi hierarchies.
Theor. Comput. Sci.
Luigi Santocanale, André Arnold
2003 B conf
Ambiguous Classes in the Games µ-Calculus Hierarchy.
FoSSaCS
André Arnold, Luigi Santocanale
2003 J jnl
Games for synthesis of controllers with partial observation.
Theor. Comput. Sci.
André Arnold, Aymeric Vincent, Igor Walukiewicz
2003 — conf
On Ambiguous Classes in the mu-Calculus Hierarchy of Tree Languages.
FICS
André Arnold, Luigi Santocanale
2002 J jnl
Nivat's processes and their synchronization.
Theor. Comput. Sci.
André Arnold
2001 A* conf
The Hierarchy inside Closed Monadic Sigma
LICS
André Arnold, Giacomo Lenzi, Jerzy Marcinkowski
1999 J jnl
The AltaRica Formalism for Describing Concurrent Systems.
Fundam. Informaticae
André Arnold, Gérald Point, Alain Griffault, Antoine Rauzy
1999 J jnl
p329 The µ-calculus alternation-depth hierarchy is strict on binary trees.
RAIRO Theor. Informatics Appl.
André Arnold
1998 — conf
Synchronized Products of Transition Systems and Their Analysis.
ICATPN
André Arnold
1997 J jnl
A Selection Property of the Boolean µ-Calculus and Some of its Applications.
RAIRO Theor. Informatics Appl.
André Arnold
1997 J jnl
Recognizable Subsets of the Two Letter Plactic Monoid.
Inf. Process. Lett.
André Arnold, Mathias Kanta, Daniel Krob
1997 J jnl
The Embedded Software of an Electricity Meter: An Experience in Using Formal Methods in an Industrial Project.
Sci. Comput. Program.
André Arnold, Didier Bégay, Jean-Pierre Radoux
1996 J jnl
A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal.
J. Parallel Distributed Comput.
Mohamed Naimi, Michel Tréhel, André Arnold
1996 J jnl
An Algebraic Characterization of Observational Equivalence.
Theor. Comput. Sci.
André Arnold, Ilaria Castellani
1996 — conf
An Example of Use of Formal Methods to Debug an Embedded Software.
FME
André Arnold, Didier Bégay, Jean-Pierre Radoux
1996 — conf
The Embedded Software of an Electrical Meter: An Experiment in Using Formal Methods in an Industrial Project.
AMAST
André Arnold, Didier Bégay, Jean-Pierre Radoux
1995 J jnl
A Topological Property of Rational omega-Languages.
Theor. Comput. Sci.
André Arnold
1995 J jnl
A relative of the Thue-Morse sequence.
Discret. Math.
Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan
1995 J jnl
An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Lemma.
Theor. Comput. Sci.
André Arnold
1995 J jnl
Automatic Verification of Properties in Transition Systems.
Softw. Pract. Exp.
André Arnold, Srecko Brlek
1994 — book
Construction and Analysis of Transition Systems with MEC
André Arnold, Didier Bégay, Paul Crubillé
1994 — book
Finite transition systems - semantics of communicating systems.
André Arnold
1994 A conf
Hypertransition Systems.
STACS
André Arnold
1993 B conf
Equivalences and Preorders of Transition Systems.
MFCS
André Arnold, Anne Dicky
1993 — conf
Verification and Comparison of Transition Systems.
TAPSOFT
André Arnold
1992 J jnl
A note about minimal non-deterministic automata.
Bull. EATCS
André Arnold, Anne Dicky, Maurice Nivat
1992 — ch.
Fixed point characterization of weak monadic logic definable sets of trees.
Tree Automata and Languages
André Arnold, Damian Niwinski
1991 — conf
MEC: A System for Constructing and Analysis Transition Systems.
AMAST
André Arnold
1990 — ed.
CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings
CAAP
André Arnold
1990 J jnl
Fixed Point Characterization of Büchi Automata on Infinite Trees.
J. Inf. Process. Cybern.
André Arnold, Damian Niwinski
1989 J jnl
An Algebraic Characterization of Transition System Equivalences
Inf. Comput.
André Arnold, Anne Dicky
1989 J jnl
An Example of Sequentialization of a Parallel Algorithm.
Sci. Comput. Program.
André Arnold
1989 — conf
MEC: A System for Constructing and Analysing Transition Systems.
Automatic Verification Methods for Finite State Systems
André Arnold
1989 J jnl
Optimal Word Chains for the Thue-Morse Word
Inf. Comput.
André Arnold, Srecko Brlek
1989 J jnl
Recognizable sets of finite bilabelled transition systems.
Bull. EATCS
André Arnold
1988 J jnl
A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems.
Inf. Process. Lett.
André Arnold, Paul Crubillé
1988 J jnl
Logical Definability of Fixed Points.
Theor. Comput. Sci.
André Arnold
1985 J jnl
A Syntactic Congruence for Rational omega-Language.
Theor. Comput. Sci.
André Arnold
1984 — conf
Deterministic and non ambiguous rational omega-languages.
Automata on Infinite Words
André Arnold
1984 — conf
Un modèle de description de protocoles: les reéseaux fermés d'atuomates triphasés.
Symposium on Programming
André Arnold, Pascal Guitton
1983 J jnl
Rational omega-Languages are Non-Ambiguous.
Theor. Comput. Sci.
André Arnold
1983 A* conf
Topological Characterizations of Infinite Behaviours of Transition Systems.
ICALP
André Arnold
1982 J jnl
Morphismes et Bimorphismes d'Arbres.
Theor. Comput. Sci.
André Arnold, Max Dauchet
1982 J jnl
Synchronized Behaviours of Processes and Rational Relations.
Acta Informatica
André Arnold
1981 J jnl
Sémantique des Processus Communicants.
RAIRO Theor. Informatics Appl.
André Arnold
1980 B conf
Controlling Behaviours of Systems: Some Basic Concepts and some Applications.
MFCS
André Arnold, Maurice Nivat
1980 J jnl
Formal Computations of Non Deterministic Recursive Program Schemes.
Math. Syst. Theory
André Arnold, Maurice Nivat
1980 J jnl
Le Théorème de Transversale Rationnelle dans les Langages d'Arbres.
Math. Syst. Theory
André Arnold
1980 J jnl
Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs.
Theor. Comput. Sci.
André Arnold, Maurice Nivat
1980 J jnl
The metric space of infinite trees. Algebraic and topological properties.
Fundam. Informaticae
André Arnold, Maurice Nivat
1980 J jnl
Une Propriété des Forêts Algébriques "de Greibach"
Inf. Control.
André Arnold, Bernard Leguy
1979 J jnl
A New Proof of two Theorems about Rational Transductions.
Theor. Comput. Sci.
André Arnold, Michel Latteux
1979 B conf
Forets de Greibach et homomorphismes inverses.
FCT
André Arnold, Bernard Leguy
1979 J jnl
Théorie des Magmoïdes (II).
RAIRO Theor. Informatics Appl.
André Arnold, Max Dauchet
1978 J jnl
Forêts Algébriques et Homomorphismes Inverses
Inf. Control.
André Arnold, Max Dauchet
1978 A* conf
Sul l'inversion des morphisms d'arbres.
ICALP
André Arnold, Max Dauchet
1978 J jnl
Sémantique algébrique de l'appel par valeur.
RAIRO Theor. Informatics Appl.
André Arnold
1978 J jnl
Théorie des magmoïdes.
RAIRO Theor. Informatics Appl.
André Arnold, Max Dauchet
1978 J jnl
Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables.
Math. Syst. Theory
André Arnold, Max Dauchet
1977 B conf
Non Deterministic Recursive Program Schemes.
FCT
André Arnold, Maurice Nivat
1976 A* conf
Bi-transductions de forêts.
ICALP
André Arnold, Max Dauchet
1976 J jnl
Transductions de Forets Reconnaissables Monadiques Forets Coregulieres.
RAIRO Theor. Informatics Appl.
André Arnold, Max Dauchet
1976 J jnl
Un Théorème de Duplication pour les Forêts Algébriques.
J. Comput. Syst. Sci.
André Arnold, Max Dauchet