Philippe DARONDEAU
senior researcher
→ Home
→ Publications
Theme
Contract All. Expand All.

Books

  1. Gianfranco Ciardo, Philippe Darondeau, (eds.). 26th International Conference on Applications and Theory of Petri Nets, ICATPN 2005, Miami, USA, June 20-25, 2005, Proceedings. Lecture Notes in Computer Science, Springer, June 2005.
  2. Mike Kishinevsky, Philippe Darondeau, (eds.). 4th International Conference on Application of Concurrency to System Design, ACSD 2004, Hamilton, Canada, June 16-18, 2004, Proceedings. IEEE Computer Society, June 2004.
  3. Benoît Caillaud, Philippe Darondeau, Luciano Lavagno, Xiaolan Xie (eds.). Synthesis and Control of Discrete Event Systems. Kluwer Academic Press, 2002.

Academic Journals

  1. Philippe Darondeau and Laurie Ricker. Distributed Control of Discrete-Event Systems: A First Step. Transactions on Petri Nets and Other Models of Concurrency, 6:24-45, 2012.
  2. Philippe Darondeau, Stephane Demri, Roland Meyer, Christophe Morvan. Petri Net Reachability Graphs: Decidability Status of First Order Properties. Logical Methods in Computer Science, vol.8, issue 4, paper 10, 2012.
  3. Eike Best, Philippe Darondeau. Separability in Persistent Petri Nets. Fundamenta Informaticae, 113(3-4):179-203, 2011.
  4. Philippe Darondeau, Blaise Genest, P.S. Thiagarajan, Shaofa Yang. Quasi-static scheduling of communicating tasks. Information and Computation, 208(10):1154-1168, 2010.
  5. Jeremy Dubreil, Philippe Darondeau, Herve Marchand. Supervisory Control for Opacity. IEEE Transactions on Automatic Control, 55(5):1089-1100, May 2010.
  6. Eike Best, Philippe Darondeau. A decomposition theorem for finite persistent transition systems. Acta Informatica, 46:237-254, 2009.
  7. Philippe Darondeau, Maciej Koutny, Marta Pietkiewicz-Koutny, Alex Yakovlev. Synthesis of Nets with Step Firing Policies. Fundamenta Informaticae, 94(3):275-474, 2009.
  8. Eike Best, Philippe Darondeau, Harro Wimmel. Making Petri Nets Safe and Free of Internal Transitions. Fundamenta Informaticae, 80(1):75-90, 2007.
  9. Eric Badouel, Marek A. Bednarczyk, Andrzej Borzyszkowski, Benoît Caillaud, Philippe Darondeau. Concurrent Secrets. Discrete Event Dynamic Systems, 17(4):425-446, December 2007.
  10. Andrzej Borzyszkowski, Philippe Darondeau. Transition systems without transitions. Theoretical Computer Science, 338:1-16, 2005.
  11. Philippe Darondeau. Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets. Information Processing Letters, 94:241-245, 2005.
  12. Eric Badouel, Philippe Darondeau. The synthesis of Petri nets from path-automatic specifications. Information and Computation, 193:117-135, 2004.
  13. Philippe Darondeau, Xiaolan Xie. Linear Control of Live Marked Graphs. Automatica, 39(3):429-440, 2003.
  14. Eric Badouel, Benoît Caillaud, Philippe Darondeau. Distributing Finite Automata through Petri Net Synthesis. Journal on Formal Aspects of Computing, 13:447-470, 2002.
  15. Philippe Darondeau. On the Petri net realization of context-free graphs. Theoretical Computer Science, 258(1):573-598, 2001.
  16. Eric Badouel, Philippe Darondeau, Jean-Claude Raoult. Context-Free Event Domains are Recognizable. Information and Computation, 149(2):134-172, 1999.
  17. Eric Badouel, Luca Bernardinello, Philippe Darondeau. The synthesis problem for elementary nets is NP-complete. Theoretical Computer Science, 186:107-134, 1997.
  18. Eric Badouel, Philippe Darondeau. Trace nets and process automata. Acta Informatica, 32:647-681, 1995.

