Antoine Petit

Bull. EATCS, 2017

2007

Timed substitutions for regular signal-event languages.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2007

2006

Refinements and Abstractions of Signal-Event (Timed) Languages.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

Intersection of Regular Signal-Event (Timed) Languages.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

2004

Updatable timed automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

2003

An algebraic approach to data languages and timed languages.

[BibT_eX]

[DOI]

Denis Thérien

Inf. Comput., 2003

Timed Control with Partial Observability.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002

A Kleene/Büchi-like Theorem for Clock Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

2001

An Algebraic Characterization of Data and Timed Languages.

[BibT_eX]

[DOI]

Denis Thérien

Proceedings of the CONCUR 2001, 2001

Systems and Software Verification, Model-Checking Techniques and Tools.

[BibT_eX]

[DOI]

Springer, ISBN: 9783540415237, 2001

2000

Towards the automatic verification of PLC programs written in Instruction List.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Systems, 2000

Expressiveness of Updatable Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Are Timed Automata Updatable?

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999

Decomposition and Composition of Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

1998

An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Characterization of the Expressive Power of Silent Transitions in Timed Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1998

Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof.

[BibT_eX]

[DOI]

Raphaël Meyer

Proceedings of the STACS 98, 1998

A (Non-elementary) Modular Decision Procedure for LTrL.

[BibT_eX]

[DOI]

Raphaël Meyer

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Introduction à l'algorithmique des objets partagés.

[BibT_eX]

[DOI]

Bernadette Charron-Bost

Robert Cori

RAIRO Theor. Informatics Appl., 1997

Removing epsilon-Transitions in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Decomposition of TrPTL Formulas.

[BibT_eX]

[DOI]

Raphaël Meyer

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996

On the Power of Non-Observable Actions in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the STACS 96, 1996

1995

Rational and Recognizable Complex Trace Languages

[BibT_eX]

[DOI]

Inf. Comput., January, 1995

On the Undecidability of Deadlock Detection in Families of Nets.

[BibT_eX]

[DOI]

Anne-Cécile Fabret

Proceedings of the STACS 95, 1995

Modular Constructions of Distributing Automata.

[BibT_eX]

[DOI]

Sébastien Huguet

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Recent Developments in Trace Theory.

[BibT_eX]

Proceedings of the Developments in Language Theory II, 1995

Infinite Traces.

[BibT_eX]

[DOI]

Proceedings of the Book of Traces, 1995

1994

An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces.

[BibT_eX]

[DOI]

Wieslaw Zielonka

Theor. Comput. Sci., 1994

1993

Recognizable Trace Languages, Distributed Automata and the Distribution Problem.

[BibT_eX]

[DOI]

Acta Informatica, 1993

Speedup of Recognizable Trace Languages.

[BibT_eX]

[DOI]

Christophe Cérin

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992

Decidability of the Star Problem in A* x {b}*.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Poset Properties of Complex Traces.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Asynchronous Cellular Automata for Infinite Traces.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

A survey of recognizable languages with infinite traces.

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

1991

Detection of Deadlocks in an Infinite Family of Nets.

[BibT_eX]

[DOI]

Proceedings of the STACS 91, 1991

Recognizable Complex Trace Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

A Kleene Theorem for Infinite Trace Languages.

[BibT_eX]

[DOI]

Wieslaw Zielonka

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

Distribution and Synchronized Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

1989

Syntactical Properties of Unbounded Nets of Processors.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

Characterization of Recognizable Trace Languages by Distributed Automata (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

Distribution of Sequential Processes.

[BibT_eX]

[DOI]

Joffroy Beauquier

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

Langages Algébriques Déterministes Non Générateurs.

[BibT_eX]

[DOI]

Luc Boasson

RAIRO Theor. Informatics Appl., 1987

1985

Deterministic Languages and Non-Generators.

[BibT_eX]

[DOI]

Luc Boasson