André Arnold - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 71 from 71

2022

Affine Completeness of Some Free Binary AlgebrasAndré Arnold, Patrick Cégielski, Irène Guessarian. FUIN, 186(1-4):27-44, 2022. [doi]

2021

The algebra of binary trees is affine completeAndré Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian. dmtcs, 23(2), 2021. [doi]

A Quasi-Polynomial Black-Box Algorithm for Fixed Point EvaluationAndré Arnold, Damian Niwinski, Pawel Parys. csl 2021: [doi]

2014

On the Separation Question for Tree LanguagesAndré Arnold, Henryk Michalewski, Damian Niwinski. mst, 55(4):833-855, 2014. [doi]

2012

On the separation question for tree languagesAndré Arnold, Henryk Michalewski, Damian Niwinski. STACS 2012: 396-407 [doi]

2008

Nondeterministic controllers of nondeterministic processesAndré Arnold, Igor Walukiewicz. BIRTHDAY 2008: 29-52

On the topological complexity of tree languagesAndré Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski. BIRTHDAY 2008: 9-28

2007

Continuous Separation of Game LanguagesAndré Arnold, Damian Niwinski. FUIN, 81(1-3):19-28, 2007. [doi]

2005

A generic approach to the control of discrete event systemsAndré Arnold, Xavier Briand, Gérald Point, Aymeric Vincent. cdc 2005: 1-5 [doi]

Ambiguous classes in mu-calculi hierarchiesLuigi Santocanale, André Arnold. TCS, 333(1-2):265-296, 2005. [doi]

2003

Ambiguous Classes in the Games µ-Calculus HierarchyAndré Arnold, Luigi Santocanale. fossacs 2003: 70-86 [doi]

On Ambiguous Classes in the mu-Calculus Hierarchy of Tree LanguagesAndré Arnold, Luigi Santocanale. fics 2003: 4-13 [doi]

Games for synthesis of controllers with partial observationAndré Arnold, Aymeric Vincent, Igor Walukiewicz. TCS, 1(303):7-34, 2003. [doi]

2002

Nivat s processes and their synchronizationAndré Arnold. TCS, 281(1-2):31-36, 2002. [doi]

2001

The Hierarchy inside Closed Monadic Sigma::1:: Collapses on the Infinite Binary TreeAndré Arnold, Giacomo Lenzi, Jerzy Marcinkowski. lics 2001: 157-166

1999

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

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

1998

Synchronized Products of Transition Systems and Their AnalysisAndré Arnold. apn 1998: 26-27 [doi]

1997

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

A Selection Property of the Boolean µ-Calculus and Some of its ApplicationsAndré Arnold. ita, 31(4):371-384, 1997.

Recognizable Subsets of the Two Letter Plactic MonoidAndré Arnold, M. Kanta, Daniel Krob. ipl, 64(2):53-59, 1997. [doi]

1996

1995

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

Automatic Verification of Properties in Transition SystemsAndré Arnold, Srecko Brlek. SPE, 25(6):579-596, 1995.

An Initial Semantics for the mu-Calculus on Trees and Rabin s Complementation LemmaAndré Arnold. TCS, 148(1):121-132, 1995. [doi]

A Topological Property of Rational omega-LanguagesAndré Arnold. TCS, 151(1):29-36, 1995. [doi]

1994

Hypertransition SystemsAndré Arnold. STACS 1994: 327-338

Finite transition systems - semantics of communicating systemsAndré Arnold. Prentice Hall international series in computer science, Prentice Hall, 1994.

Construction and Analysis of Transition Systems with MECAndré Arnold, Didier Bégay, Paul Crubillé. Volume 3 of AMAST Series in Computing, World Scientific, 1994. [doi]

1993

Equivalences and Preorders of Transition SystemsAndré Arnold, Anne Dicky. mfcs 1993: 20-31

Verification and Comparison of Transition SystemsAndré Arnold. tapsoft 1993: 121-135