Book Chapters

  1. E. Best, Ph. Darondeau. Petri Net Distributability. In PSI'11 - Ershov Memorial Conference, Springer-Verlag (ed.), Lecture Notes in Computer Science, Volume 7162, Pages 1-18, 2012.
  2. Eric Badouel, Philippe Darondeau, Laure Petrucci. Modular Synthesis of Petri Nets from Regular Languages. In Perspectives in Concurrency Theory (A Festschrift for Thiagarajan), pp. 1-21, Universities Press (India), 2009.
  3. Philippe Darondeau. On the Synthesis of Zero-Safe Nets. In Concurrency, Graphs and Models. Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday, Springer Berlin / Heidelberg (ed.), Lecture Notes in Computer Science, Volume 5065, 2008.
  4. Philippe Darondeau. Unbounded Petri Net Synthesis. In Lectures on Concurrency and Petri Nets, Jörg Desel, Wolfgang Reisig, Grzegorz Rozenberg (eds.), Lecture Notes in Computer Science, Volume 3098, Pages 413-438, 2004.
  5. Marek Bednarczyk, Philippe Darondeau. Looking for diamonds. In Synthesis and Control of Discrete Event Systems, Benoît Caillaud, Philippe Darondeau, L. Lavagno, X. Xie (eds.), Pages 214-219, 2002.
  6. Eric Badouel, Marek A. Bednarczyk, Philippe Darondeau. Generalized Automata and their Net Representations. In Unifying Petri Nets, Advances in Petri Nets, H. Ehrig, G. Juhás, J. Padberg, G. Rozenberg (eds.), Lecture Notes in Computer Science, Volume 2128, Pages 304-345, 2001.
  7. Benoît Caillaud, Philippe Darondeau, Loïc Hélouët, Gilles Lesventes. HMSCs as specifications. with PN as completions. In Modeling and Verification of Parallel Processes, F. Cassez, Claude Jard, B. Rozoy, M. Dermot (eds.), Lecture Notes in Computer Science, Volume 2067, Pages 125-152, 2001.
  8. Eric Badouel, Philippe Darondeau. Theory of regions. In Lectures on Petri Nets I: Basic Models, Vol. 1491, pp. 529-586, Lecture Notes in Computer Science, Springer, 1998.

International Conferences

  1. Ph. Darondeau. Enforcing Opacity of Regular Predicates on Modal Transition Systems. In Workshop on Discrete Event Systems, WODES'12, Guadalajara, Mexico, October 2012
    (to appear as an IFAC-onlinepaper)
    preliminary version
  2. E. Best, Ph. Darondeau. Deciding Selective Declassification of Petri Nets. In POST'12 - Principles of Security and Trust, Springer-Verlag (ed.), Lecture Notes in Computer Science, Volume 7215, Pages 290-308, 2012.
  3. E. Badouel, A. Bouillard, Ph. Darondeau, J. Komenda. Residuation of tropical series: rationality issues. In CDC-ECC'11 - IEEE Conference on Decision and Control, IEEE Press, New York, Pages 3855-3861, 2011.
  4. Ph. Darondeau, S. Demri, R. Meyer, C. Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. In FSTTCS'11 - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (ed.), LIPIcs, Volume 13, Pages 140-151, 2011.
  5. Ph. Darondeau, L. Helouet, M. Mukund. Assembling Sessions. In ATVA'11 - Automated Technology for Verification and Analysis, Springer-Verlag (ed.), Lecture Notes in Computer Science, Volume 6996, Pages 259-274, 2011.
  6. Philippe Darondeau, Laurie Ricker. Towards Distributed Control of Discrete Event Systems. In Workshop on Applications of Region Theory (ART-2011), pp. 63-78, Newcastle, UK, June 2011.
  7. Ph. Darondeau, J. Dubreil, H. Marchand. Supervisory Control for Modal Specifications of Services. In Workshop on Discrete Event Systems, WODES'10, Pages 428-435, Berlin, Germany, August 2010.
  8. Eike Best, Philippe Darondeau, Roberto Gorrieri. On the Decidability of Non Interference over Unbounded Petri Nets. In 8th International Workshop on Security Issues in Concurrency, SecCo 2010 , Paris, France, August 2010.
  9. Eike Best, Philippe Darondeau. Separability in Persistent Petri Nets. In Applications and Theory of Petri Nets, ATPN 2010, Pages 246-266, Braga, Portugal, June 2010.
  10. Philippe Darondeau, Blaise Genest, P. S. S. Thiagarajan, Shaofa Yang. Quasi-Static Scheduling of Communicating Tasks. In CONCUR 2008 - Concurrency Theory, Springer-Verlag (ed.), Lecture Notes in Computer Science, Volume 5201, Pages 310-324, Berlin/Heidelberg, 2008.
  11. Philippe Darondeau, Blaise Genest, Loïc Hélouët. Products of Message Sequence Charts. In Foundations of Software Science and Computational Structures, Springer Berlin / Heidelberg (ed.), Lecture Notes in Computer Science, Volume 4962, Pages 458-473, 2008.
  12. Philippe Darondeau, Maciej Koutny, Marta Pietkiewicz-Koutny, Alex Yakovlev. Synthesis of Nets with Step Firing Policies. In Applications and Theory of Petri Nets, Springer Berlin / Heidelberg (ed.), Lecture Notes in Computer Science, Volume 5062, Pages 112-131, 2008.
  13. Eike Best, Philippe Darondeau. Decomposition Theorems for Bounded Persistent Petri Nets. In Applications and Theory of Petri Nets, Springer Berlin / Heidelberg (ed.), Lecture Notes in Computer Science, Volume 5062, Pages 33-51, 2008.
  14. Jérémy Dubreil, Philippe Darondeau, Hervé Marchand. Opacity Enforcing Control Synthesis. In Proceedings of the 9th International Workshop on Discrete Event Systems (WODES'08), B. Lennartson, M. Fabian, K. Akesson, A. Giua, R. Kumar (eds.), Pages 28-35, Göteborg, Sweden, May 2008.
  15. Philippe Darondeau. Synthesis and Control of Asynchronous and Distributed Systems. In 78th International Conference on Application of Concurrency to System Design, T. Basten, G. Juhas, S. Shukla (eds.), Bratislava, Slovak Republic, July 2007.
  16. Eric Badouel, Marek A. Bednarczyk, Andrzej Borzyszkowski, Benoît Caillaud, Philippe Darondeau. Concurrent Secrets. In 8th Workshop on Discrete Event Systems, WODES'06, S. Lafortune, F. Lin, D. Tilbury (eds.), Ann Arbor, Michigan, USA, July 2006.
  17. Philippe Darondeau. Distributed implementations of Ramadge-Wonham supervisory control with Petri nets. In 44th IEEE Conference on Decision and Control and European Control Conference , Pages 2107-2112, Sevilla, Spain, December 2005.
  18. Philippe Darondeau. Region Based Synthesis of P/T-Nets and Its Potential Applications. In Proceedings of the 21st International Conference on Application and Theory of Petri Nets, ICATPN 2000, Lecture Notes in Computer Science, Volume 1825, Aarhus, Denmark, June 2000.
  19. Eric Badouel, Philippe Darondeau, Andrew Tokmakoff. Modelling Dynamic Agents Systems with Cooperating Automata. In PDPTA'99, Pages 11-17, Las Vegas, USA, 1999.
  20. Philippe Darondeau. Deriving unbounded nets from formal languages. In CONCUR'98, Lecture Notes in Computer Science, Volume 1466, Pages 533-548, 1998.
  21. Eric Badouel, Philippe Darondeau. Stratified Petri Nets. In FCT'97, Lecture Notes in Computer Science, Volume 1279, Pages 117-128, 1998.
  22. Eric Badouel, Philippe Darondeau. A survey on net synthesis. In CESA'96 IMACS Multiconference, IEEE-SMC, Pages 309-316, 1996.
  23. Eric Badouel, Philippe Darondeau. Dualities Between Nets and Automata Induced by Schizophrenic Objects. In CTCS'95, Lecture Notes in Computer Science, Volume 953, Pages 24-43, 1995.
  24. Eric Badouel, Philippe Darondeau, Jean-Claude Raoult. Context-Free Event Domains are Recognizable. In AMAST'95, Lecture Notes in Computer Science, Volume 936, Pages 214-229, 1995.
  25. Eric Badouel, Philippe Darondeau, Luca Bernardinello. Polynomial Algorithms for the Synthesis of Bounded Nets. In CAAP'95, Lecture Notes in Computer Science, Volume 915, Pages 364-378, 1995.
Valid XHTML 1.0 Strict | Valid CSS |
© Copyright 2011, Philippe Darondeau