Eric Badouel

According to our database1, Eric Badouel authored at least 37 papers between 1989 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




Modular Design of Domain-Specific Languages Using Splittings of Catamorphisms.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

Incremental Process Discovery using Petri Net Synthesis.
Fundam. Inform., 2017

Petri Nets with Structured Data.
Fundam. Inform., 2016

Petri Net Synthesis from Labelled Transition Systems and from Languages.
Proceedings of the 10th Workshop on Verification and Evaluation of Computer and Communication System, 2016

Petri Net Synthesis
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-47967-4, 2015

A grammatical approach to data-centric case management in a distributed collaborative environment.
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015

Petri Nets with Structured Data.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2015

Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition.
Theor. Comput. Sci., 2013

On the α-Reconstructibility of Workflow Nets.
Proceedings of the Application and Theory of Petri Nets - 33rd International Conference, 2012

A Modal Interface Theory for Component-based Design.
Fundam. Inform., 2011

Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers.
Electr. Notes Theor. Comput. Sci., 2011

Residuation of tropical series: Rationality issues.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

Modal interfaces: unifying interface automata and modal specifications.
Proceedings of the 9th ACM & IEEE International conference on Embedded software, 2009

Why Are Modalities Good for Interface Theories?.
Proceedings of the Ninth International Conference on Application of Concurrency to System Design, 2009

Merging Hierarchically-Structured Documents in Workflow Systems.
Electr. Notes Theor. Comput. Sci., 2008

An Axiomatization of the Token Game Based on Petri Algebras.
Fundam. Inform., 2007

Concurrent Secrets.
Discrete Event Dynamic Systems, 2007

Petri Algebras.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

The synthesis of Petri nets from path-automatic specifications.
Inf. Comput., 2004

Modeling Concurrent Systems: Reconfigurable Nets.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

Nets Enriched over Closed Monoidal Structures.
Proceedings of the Applications and Theory of Petri Nets 2003, 2003

Distributing Finite Automata Through Petri Net Synthesis.
Formal Asp. Comput., 2002

Generalized Automata and Their Net Representations.
Proceedings of the Unifying Petri Nets, Advances in Petri Nets, 2001

Context-Free Event Domains are Recognizable.
Inf. Comput., 1999

Modelling Dynamic Agent Systems with Cooperating Automata.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

The Synthesis Problem for Elementary Net Systems is NP-Complete.
Theor. Comput. Sci., 1997

Stratified Petri Nets.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Theory of Regions.
Proceedings of the Lectures on Petri Nets I: Basic Models, 1996

Trace Nets and Process Automata.
Acta Inf., 1995

Polynomial Algorithms for the Synthesis of Bounded Nets.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Dualities Between Nets and Automata Induced by Schizophrenic Objects.
Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

Context-Free Event Domains are Recognizable.
Proceedings of the Algebraic Methodology and Software Technology, 1995

Trace Nets.
Proceedings of the Sematics: Foundations and Applications, 1992

Structural Operational Specifications and the Trace Automata.
Proceedings of the CONCUR '92, 1992

On Guarded Recursion.
Theor. Comput. Sci., 1991

Terms and Infinite Trees as Monads Over a Signature.
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

Algebraic Closed Theories.
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989