Publications of Philippe Darondeau

Load the BibTeX file

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, Miami, USA, June 2005.
2. Benoît Caillaud, Philippe Darondeau, Luciano Lavagno, Xiaolan Xie (eds.). Synthesis and Control of Discrete Event Systems. Kluwer Academic Press, 2002. download
3. Philippe Darondeau, Luciano Lavagno (eds.). Proceedings of the Workshop on Synthesis of Concurrent Systems. Newcastle upon Tyne, UK, June 2001.

Academic Journals

1. Eike Best, Philippe Darondeau. Separability in Persistent Petri Nets. Fundamenta Informaticae, 2011.
2. Philippe Darondeau, Blaise Genest, P.S. Thiagarajan, Shaofa Yang. Quasi-static scheduling of communicating tasks. Information and Computation, 208(10):1154-1168, 2010. download download
3. Philippe Darondeau, Blaise Genest, P.S. Thiagarajan, Shaofa Yang. Quasi-static scheduling of communicating tasks. Information and Computation, 208(10):1154-1168, 2010.
4. Jeremy Dubreil, Philippe Darondeau, Herve Marchand. Supervisory Control for Opacity. IEEE Transactions on Automatic Control, 55(5):1089-1100, May 2010.
5. J. Dubreil, Ph. Darondeau, H. 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.

Book Chapters

1. Maria Paola Cabasino, Philippe Darondeau, Maria Pia Fanti, Carla Seatzu. Model Identification and Synthesis of Discrete-Event Systems. In Contemporary Issues in System Science and Engineering, IEEE-Wiley, 2011.
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. 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, 1999.

International Conferences

1. Eric Badouel, Anne Bouillard, Philippe Darondeau, Jan Komenda. Residuation of tropical series: rationality issues. In CDC-ECC, IEEE society (ed.), 2011.
2. Eike Best, Philippe Darondeau. Petri Net Distributability. In PSI, Lecture Notes in Computer Science, Volume 7162, 2011.
3. Philippe Darondeau, Laurie Ricker. Towards Distributed Control of Discrete Event Systems. In Workshop on Applications of Region Theory, Jörg Desel, Alex Yakovlev (eds.), CEUR Workshop Proceedings, Volume 725, Pages 63-78, 2011. download
4. Philippe Darondeau, Sté Demri, Roland Meyer, Christophe Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, Supratik Chakraborty, Amit Kumar (eds.), LIPIcs, Volume 13, Pages 140-151, 2011.
5. Philippe Darondeau, Lo\"\i Hélou\"et, Madhavan Mukund. Assembling Sessions. In Automated Technology for Verification and Analysis, 9th International Symposium, ATVA 2011, Taipei, Taiwan, October 11-14, 2011. Proceedings, Tevfik Bultan, Pao-Ann Hsiung (eds.), Lecture Notes in Computer Science, Volume 6996, Pages 259-274, 2011.
6. 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.
7. 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.
8. 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.
9. 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.
10. 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.
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. 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.
19. 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. download
20. 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. download
21. 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.
22. Marek Bednarczyk, Philippe Darondeau. Looking for diamonds. In Proceedings of the Workshop on Synthesis of Concurrent Systems, Philippe Darondeau, L. Lavagno (eds.), Pages 11-18, Newcastle upon Tyne, UK, June 2001.
23. 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. download
24. Eric Badouel, Philippe Darondeau, Andrew Tokmakoff. Modelling Dynamic Agents Systems with Cooperating Automata. In PDPTA'99, Pages 11-17, Las Vegas, USA, 1999.
25. Philippe Darondeau. Deriving unbounded nets from formal languages. In CONCUR'98, Lecture Notes in Computer Science, Volume 1466, Pages 533-548, 1998.

Research Reports

1. Philippe Darondeau, Blaise Genest, Loïc Hélouët. Products of Message Sequence Charts. Research Report INRIA, No 6258, July 2007. download
2. Philippe Darondeau, Laure Petrucci. Modular Automata 2 Distributed Petri Nets 4 Synthesis. Research Report INRIA, No 6192, May 2007. download
3. Eric Badouel, Marek A. Bednarczyk, Andrzej Borzyszkowski, Benoît Caillaud, Philippe Darondeau. Concurrent Secrets. Rapport de recherche INRIA, No 5771, November 2005. download
4. Andrzej Borzyszkowski, Philippe Darondeau. Transition Systems without Transitions. Manuscript IPI PAN, No 964, October 2003.
5. Philippe Darondeau, Harro Wimmel. From bounded T-systems to 1-safe T-systems up to language equivalence. Research report INRIA Rennes, No 4708, January 2003. download
6. Eric Badouel, Philippe Darondeau. The Petri net synthesis problem for automatic graphs. Research report INRIA Rennes, No 4661, December 2002. download
7. Philippe Darondeau, Xiaolan Xie. Linear Control of Live Marked Graphs. Research report INRIA Rennes, No 4251, July 2001. download
8. Benoît Caillaud, Philippe Darondeau, Loïc Hélouët, Gilles Lesventes. HMSCs as specifications. with PN as completions. Research report INRIA Rennes, No 3970, July 2000. download
9. Eric Badouel, Philippe Darondeau, Danièle Quichaud, Andrew Tokmakoff. Modelling Dynamic Agents Systems with Cooperating Automata. Research report IRISA, No 1253, June 1999. download
10. Philippe Darondeau. On the Petri Net Realization of Context-Free Graphs. Research report INRIA Rennes, No 3674, May 1999. download
11. Philippe Darondeau, Vincent Schmitt. State Graphs of Stratified Flip-Flop Nets. Research report IRISA, No 1177, March 1998. download
12. Philippe Darondeau. Deriving Unbounded Petri Nets from Formal Languages. Research report INRIA Rennes, No 3365, February 1998. download

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.