André Arnold

According to our database1, André Arnold
  • authored at least 66 papers between 1976 and 2014.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
On the Separation Question for Tree Languages.
Theory Comput. Syst., 2014

2012
On the separation question for tree languages.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2008
Nondeterministic controllers of nondeterministic processes.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

On the topological complexity of tree languages.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
Continuous Separation of Game Languages.
Fundam. Inform., 2007

2005
Ambiguous classes in mu-calculi hierarchies.
Theor. Comput. Sci., 2005

2003
Games for synthesis of controllers with partial observation.
Theor. Comput. Sci., 2003

Ambiguous Classes in the Games µ-Calculus Hierarchy.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002
Nivat's processes and their synchronization.
Theor. Comput. Sci., 2002

2001
The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

1999
p329 The µ-calculus alternation-depth hierarchy is strict on binary trees.
ITA, 1999

The AltaRica Formalism for Describing Concurrent Systems.
Fundam. Inform., 1999

1998
Synchronized Products of Transition Systems and Their Analysis.
Proceedings of the Application and Theory of Petri Nets 1998, 1998

1997
The Embedded Software of an Electricity Meter: An Experience in Using Formal Methods in an Industrial Project.
Sci. Comput. Program., 1997

A Selection Property of the Boolean µ-Calculus and Some of its Applications.
ITA, 1997

Recognizable Subsets of the Two Letter Plactic Monoid.
Inf. Process. Lett., 1997

1996
An Algebraic Characterization of Observational Equivalence.
Theor. Comput. Sci., 1996

A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal.
J. Parallel Distrib. Comput., 1996

An Example of Use of Formal Methods to Debug an Embedded Software.
Proceedings of the FME '96: Industrial Benefit and Advances in Formal Methods, 1996

The Embedded Software of an Electrical Meter: An Experiment in Using Formal Methods in an Industrial Project.
Proceedings of the Algebraic Methodology and Software Technology, 1996

1995
A Topological Property of Rational omega-Languages.
Theor. Comput. Sci., 1995

An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Lemma.
Theor. Comput. Sci., 1995

Automatic Verification of Properties in Transition Systems.
Softw., Pract. Exper., 1995

A relative of the Thue-Morse sequence.
Discrete Mathematics, 1995

1994
Construction and Analysis of Transition Systems with MEC
AMAST Series in Computing 3, World Scientific, ISBN: 978-981-4501-47-7, 1994

Hypertransition Systems.
Proceedings of the STACS 94, 1994

Finite transition systems - semantics of communicating systems.
Prentice Hall international series in computer science, Prentice Hall, ISBN: 978-0-13-092990-7, 1994

1993
Verification and Comparison of Transition Systems.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Equivalences and Preorders of Transition Systems.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
A note about minimal non-deterministic automata.
Bulletin of the EATCS, 1992

Fixed point characterization of weak monadic logic definable sets of trees.
Tree Automata and Languages, 1992

1991
MEC: A System for Constructing and Analysis Transition Systems.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990
Fixed Point Characterization of Büchi Automata on Infinite Trees.
Elektronische Informationsverarbeitung und Kybernetik, 1990

1989
Optimal Word Chains for the Thue-Morse Word
Inf. Comput., November, 1989

An Algebraic Characterization of Transition System Equivalences
Inf. Comput., August, 1989

An Example of Sequentialization of a Parallel Algorithm.
Sci. Comput. Program., 1989

Recognizable sets of finite bilabelled transition systems.
Bulletin of the EATCS, 1989

MEC: A System for Constructing and Analysing Transition Systems.
Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1988
Logical Definability of Fixed Points.
Theor. Comput. Sci., 1988

A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems.
Inf. Process. Lett., 1988

1985
A Syntactic Congruence for Rational omega-Language.
Theor. Comput. Sci., 1985

1984
Un modèle de description de protocoles: les reéseaux fermés d'atuomates triphasés.
Proceedings of the International Symposium on Programming, 1984

Deterministic and non ambiguous rational omega-languages.
Proceedings of the Automata on Infinite Words, 1984

1983
Rational omega-Languages are Non-Ambiguous.
Theor. Comput. Sci., 1983

Topological Characterizations of Infinite Behaviours of Transition Systems.
Proceedings of the Automata, 1983

1982
Morphismes et Bimorphismes d'Arbres.
Theor. Comput. Sci., 1982

Synchronized Behaviours of Processes and Rational Relations.
Acta Inf., 1982

1981
Sémantique des Processus Communicants.
ITA, 1981

1980
Une Propriété des Forêts Algébriques "de Greibach"
Information and Control, August, 1980

Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs.
Theor. Comput. Sci., 1980

Formal Computations of Non Deterministic Recursive Program Schemes.
Mathematical Systems Theory, 1980

Le Théorème de Transversale Rationnelle dans les Langages d'Arbres.
Mathematical Systems Theory, 1980

The metric space of infinite trees. Algebraic and topological properties.
Fundam. Inform., 1980

Controlling Behaviours of Systems: Some Basic Concepts and some Applications.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979
A New Proof of two Theorems about Rational Transductions.
Theor. Comput. Sci., 1979

Théorie des Magmoïdes (II).
ITA, 1979

Forets de Greibach et homomorphismes inverses.
FCT, 1979

1978
Forêts Algébriques et Homomorphismes Inverses
Information and Control, May, 1978

Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables.
Mathematical Systems Theory, 1978

Théorie des magmoïdes.
ITA, 1978

Sémantique algébrique de l'appel par valeur.
ITA, 1978

Sul l'inversion des morphisms d'arbres.
Proceedings of the Automata, 1978

1977
Non Deterministic Recursive Program Schemes.
FCT, 1977

1976
Un Théorème de Duplication pour les Forêts Algébriques.
J. Comput. Syst. Sci., 1976

Transductions de Forets Reconnaissables Monadiques Forets Coregulieres.
ITA, 1976

Bi-transductions de forêts.
ICALP, 1976


  Loading...