dblp.uni-trier.dewww.uni-trier.de

Philippe Darondeau Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
56EEEike Best, Philippe Darondeau: A decomposition theorem for finite persistent transition systems. Acta Inf. 46(3): 237-254 (2009)
2008
55EEPhilippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang: Quasi-Static Scheduling of Communicating Tasks. CONCUR 2008: 310-324
54EEPhilippe Darondeau: On the Synthesis of Zero-Safe Nets. Concurrency, Graphs and Models 2008: 409-426
53EEPhilippe Darondeau, Blaise Genest, Loïc Hélouët: Products of Message Sequence Charts. FoSSaCS 2008: 458-473
52EEPhilippe Darondeau, Maciej Koutny, Marta Pietkiewicz-Koutny, Alexandre Yakovlev: Synthesis of Nets with Step Firing Policies. Petri Nets 2008: 112-131
51EEEike Best, Philippe Darondeau: Decomposition Theorems for Bounded Persistent Petri Nets. Petri Nets 2008: 33-51
2007
50EEPhilippe Darondeau: Synthesis and Control of Asynchronous and Distributed Systems. ACSD 2007: 13-22
49EEEric Badouel, Marek A. Bednarczyk, Andrzej M. Borzyszkowski, Benoît Caillaud, Philippe Darondeau: Concurrent Secrets. Discrete Event Dynamic Systems 17(4): 425-446 (2007)
48EEEike Best, Philippe Darondeau, Harro Wimmel: Making Petri Nets Safe and Free of Internal Transitions. Fundam. Inform. 80(1-3): 75-90 (2007)
2005
47 Gianfranco Ciardo, Philippe Darondeau: Applications and Theory of Petri Nets 2005, 26th International Conference, ICATPN 2005, Miami, USA, June 20-25, 2005, Proceedings Springer 2005
46EERené K. Boel, Philippe Darondeau, Sadatoshi Kumagai: Foreword. Discrete Event Dynamic Systems 15(1): 5-6 (2005)
45EEPhilippe Darondeau: Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets. Inf. Process. Lett. 94(6): 241-245 (2005)
44EEAndrzej M. Borzyszkowski, Philippe Darondeau: Transition systems without transitions. Theor. Comput. Sci. 338(1-3): 1-16 (2005)
2004
43EEEric Badouel, Philippe Darondeau: The synthesis of Petri nets from path-automatic specifications. Inf. Comput. 193(2): 117-135 (2004)
2003
42EEPhilippe Darondeau: Unbounded Petri Net Synthesis. Lectures on Concurrency and Petri Nets 2003: 413-438
2002
41EEEric Badouel, Benoît Caillaud, Philippe Darondeau: Distributing Finite Automata Through Petri Net Synthesis. Formal Asp. Comput. 13(6): 447-470 (2002)
2001
40EEEric Badouel, Marek A. Bednarczyk, Philippe Darondeau: Generalized Automata and Their Net Representations. Unifying Petri Nets 2001: 304-345
39EEPhilippe Darondeau: On the Petri net realization of context-free graphs. Theor. Comput. Sci. 258(1-2): 573-598 (2001)
2000
38EEPhilippe Darondeau: Region Based Synthesis of P/T-Nets and Its Potential Applications. ICATPN 2000: 16-23
37EEBenoît Caillaud, Philippe Darondeau, Loïc Hélouët, Gilles Lesventes: HMSCs as Partial Specifications ... with PNs as Completions. MOVEP 2000: 125-152
1999
36 Eric Badouel, Philippe Darondeau, Andrew Tokmakoff: Modelling Dynamic Agent Systems with Cooperating Automata. PDPTA 1999: 11-17
35 Eric Badouel, Philippe Darondeau, Jean-Claude Raoult: Context-Free Event Domains are Recognizable. Inf. Comput. 149(2): 134-172 (1999)
1998
34EEPhilippe Darondeau: Deriving Unbounded Petri Nets from Formal Languages. CONCUR 1998: 533-548
1997
33 Eric Badouel, Philippe Darondeau: Stratified Petri Nets. FCT 1997: 117-128
32EEEric Badouel, Luca Bernardinello, Philippe Darondeau: The Synthesis Problem for Elementary Net Systems is NP-Complete. Theor. Comput. Sci. 186(1-2): 107-134 (1997)
1996
31 Eric Badouel, Philippe Darondeau: Theory of Regions. Petri Nets 1996: 529-586
1995
30 Eric Badouel, Philippe Darondeau, Jean-Claude Raoult: Context-Free Event Domains are Recognizable. AMAST 1995: 214-229
29 Eric Badouel, Philippe Darondeau: Dualities Between Nets and Automata Induced by Schizophrenic Objects. Category Theory and Computer Science 1995: 24-43
28EEEric Badouel, Luca Bernardinello, Philippe Darondeau: Polynomial Algorithms for the Synthesis of Bounded Nets. TAPSOFT 1995: 364-378
27 Eric Badouel, Philippe Darondeau: Trace Nets and Process Automata Acta Inf. 32(7): 647-679 (1995)
1993
26 Philippe Darondeau, Pierpaolo Degano: Refinement of Actions in Event Structures and Causal Trees. Theor. Comput. Sci. 118(1): 21-48 (1993)
1992
25EEEric Badouel, Philippe Darondeau: Structural Operational Specifications and the Trace Automata. CONCUR 1992: 302-316
24EEEric Badouel, Philippe Darondeau: Trace Nets. REX Workshop 1992: 21-50
23 Philippe Darondeau, Serge Yoccoz: Proof Systems for Infinite Behaviours Inf. Comput. 99(2): 178-191 (1992)
22 Philippe Darondeau, Doris Nolte, Lutz Priese, Serge Yoccoz: Fairness, Distances and Degrees. Theor. Comput. Sci. 97(1): 131-142 (1992)
1991
21 Philippe Darondeau: Recursive Graphs are not Stable under Maximal Reduction. Bulletin of the EATCS 44: 186-189 (1991)
20 Philippe Darondeau, Pierpaolo Degano: About semantic action refinement. Fundam. Inform. 14(2): 221-234 (1991)
19 Eric Badouel, Philippe Darondeau: On Guarded Recursion. Theor. Comput. Sci. 82(2): 403-408 (1991)
1990
18EEPhilippe Darondeau, Pierpaolo Degano: Event Structures, Causal Trees, and Refinements. MFCS 1990: 239-245
17EEPhilippe Darondeau: Concurrency and Computability. Semantics of Systems of Concurrent Processes 1990: 223-238
16EEPhilippe Darondeau, Pierpaolo Degano: Causal Trees: Interleaving + Causality. Semantics of Systems of Concurrent Processes 1990: 239-255
1989
15EEPhilippe Darondeau, Pierpaolo Degano: Causal Trees. ICALP 1989: 234-248
14 Philippe Darondeau: Bisimulation and Effectiveness. Inf. Process. Lett. 30(1): 19-20 (1989)
1987
13EEPhilippe Darondeau, B. Gamatie: A Fullt Observational Model for Infinite Behaviours of Communicating Systems. TAPSOFT, Vol.1 1987: 153-168
1986
12EEPhilippe Darondeau: Separating and Testing. STACS 1986: 203-212
11 Philippe Darondeau: Une Critique de La Notion de Test de Processus Fondée Sur La Non Séparabilité de Certaines Classes de Langages. ITA 20(3): 291-317 (1986)
1985
10 Philippe Darondeau: About Fair Asynchrony. Theor. Comput. Sci. 37: 305-336 (1985)
1984
9EEPhilippe Darondeau, Laurent Kott: A formal proof system for infinitary rational expressions. Automata on Infinite Words 1984: 68-80
8EEPhilippe Darondeau: A Fully Abstract Model of Fair Asynchrony. Seminar on Concurrency 1984: 458-466
7 Philippe Darondeau, Laurent Kott: Towards a Formal Proof System for omega-Rational Expressions. Inf. Process. Lett. 19(4): 173-177 (1984)
1983
6EEPhilippe Darondeau, Laurent Kott: On the Observational Semantics of Fair Parallelism. ICALP 1983: 147-159
1982
5 Philippe Darondeau: An enlarged definition and complete axiomatization of observational congruence of finite processes. Symposium on Programming 1982: 47-62
1981
4 Philippe Darondeau, Paul Le Guernic, Michel Raynal: Types in a Mixed Language System. BIT 21(3): 246-254 (1981)
1980
3 Philippe Darondeau: Processus non-séquentiels et leurs observations en univers non-centralisé. Symposium on Programming 1980: 92-107
1974
2 Philippe Darondeau, Serge Guiboud-Ribaud, Claude Otrage: A Formal Model for System Oriented Architecture. IFIP Congress 1974: 71-75
1 Philippe Darondeau, Serge Guiboud-Ribaud, Claude Otrage: Application de la strucuturation des systéme à la conception interne du système GEMAU. Symposium on Programming 1974: 280-297

Coauthor Index

1Eric Badouel [19] [24] [25] [27] [28] [29] [30] [31] [32] [33] [35] [36] [40] [41] [43] [49]
2Marek A. Bednarczyk [40] [49]
3Luca Bernardinello [28] [32]
4Eike Best [48] [51] [56]
5René K. Boel [46]
6Andrzej M. Borzyszkowski [44] [49]
7Benoît Caillaud [37] [41] [49]
8Gianfranco Ciardo [47]
9Pierpaolo Degano [15] [16] [18] [20] [26]
10B. Gamatie [13]
11Blaise Genest [53] [55]
12Paul Le Guernic [4]
13Serge Guiboud-Ribaud [1] [2]
14Loïc Hélouët [37] [53]
15Laurent Kott [6] [7] [9]
16Maciej Koutny [52]
17Sadatoshi Kumagai [46]
18Gilles Lesventes [37]
19Doris Nolte [22]
20Claude Otrage [1] [2]
21Marta Pietkiewicz-Koutny [52]
22Lutz Priese [22]
23Jean-Claude Raoult [30] [35]
24Michel Raynal [4]
25P. S. Thiagarajan [55]
26Andrew Tokmakoff [36]
27Harro Wimmel [48]
28Alexandre Yakovlev [52]
29Shaofa Yang [55]
30Serge Yoccoz [22] [23]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)