1992

Fixed point characterization of weak monadic logic definable sets of treesAndré Arnold, Damian Niwinski. In Tree Automata and Languages. pages 159-188, 1992.

A note about minimal non-deterministic automataAndré Arnold, Anne Dicky, Maurice Nivat. eatcs, 47:166-169, 1992.

1991

MEC: A System for Constructing and Analysis Transition SystemsAndré Arnold. amast 1992: 81-82

1990

Fixed Point Characterization of Büchi Automata on Infinite TreesAndré Arnold, Damian Niwinski. eik, 26(8/9):451-459, 1990.

1989

Optimal Word Chains for the Thue-Morse WordAndré Arnold, Srecko Brlek. iandc, 83(2):140-151, November 1989.

MEC: A System for Constructing and Analysing Transition SystemsAndré Arnold. avmfss 1990: 117-132

Recognizable sets of finite bilabelled transition systemsAndré Arnold. eatcs, 38:123-134, 1989.

An Algebraic Characterization of Transition System EquivalencesAndré Arnold, Anne Dicky. iandc, 82(2):198-229, August 1989.

An Example of Sequentialization of a Parallel AlgorithmAndré Arnold. SCP, 13(1):111-116, 1989.

1988

Logical Definability of Fixed PointsAndré Arnold. TCS, 61:289-297, 1988.

A Linear Algorithm to Solve Fixed-Point Equations on Transition SystemsAndré Arnold, Paul Crubille. ipl, 29(2):57-66, 1988.

1985

A Syntactic Congruence for Rational omega-LanguageAndré Arnold. TCS, 39:333-335, 1985.

1984

Un modèle de description de protocoles: les reéseaux fermés d atuomates triphasésAndré Arnold, Pascal Guitton. programm 1984: 1-12

Deterministic and non ambiguous rational omega-languagesAndré Arnold. litp 1985: 18-27

1983

Rational omega-Languages are Non-AmbiguousAndré Arnold. TCS, 26:221-223, 1983.

Topological Characterizations of Infinite Behaviours of Transition SystemsAndré Arnold. icalp 1983: 28-38

1982

Synchronized Behaviours of Processes and Rational RelationsAndré Arnold. ACTA, 17:21-29, 1982.

Morphismes et Bimorphismes d ArbresAndré Arnold, Max Dauchet. TCS, 20:33-93, 1982.

1981

Sémantique des Processus CommunicantsAndré Arnold. ita, 15(2):103-139, 1981.

1980

1979

Théorie des Magmoïdes (II)André Arnold, Max Dauchet. ita, 13(2):135-154, 1979.

Forets de Greibach et homomorphismes inversesAndré Arnold, Bernard Leguy. fct 1979: 31-37

A New Proof of two Theorems about Rational TransductionsAndré Arnold, Michel Latteux. TCS, 8:261-263, 1979.

1978

Une Relation d Equivalence Decidable sur la Classe des Forêts ReconnaissablesAndré Arnold, Max Dauchet. mst, 12:103-128, 1978.

Forêts Algébriques et Homomorphismes InversesAndré Arnold, Max Dauchet. iandc, 37(2):182-196, May 1978.

Sul l inversion des morphisms d arbresAndré Arnold, Max Dauchet. icalp 1978: 26-35

Théorie des magmoïdesAndré Arnold, Max Dauchet. ita, 12(3):235-257, 1978.

Sémantique algébrique de l appel par valeurAndré Arnold. ita, 12(2):69-82, 1978.

1977

Non Deterministic Recursive Program SchemesAndré Arnold, Maurice Nivat. fct 1977: 12-21

1976

Un Théorème de Duplication pour les Forêts AlgébriquesAndré Arnold, Max Dauchet. jcss, 13(2):223-244, 1976.

Bi-transductions de forêtsAndré Arnold, Max Dauchet. icalp 1976: 74-86

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

Sign in or sign up to see more results.

runs on WebDSL