Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Philippe Darondeau
2010 – today
- 2012
[j30]Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan: Petri Net Reachability Graphs: Decidability Status of First Order Properties. Logical Methods in Computer Science 8(4) (2012)- [j29]Philippe Darondeau, Laurie Ricker: Distributed Control of Discrete-Event Systems: A First Step. T. Petri Nets and Other Models of Concurrency 6: 24-45 (2012)
- [c39]
- 2011
- [j28]Eike Best, Philippe Darondeau: Separability in Persistent Petri Nets. Fundam. Inform. 113(3-4): 179-203 (2011)
- [c38]
- [c37]Eric Badouel, Anne Bouillard, Philippe Darondeau, Jan Komenda: Residuation of tropical series: Rationality issues. CDC-ECE 2011: 3855-3861
- [c36]
- [c35]Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan: Petri Net Reachability Graphs: Decidability Status of FO Properties. FSTTCS 2011: 140-151
- 2010
- [j27]Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang: Quasi-static scheduling of communicating tasks. Inf. Comput. 208(10): 1154-1168 (2010)
- [j26]Jérémy Dubreil, Philippe Darondeau, Hervé Marchand: Supervisory Control for Opacity. IEEE Trans. Automat. Contr. 55(5): 1089-1100 (2010)
- [c34]
- [c33]Eike Best, Philippe Darondeau, Roberto Gorrieri: On the Decidability of Non Interference over Unbounded Petri Nets. SecCo 2010: 16-33
2000 – 2009
- 2009
- [j25]Eike Best, Philippe Darondeau: A decomposition theorem for finite persistent transition systems. Acta Inf. 46(3): 237-254 (2009)
- [j24]Philippe Darondeau, Maciej Koutny, Marta Pietkiewicz-Koutny, Alexandre Yakovlev: Synthesis of Nets with Step Firing Policies. Fundam. Inform. 94(3-4): 275-303 (2009)
- 2008
- [c32]Eike Best, Philippe Darondeau: Decomposition Theorems for Bounded Persistent Petri Nets. Petri Nets 2008: 33-51
- [c31]Philippe Darondeau, Maciej Koutny, Marta Pietkiewicz-Koutny, Alexandre Yakovlev: Synthesis of Nets with Step Firing Policies. Petri Nets 2008: 112-131
- [c30]Philippe Darondeau: On the Synthesis of Zero-Safe Nets. Concurrency, Graphs and Models 2008: 409-426
- [c29]Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang: Quasi-Static Scheduling of Communicating Tasks. CONCUR 2008: 310-324
- [c28]Philippe Darondeau, Blaise Genest, Loïc Hélouët: Products of Message Sequence Charts. FoSSaCS 2008: 458-473
- 2007
- [j23]Eric Badouel, Marek A. Bednarczyk, Andrzej M. Borzyszkowski, Benoît Caillaud, Philippe Darondeau: Concurrent Secrets. Discrete Event Dynamic Systems 17(4): 425-446 (2007)
- [j22]Eike Best, Philippe Darondeau, Harro Wimmel: Making Petri Nets Safe and Free of Internal Transitions. Fundam. Inform. 80(1-3): 75-90 (2007)
- [c27]
- 2005
- [j21]René K. Boel, Philippe Darondeau, Sadatoshi Kumagai: Foreword. Discrete Event Dynamic Systems 15(1): 5-6 (2005)
- [j20]Philippe 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)
- [j19]Andrzej M. Borzyszkowski, Philippe Darondeau: Transition systems without transitions. Theor. Comput. Sci. 338(1-3): 1-16 (2005)
- [e1]Gianfranco Ciardo, Philippe Darondeau (Eds.): Applications and Theory of Petri Nets 2005, 26th International Conference, ICATPN 2005, Miami, USA, June 20-25, 2005, Proceedings. Lecture Notes in Computer Science 3536, Springer 2005, ISBN 3-540-26301-2
- 2004
- [j18]Eric Badouel, Philippe Darondeau: The synthesis of Petri nets from path-automatic specifications. Inf. Comput. 193(2): 117-135 (2004)
- 2003
- [j17]
- [c26]Philippe Darondeau: Unbounded Petri Net Synthesis. Lectures on Concurrency and Petri Nets 2003: 413-438
- 2002
- [j16]Eric Badouel, Benoît Caillaud, Philippe Darondeau: Distributing Finite Automata Through Petri Net Synthesis. Formal Asp. Comput. 13(6): 447-470 (2002)
- 2001
- [j15]Philippe Darondeau: On the Petri net realization of context-free graphs. Theor. Comput. Sci. 258(1-2): 573-598 (2001)
- [c25]Eric Badouel, Marek A. Bednarczyk, Philippe Darondeau: Generalized Automata and Their Net Representations. Unifying Petri Nets 2001: 304-345
- 2000
- [c24]Philippe Darondeau: Region Based Synthesis of P/T-Nets and Its Potential Applications. ICATPN 2000: 16-23
- [c23]Benoît Caillaud, Philippe Darondeau, Loïc Hélouët, Gilles Lesventes: HMSCs as Partial Specifications ... with PNs as Completions. MOVEP 2000: 125-152
1990 – 1999
- 1999
- [j14]Eric Badouel, Philippe Darondeau, Jean-Claude Raoult: Context-Free Event Domains are Recognizable. Inf. Comput. 149(2): 134-172 (1999)
- [c22]Eric Badouel, Philippe Darondeau, Andrew Tokmakoff: Modelling Dynamic Agent Systems with Cooperating Automata. PDPTA 1999: 11-17
- 1998
- [c21]
- 1997
- [j13]Eric Badouel, Luca Bernardinello, Philippe Darondeau: The Synthesis Problem for Elementary Net Systems is NP-Complete. Theor. Comput. Sci. 186(1-2): 107-134 (1997)
- [c20]
- 1996
- [c19]
- 1995
- [j12]
- [c18]Eric Badouel, Philippe Darondeau, Jean-Claude Raoult: Context-Free Event Domains are Recognizable. AMAST 1995: 214-229
- [c17]Eric Badouel, Philippe Darondeau: Dualities Between Nets and Automata Induced by Schizophrenic Objects. Category Theory and Computer Science 1995: 24-43
- [c16]Eric Badouel, Luca Bernardinello, Philippe Darondeau: Polynomial Algorithms for the Synthesis of Bounded Nets. TAPSOFT 1995: 364-378
- 1993
- [j11]Philippe Darondeau, Pierpaolo Degano: Refinement of Actions in Event Structures and Causal Trees. Theor. Comput. Sci. 118(1): 21-48 (1993)
- 1992
- [j10]Philippe Darondeau, Serge Yoccoz: Proof Systems for Infinite Behaviours. Inf. Comput. 99(2): 178-191 (1992)
- [j9]Philippe Darondeau, Doris Nolte, Lutz Priese, Serge Yoccoz: Fairness, Distances and Degrees. Theor. Comput. Sci. 97(1): 131-142 (1992)
- [c15]Eric Badouel, Philippe Darondeau: Structural Operational Specifications and the Trace Automata. CONCUR 1992: 302-316
- [c14]
- 1991
- [j8]Philippe Darondeau: Recursive Graphs are not Stable under Maximal Reduction. Bulletin of the EATCS 44: 186-189 (1991)
- [j7]Philippe Darondeau, Pierpaolo Degano: About semantic action refinement. Fundam. Inform. 14(2): 221-234 (1991)
- [j6]
- 1990
- [c13]Philippe Darondeau: Concurrency and Computability. Semantics of Systems of Concurrent Processes 1990: 223-238
- [c12]Philippe Darondeau, Pierpaolo Degano: Causal Trees: Interleaving + Causality. Semantics of Systems of Concurrent Processes 1990: 239-255
- [c11]Philippe Darondeau, Pierpaolo Degano: Event Structures, Causal Trees, and Refinements. MFCS 1990: 239-245
1980 – 1989
- 1989
- [j5]
- [c10]
- 1987
- [c9]Philippe Darondeau, B. Gamatie: A Fullt Observational Model for Infinite Behaviours of Communicating Systems. TAPSOFT, Vol.1 1987: 153-168
- 1986
- [j4]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)
- [c8]
- 1985
- [j3]
- 1984
- [j2]Philippe Darondeau, Laurent Kott: Towards a Formal Proof System for omega-Rational Expressions. Inf. Process. Lett. 19(4): 173-177 (1984)
- [c7]
- [c6]Philippe Darondeau, Laurent Kott: A formal proof system for infinitary rational expressions. Automata on Infinite Words 1984: 68-80
- 1983
- [c5]Philippe Darondeau, Laurent Kott: On the Observational Semantics of Fair Parallelism. ICALP 1983: 147-159
- 1982
- [c4]Philippe Darondeau: An enlarged definition and complete axiomatization of observational congruence of finite processes. Symposium on Programming 1982: 47-62
- 1981
- [j1]Philippe Darondeau, Paul Le Guernic, Michel Raynal: Types in a Mixed Language System. BIT 21(3): 246-254 (1981)
- 1980
- [c3]Philippe Darondeau: Processus non-séquentiels et leurs observations en univers non-centralisé. Symposium on Programming 1980: 92-107
1970 – 1979
- 1974
- [c2]Philippe Darondeau, Serge Guiboud-Ribaud, Claude Otrage: A Formal Model for System Oriented Architecture. IFIP Congress 1974: 71-75
- [c1]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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:39 CET by the dblp team