SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

André Arnold: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

André Arnold
MEC: A System for Constructing and Analysis Transition Systems. [Citation Graph (0, 0)][DBLP]
AMAST, 1991, pp:81-82 [Conf]
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. [Citation Graph (0, 0)][DBLP]
AMAST, 1996, pp:19-32 [Conf]
André Arnold
Synchronized Products of Transition Systems and Their Analysis. [Citation Graph (0, 0)][DBLP]
ICATPN, 1998, pp:26-27 [Conf]
André Arnold
MEC: A System for Constructing and Analysing Transition Systems. [Citation Graph (0, 0)][DBLP]
Automatic Verification Methods for Finite State Systems, 1989, pp:117-132 [Conf]
André Arnold, Bernard Leguy
Forets de Greibach et homomorphismes inverses. [Citation Graph (0, 0)][DBLP]
FCT, 1979, pp:31-37 [Conf]
André Arnold, Maurice Nivat
Non Deterministic Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
FCT, 1977, pp:12-21 [Conf]
André Arnold, Didier Bégay, Jean-Pierre Radoux
An Example of Use of Formal Methods to Debug an Embedded Software. [Citation Graph (0, 0)][DBLP]
FME, 1996, pp:649-661 [Conf]
André Arnold, Luigi Santocanale
Ambiguous Classes in the Games µ-Calculus Hierarchy. [Citation Graph (0, 0)][DBLP]
FoSSaCS, 2003, pp:70-86 [Conf]
André Arnold
Topological Characterizations of Infinite Behaviours of Transition Systems. [Citation Graph (0, 0)][DBLP]
ICALP, 1983, pp:28-38 [Conf]
André Arnold, Max Dauchet
Bi-transductions de forêts. [Citation Graph (0, 0)][DBLP]
ICALP, 1976, pp:74-86 [Conf]
André Arnold, Max Dauchet
Sul l'inversion des morphisms d'arbres. [Citation Graph (0, 0)][DBLP]
ICALP, 1978, pp:26-35 [Conf]
André Arnold, Giacomo Lenzi, Jerzy Marcinkowski
The Hierarchy inside Closed Monadic Sigma₁ Collapses on the Infinite Binary Tree. [Citation Graph (0, 0)][DBLP]
LICS, 2001, pp:157-166 [Conf]
André Arnold
Deterministic and non ambiguous rational omega-languages. [Citation Graph (0, 0)][DBLP]
Automata on Infinite Words, 1984, pp:18-27 [Conf]
André Arnold, Anne Dicky
Equivalences and Preorders of Transition Systems. [Citation Graph (0, 0)][DBLP]
MFCS, 1993, pp:20-31 [Conf]
André Arnold, Maurice Nivat
Controlling Behaviours of Systems: Some Basic Concepts and some Applications. [Citation Graph (0, 0)][DBLP]
MFCS, 1980, pp:113-122 [Conf]
André Arnold, Pascal Guitton
Un modèle de description de protocoles: les reéseaux fermés d'atuomates triphasés. [Citation Graph (0, 0)][DBLP]
Symposium on Programming, 1984, pp:1-12 [Conf]
André Arnold
Hypertransition Systems. [Citation Graph (0, 0)][DBLP]
STACS, 1994, pp:327-338 [Conf]
André Arnold
Verification and Comparison of Transition Systems. [Citation Graph (0, 0)][DBLP]
TAPSOFT, 1993, pp:121-135 [Conf]
André Arnold
Synchronized Behaviours of Processes and Rational Relations. [Citation Graph (0, 0)][DBLP]
Acta Inf., 1982, v:17, n:, pp:21-29 [Journal]
André Arnold
Recognizable sets of finite bilabelled transition systems. [Citation Graph (0, 0)][DBLP]
Bulletin of the EATCS, 1989, v:38, n:, pp:123-134 [Journal]
André Arnold, Anne Dicky, Maurice Nivat
A note about minimal non-deterministic automata. [Citation Graph (0, 0)][DBLP]
Bulletin of the EATCS, 1992, v:47, n:, pp:166-169 [Journal]
André Arnold, Damian Niwinski
Fixed Point Characterization of Büchi Automata on Infinite Trees. [Citation Graph (0, 0)][DBLP]
Elektronische Informationsverarbeitung und Kybernetik, 1990, v:26, n:8/9, pp:451-459 [Journal]
André Arnold, Maurice Nivat
The metric space of infinite trees. Algebraic and topological properties. [Citation Graph (0, 0)][DBLP]
Fundam. Inform., 1980, v:3, n:4, pp:445-476 [Journal]
André Arnold, Gérald Point, Alain Griffault, Antoine Rauzy
The AltaRica Formalism for Describing Concurrent Systems. [Citation Graph (0, 0)][DBLP]
Fundam. Inform., 1999, v:40, n:2-3, pp:109-124 [Journal]
André Arnold, Anne Dicky
An Algebraic Characterization of Transition System Equivalences [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1989, v:82, n:2, pp:198-229 [Journal]
André Arnold, Srecko Brlek
Optimal Word Chains for the Thue-Morse Word [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1989, v:83, n:2, pp:140-151 [Journal]
André Arnold, Max Dauchet
Forêts Algébriques et Homomorphismes Inverses [Citation Graph (0, 0)][DBLP]
Information and Control, 1978, v:37, n:2, pp:182-196 [Journal]
André Arnold, Bernard Leguy
Une Propriété des Forêts Algébriques ``de Greibach'' [Citation Graph (0, 0)][DBLP]
Information and Control, 1980, v:46, n:2, pp:108-134 [Journal]
André Arnold, Paul Crubille
A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1988, v:29, n:2, pp:57-66 [Journal]
André Arnold, M. Kanta, Daniel Krob
Recognizable Subsets of the Two Letter Plactic Monoid. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1997, v:64, n:2, pp:53-59 [Journal]
André Arnold
Sémantique algébrique de l'appel par valeur. [Citation Graph (0, 0)][DBLP]
ITA, 1978, v:12, n:2, pp:- [Journal]
André Arnold
Sémantique des Processus Communicants. [Citation Graph (0, 0)][DBLP]
ITA, 1981, v:15, n:2, pp:103-139 [Journal]
André Arnold
A Selection Property of the Boolean µ-Calculus and Some of its Applications. [Citation Graph (0, 0)][DBLP]
ITA, 1997, v:31, n:4, pp:371-384 [Journal]
André Arnold
p329 The µ-calculus alternation-depth hierarchy is strict on binary trees. [Citation Graph (0, 0)][DBLP]
ITA, 1999, v:33, n:4/5, pp:329-340 [Journal]
André Arnold, Max Dauchet
Transductions de Forets Reconnaissables Monadiques Forets Coregulieres. [Citation Graph (0, 0)][DBLP]
ITA, 1976, v:10, n:1, pp:5-28 [Journal]
André Arnold, Max Dauchet
Théorie des magmoïdes. [Citation Graph (0, 0)][DBLP]
ITA, 1978, v:12, n:3, pp:- [Journal]
André Arnold, Max Dauchet
Théorie des Magmoïdes (II). [Citation Graph (0, 0)][DBLP]
ITA, 1979, v:13, n:2, pp:- [Journal]
André Arnold, Max Dauchet
Un Théorème de Duplication pour les Forêts Algébriques. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1976, v:13, n:2, pp:223-244 [Journal]
Mohamed Naimi, Michel Trehel, André Arnold
A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1996, v:34, n:1, pp:1-13 [Journal]
André Arnold
Le Théorème de Transversale Rationnelle dans les Langages d'Arbres. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1980, v:13, n:, pp:275-282 [Journal]
André Arnold, Max Dauchet
Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1978, v:12, n:, pp:103-128 [Journal]
André Arnold, Maurice Nivat
Formal Computations of Non Deterministic Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1980, v:13, n:, pp:219-236 [Journal]
André Arnold
An Example of Sequentialization of a Parallel Algorithm. [Citation Graph (0, 0)][DBLP]
Sci. Comput. Program., 1989, v:13, n:1, pp:111-116 [Journal]
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. [Citation Graph (0, 0)][DBLP]
Sci. Comput. Program., 1997, v:28, n:2-3, pp:93-110 [Journal]
André Arnold, Srecko Brlek
Automatic Verification of Properties in Transition Systems. [Citation Graph (0, 0)][DBLP]
Softw., Pract. Exper., 1995, v:25, n:6, pp:579-596 [Journal]
André Arnold
Nivat's processes and their synchronization. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2002, v:281, n:1-2, pp:31-36 [Journal]
André Arnold
Rational omega-Languages are Non-Ambiguous. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1983, v:26, n:, pp:221-223 [Journal]
André Arnold
A Syntactic Congruence for Rational omega-Language. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1985, v:39, n:, pp:333-335 [Journal]
André Arnold
Logical Definability of Fixed Points. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1988, v:61, n:, pp:289-297 [Journal]
André Arnold
An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Lemma. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1995, v:148, n:1, pp:121-132 [Journal]
André Arnold
A Topological Property of Rational omega-Languages. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1995, v:151, n:1, pp:29-36 [Journal]
André Arnold, Ilaria Castellani
An Algebraic Characterization of Observational Equivalence. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1996, v:156, n:1&2, pp:289-299 [Journal]
André Arnold, Max Dauchet
Morphismes et Bimorphismes d'Arbres. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1982, v:20, n:, pp:33-93 [Journal]
André Arnold, Michel Latteux
A New Proof of two Theorems about Rational Transductions. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1979, v:8, n:, pp:261-263 [Journal]
André Arnold, Maurice Nivat
Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1980, v:11, n:, pp:181-205 [Journal]
André Arnold, Aymeric Vincent, Igor Walukiewicz
Games for synthesis of controllers with partial observation. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:1, n:303, pp:7-34 [Journal]
Luigi Santocanale, André Arnold
Ambiguous classes in mu-calculi hierarchies. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:333, n:1-2, pp:265-296 [Journal]
Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan
A relative of the Thue-Morse sequence. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:139, n:1-3, pp:455-461 [Journal]

Search in 0.004secs, Finished in 0.456secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP