The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Philippe Darondeau: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eric Badouel, Philippe Darondeau
    Theory of Regions. [Citation Graph (0, 0)][DBLP]
    Petri Nets, 1996, pp:529-586 [Conf]
  2. Philippe Darondeau
    Unbounded Petri Net Synthesis. [Citation Graph (0, 0)][DBLP]
    Lectures on Concurrency and Petri Nets, 2003, pp:413-438 [Conf]
  3. Eric Badouel, Philippe Darondeau, Jean-Claude Raoult
    Context-Free Event Domains are Recognizable. [Citation Graph (0, 0)][DBLP]
    AMAST, 1995, pp:214-229 [Conf]
  4. 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]
  5. Philippe Darondeau
    Region Based Synthesis of P/T-Nets and Its Potential Applications. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2000, pp:16-23 [Conf]
  6. Eric Badouel, Philippe Darondeau
    Structural Operational Specifications and the Trace Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:302-316 [Conf]
  7. Philippe Darondeau
    A Fully Abstract Model of Fair Asynchrony. [Citation Graph (0, 0)][DBLP]
    Seminar on Concurrency, 1984, pp:458-466 [Conf]
  8. Philippe Darondeau
    Deriving Unbounded Petri Nets from Formal Languages. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1998, pp:533-548 [Conf]
  9. 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]
  10. Eric Badouel, Philippe Darondeau
    Stratified Petri Nets. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:117-128 [Conf]
  11. Philippe Darondeau, Pierpaolo Degano
    Causal Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:234-248 [Conf]
  12. Philippe Darondeau, Laurent Kott
    On the Observational Semantics of Fair Parallelism. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:147-159 [Conf]
  13. Philippe Darondeau, Serge Guiboud-Ribaud, Claude Otrage
    A Formal Model for System Oriented Architecture. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1974, pp:71-75 [Conf]
  14. Philippe Darondeau
    Concurrency and Computability. [Citation Graph (0, 0)][DBLP]
    Semantics of Systems of Concurrent Processes, 1990, pp:223-238 [Conf]
  15. Philippe Darondeau, Pierpaolo Degano
    Causal Trees: Interleaving + Causality. [Citation Graph (0, 0)][DBLP]
    Semantics of Systems of Concurrent Processes, 1990, pp:239-255 [Conf]
  16. Philippe Darondeau, Laurent Kott
    A formal proof system for infinitary rational expressions. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:68-80 [Conf]
  17. Philippe Darondeau, Pierpaolo Degano
    Event Structures, Causal Trees, and Refinements. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:239-245 [Conf]
  18. Benoît Caillaud, Philippe Darondeau, Loïc Hélouët, Gilles Lesventes
    HMSCs as Partial Specifications ... with PNs as Completions. [Citation Graph (0, 0)][DBLP]
    MOVEP, 2000, pp:125-152 [Conf]
  19. Eric Badouel, Philippe Darondeau, Andrew Tokmakoff
    Modelling Dynamic Agent Systems with Cooperating Automata. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1999, pp:11-17 [Conf]
  20. Philippe Darondeau
    Processus non-séquentiels et leurs observations en univers non-centralisé. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1980, pp:92-107 [Conf]
  21. Philippe Darondeau
    An enlarged definition and complete axiomatization of observational congruence of finite processes. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1982, pp:47-62 [Conf]
  22. Philippe Darondeau, Serge Guiboud-Ribaud, Claude Otrage
    Application de la strucuturation des systéme à la conception interne du système GEMAU. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1974, pp:280-297 [Conf]
  23. Eric Badouel, Philippe Darondeau
    Trace Nets. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1992, pp:21-50 [Conf]
  24. Philippe Darondeau
    Separating and Testing. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:203-212 [Conf]
  25. 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]
  26. Philippe Darondeau, B. Gamatie
    A Fullt Observational Model for Infinite Behaviours of Communicating Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:153-168 [Conf]
  27. 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]
  28. Philippe Darondeau, Paul Le Guernic, Michel Raynal
    Types in a Mixed Language System. [Citation Graph (0, 0)][DBLP]
    BIT, 1981, v:21, n:3, pp:246-254 [Journal]
  29. Philippe Darondeau
    Recursive Graphs are not Stable under Maximal Reduction. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1991, v:44, n:, pp:186-189 [Journal]
  30. 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]
  31. Philippe Darondeau, Pierpaolo Degano
    About semantic action refinement. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1991, v:14, n:2, pp:221-234 [Journal]
  32. 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]
  33. 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]
  34. Philippe Darondeau, Serge Yoccoz
    Proof Systems for Infinite Behaviours [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:99, n:2, pp:178-191 [Journal]
  35. Philippe Darondeau
    Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:6, pp:241-245 [Journal]
  36. Philippe Darondeau
    Bisimulation and Effectiveness. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:1, pp:19-20 [Journal]
  37. Philippe Darondeau, Laurent Kott
    Towards a Formal Proof System for omega-Rational Expressions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:4, pp:173-177 [Journal]
  38. Philippe Darondeau
    Une Critique de La Notion de Test de Processus Fondée Sur La Non Séparabilité de Certaines Classes de Langages. [Citation Graph (0, 0)][DBLP]
    ITA, 1986, v:20, n:3, pp:291-317 [Journal]
  39. 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]
  40. Eric Badouel, Philippe Darondeau
    On Guarded Recursion. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:2, pp:403-408 [Journal]
  41. Andrzej M. Borzyszkowski, Philippe Darondeau
    Transition systems without transitions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:338, n:1-3, pp:1-16 [Journal]
  42. Philippe Darondeau
    On the Petri net realization of context-free graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:573-598 [Journal]
  43. Philippe Darondeau
    About Fair Asynchrony. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:37, n:, pp:305-336 [Journal]
  44. Philippe Darondeau, Doris Nolte, Lutz Priese, Serge Yoccoz
    Fairness, Distances and Degrees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:97, n:1, pp:131-142 [Journal]
  45. Philippe Darondeau, Pierpaolo Degano
    Refinement of Actions in Event Structures and Causal Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:118, n:1, pp:21-48 [Journal]
  46. Philippe Darondeau
    Synthesis and Control of Asynchronous and Distributed Systems. [Citation Graph (0, 0)][DBLP]
    ACSD, 2007, pp:13-22 [Conf]

  47. Synthesis of Nets with Step Firing Policies. [Citation Graph (, )][DBLP]


  48. Decomposition Theorems for Bounded Persistent Petri Nets. [Citation Graph (, )][DBLP]


  49. Separability in Persistent Petri Nets. [Citation Graph (, )][DBLP]


  50. On the Synthesis of Zero-Safe Nets. [Citation Graph (, )][DBLP]


  51. Quasi-Static Scheduling of Communicating Tasks. [Citation Graph (, )][DBLP]


  52. Products of Message Sequence Charts. [Citation Graph (, )][DBLP]


  53. A decomposition theorem for finite persistent transition systems. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002