André Arnold

Patrick Cégielski

Irène Guessarian

Fundam. Informaticae, 2022

2021

The algebra of binary trees is affine complete.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2021

A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation.

[BibT_eX]

[DOI]

Pawel Parys

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2014

On the Separation Question for Tree Languages.

[BibT_eX]

[DOI]

Henryk Michalewski

Theory Comput. Syst., 2014

2008

Nondeterministic controllers of nondeterministic processes.

[BibT_eX]

Igor Walukiewicz

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

On the topological complexity of tree languages.

[BibT_eX]

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

2007

Continuous Separation of Game Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

2005

Ambiguous classes in mu-calculi hierarchies.

[BibT_eX]

[DOI]

Luigi Santocanale

Theor. Comput. Sci., 2005

A generic approach to the control of discrete event systems.

[BibT_eX]

[DOI]

Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005

2003

Games for synthesis of controllers with partial observation.

[BibT_eX]

[DOI]

Aymeric Vincent

Igor Walukiewicz

Theor. Comput. Sci., 2003

Ambiguous Classes in the Games µ-Calculus Hierarchy.

[BibT_eX]

[DOI]

Luigi Santocanale

Proceedings of the Foundations of Software Science and Computational Structures, 2003

On Ambiguous Classes in the mu-Calculus Hierarchy of Tree Languages.

[BibT_eX]

[DOI]

Luigi Santocanale

Proceedings of the FICS '03, 2003

2002

Nivat's processes and their synchronization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

2001

The Hierarchy inside Closed Monadic Sigma<sub>1</sub> Collapses on the Infinite Binary Tree.

[BibT_eX]

[DOI]

Giacomo Lenzi

Jerzy Marcinkowski

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.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1999

The AltaRica Formalism for Describing Concurrent Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1999

1998

Synchronized Products of Transition Systems and Their Analysis.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Jean-Pierre Radoux

Sci. Comput. Program., 1997

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

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1997

Recognizable Subsets of the Two Letter Plactic Monoid.

[BibT_eX]

[DOI]

Mathias Kanta

Daniel Krob

Inf. Process. Lett., 1997

1996

An Algebraic Characterization of Observational Equivalence.

[BibT_eX]

[DOI]

Ilaria Castellani

Theor. Comput. Sci., 1996

A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal.

[BibT_eX]

[DOI]

Mohamed Naimi

Michel Tréhel

J. Parallel Distributed Comput., 1996

An Example of Use of Formal Methods to Debug an Embedded Software.

[BibT_eX]

[DOI]

Jean-Pierre Radoux

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.

[BibT_eX]

[DOI]

Jean-Pierre Radoux

Proceedings of the Algebraic Methodology and Software Technology, 1996

1995

A Topological Property of Rational omega-Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Lemma.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Automatic Verification of Properties in Transition Systems.

[BibT_eX]

[DOI]

Srecko Brlek

Softw. Pract. Exp., 1995

A relative of the Thue-Morse sequence.

[BibT_eX]

[DOI]

Discret. Math., 1995

1994

Construction and Analysis of Transition Systems with MEC

[BibT_eX]

[DOI]

Paul Crubillé

AMAST Series in Computing 3, World Scientific, ISBN: 978-981-4501-47-7, 1994

Hypertransition Systems.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

Finite transition systems - semantics of communicating systems.

[BibT_eX]

Prentice Hall international series in computer science, Prentice Hall, ISBN: 978-0-13-092990-7, 1994

1993

Verification and Comparison of Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Equivalences and Preorders of Transition Systems.

[BibT_eX]

[DOI]

Anne Dicky

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992

A note about minimal non-deterministic automata.

[BibT_eX]

Anne Dicky

Bull. EATCS, 1992

Fixed point characterization of weak monadic logic definable sets of trees.

[BibT_eX]

Proceedings of the Tree Automata and Languages., 1992

1991

MEC: A System for Constructing and Analysis Transition Systems.

[BibT_eX]

Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990

Fixed Point Characterization of Büchi Automata on Infinite Trees.

[BibT_eX]

J. Inf. Process. Cybern., 1990

1989

Optimal Word Chains for the Thue-Morse Word

[BibT_eX]

[DOI]

Srecko Brlek

Inf. Comput., November, 1989

An Algebraic Characterization of Transition System Equivalences

[BibT_eX]

[DOI]

Anne Dicky

Inf. Comput., August, 1989

An Example of Sequentialization of a Parallel Algorithm.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1989

Recognizable sets of finite bilabelled transition systems.

[BibT_eX]

Bull. EATCS, 1989

MEC: A System for Constructing and Analysing Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1988

Logical Definability of Fixed Points.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems.

[BibT_eX]

[DOI]

Paul Crubillé

Inf. Process. Lett., 1988

1985

A Syntactic Congruence for Rational omega-Language.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

1984

Un modèle de description de protocoles: les reéseaux fermés d'atuomates triphasés.

[BibT_eX]

[DOI]

Pascal Guitton

Proceedings of the International Symposium on Programming, 1984

Deterministic and non ambiguous rational omega-languages.

[BibT_eX]

[DOI]

Proceedings of the Automata on Infinite Words, 1984

1983

Rational omega-Languages are Non-Ambiguous.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

Topological Characterizations of Infinite Behaviours of Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1983

1982

Morphismes et Bimorphismes d'Arbres.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Synchronized Behaviours of Processes and Rational Relations.

[BibT_eX]

[DOI]

Acta Informatica, 1982

1981

Sémantique des Processus Communicants.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1981

1980

Une Propriété des Forêts Algébriques "de Greibach"

[BibT_eX]

[DOI]

Bernard Leguy

Inf. Control., August, 1980

Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1980

Formal Computations of Non Deterministic Recursive Program Schemes.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1980

Le Théorème de Transversale Rationnelle dans les Langages d'Arbres.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1980

The metric space of infinite trees. Algebraic and topological properties.

[BibT_eX]

Fundam. Informaticae, 1980

Controlling Behaviours of Systems: Some Basic Concepts and some Applications.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979

A New Proof of two Theorems about Rational Transductions.

[BibT_eX]

[DOI]

Michel Latteux

Theor. Comput. Sci., 1979

Théorie des Magmoïdes (II).

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1979

Forets de Greibach et homomorphismes inverses.

[BibT_eX]

Bernard Leguy

Proceedings of the Fundamentals of Computation Theory, 1979

1978

Forêts Algébriques et Homomorphismes Inverses

[BibT_eX]

[DOI]

Inf. Control., May, 1978

Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1978

Théorie des magmoïdes.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1978

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

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1978

Sul l'inversion des morphisms d'arbres.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1978

1977

Non Deterministic Recursive Program Schemes.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1977

1976

Un Théorème de Duplication pour les Forêts Algébriques.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1976

Transductions de Forets Reconnaissables Monadiques Forets Coregulieres.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1976

Bi-transductions de forêts.

[BibT_eX]