|
Search the dblp DataBase
Eric Badouel:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Eric Badouel, Philippe Darondeau
Theory of Regions. [Citation Graph (0, 0)][DBLP] Petri Nets, 1996, pp:529-586 [Conf]
- Eric Badouel, Philippe Darondeau, Jean-Claude Raoult
Context-Free Event Domains are Recognizable. [Citation Graph (0, 0)][DBLP] AMAST, 1995, pp:214-229 [Conf]
- Eric Badouel, Marek A. Bednarczyk, Philippe Darondeau
Generalized Automata and Their Net Representations. [Citation Graph (0, 0)][DBLP] Unifying Petri Nets, 2001, pp:304-345 [Conf]
- Eric Badouel, Jules Chenou
Nets Enriched over Closed Monoidal Structures. [Citation Graph (0, 0)][DBLP] ICATPN, 2003, pp:64-81 [Conf]
- Eric Badouel, Philippe Darondeau
Structural Operational Specifications and the Trace Automata. [Citation Graph (0, 0)][DBLP] CONCUR, 1992, pp:302-316 [Conf]
- Eric Badouel, Philippe Darondeau
Dualities Between Nets and Automata Induced by Schizophrenic Objects. [Citation Graph (0, 0)][DBLP] Category Theory and Computer Science, 1995, pp:24-43 [Conf]
- Eric Badouel, Philippe Darondeau
Stratified Petri Nets. [Citation Graph (0, 0)][DBLP] FCT, 1997, pp:117-128 [Conf]
- Eric Badouel, Jules Chenou, Goulven Guillou
Petri Algebras. [Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:742-754 [Conf]
- Eric Badouel
Algebraic Closed Theories. [Citation Graph (0, 0)][DBLP] MFCS, 1989, pp:155-164 [Conf]
- Eric Badouel, Philippe Darondeau, Andrew Tokmakoff
Modelling Dynamic Agent Systems with Cooperating Automata. [Citation Graph (0, 0)][DBLP] PDPTA, 1999, pp:11-17 [Conf]
- Eric Badouel, Marisa Llorens, Javier Oliver
Modeling Concurrent Systems: Reconfigurable Nets. [Citation Graph (0, 0)][DBLP] PDPTA, 2003, pp:1568-1574 [Conf]
- Eric Badouel, Philippe Darondeau
Trace Nets. [Citation Graph (0, 0)][DBLP] REX Workshop, 1992, pp:21-50 [Conf]
- Eric Badouel
Terms and Infinite Trees as Monads Over a Signature. [Citation Graph (0, 0)][DBLP] TAPSOFT, Vol.1, 1989, pp:89-103 [Conf]
- Eric Badouel, Luca Bernardinello, Philippe Darondeau
Polynomial Algorithms for the Synthesis of Bounded Nets. [Citation Graph (0, 0)][DBLP] TAPSOFT, 1995, pp:364-378 [Conf]
- Eric Badouel, Philippe Darondeau
Trace Nets and Process Automata [Citation Graph (0, 0)][DBLP] Acta Inf., 1995, v:32, n:7, pp:647-679 [Journal]
- Eric Badouel, Benoît Caillaud, Philippe Darondeau
Distributing Finite Automata Through Petri Net Synthesis. [Citation Graph (0, 0)][DBLP] Formal Asp. Comput., 2002, v:13, n:6, pp:447-470 [Journal]
- Eric Badouel, Philippe Darondeau
The synthesis of Petri nets from path-automatic specifications. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2004, v:193, n:2, pp:117-135 [Journal]
- Eric Badouel, Philippe Darondeau, Jean-Claude Raoult
Context-Free Event Domains are Recognizable. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1999, v:149, n:2, pp:134-172 [Journal]
- Eric Badouel, Luca Bernardinello, Philippe Darondeau
The Synthesis Problem for Elementary Net Systems is NP-Complete. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:186, n:1-2, pp:107-134 [Journal]
- Eric Badouel, Philippe Darondeau
On Guarded Recursion. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1991, v:82, n:2, pp:403-408 [Journal]
- Eric Badouel, Jules Chenou, Goulven Guillou
An Axiomatization of the Token Game Based on Petri Algebras. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 2007, v:77, n:3, pp:187-215 [Journal]
Why Are Modalities Good for Interface Theories?. [Citation Graph (, )][DBLP]
Modal interfaces: unifying interface automata and modal specifications. [Citation Graph (, )][DBLP]
Merging Hierarchically-Structured Documents in Workflow Systems. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|