nets

Books

  1. G. Ciardo, P. 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. details doi
  2. B. Caillaud, P. Darondeau, L. Lavagno, Xiaolan Xie (eds.). Synthesis and Control of Discrete Event Systems. Kluwer Academic Press, 2002. details download
  3. P. Darondeau, L. Lavagno (eds.). Proceedings of the Workshop on Synthesis of Concurrent Systems. Newcastle upon Tyne, UK, June 2001. details

Academic Journals

  1. E. Best, P. Darondeau. Separability in Persistent Petri Nets. Fundamenta Informaticae, to appear, 2011. details
  2. E. Best, P. Darondeau. A decomposition theorem for finite persistent transition systems. Acta Informatica, 46:237-254, 2009. details doi
  3. P. Darondeau, M. Koutny, M. Pietkiewicz-Koutny, A. Yakovlev. Synthesis of Nets with Step Firing Policies. Fundamenta Informaticae, 94(3):275-474, 2009. details
  4. E. Best, P. Darondeau, H. Wimmel. Making Petri Nets Safe and Free of Internal Transitions. Fundamenta Informaticae, 80(1):75-90, 2007. details
  5. A. Borzyszkowski, P. Darondeau. Transition systems without transitions. Theoretical Computer Science, 338:1-16, 2005. details doi
  6. P. Darondeau. Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets. Information Processing Letters, 94:241-245, 2005. details doi
  7. P. Darondeau, X. Xie. Linear Control of Live Marked Graphs. Automatica, 39(3):429-440, 2003. details doi
  8. P. Darondeau. On the Petri net realization of context-free graphs. Theoretical Computer Science, 258(1):573-598, 2001. details doi

Book Chapters

  1. P. Darondeau. Unbounded Petri Net Synthesis. In Lectures on Concurrency and Petri Nets, Jörg Desel, Wolfgang Reisig, Grzegorz Rozenberg (eds.), Vol. 3098, pp. 413-438, Lecture Notes in Computer Science, Springer, 2004. details pdf
  2. M. Bednarczyk, P. Darondeau. Looking for diamonds. In Synthesis and Control of Discrete Event Systems, B. Caillaud, P. Darondeau, L. Lavagno, X. Xie (eds.), pp. 214-219, Kluwer Academic Publishers, 2002. details download
  3. B. Caillaud, P. Darondeau, L. Hélouet, G. Lesventes. HMSCs as specifications. with PN as completions. In Modeling and Verification of Parallel Processes, F. Cassez, Claude Jard, B. Rozoy, M. Dermot (eds.), Vol. 2067, pp. 125-152, Lecture Notes in Computer Science, Springer, 2001. details ps

International Conferences

  1. E. Best, P. Darondeau. Petri Net Distributability. In PSI, Lecture Notes in Computer Science, to appear, Volume 7162, 2011. details
  2. E. Best, P. Darondeau, R. 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. details
  3. E. Best, P. Darondeau. Separability in Persistent Petri Nets. In Applications and Theory of Petri Nets, ATPN 2010, Pages 246-266, Braga, Portugal, June 2010. details
  4. P. Darondeau, M. Koutny, M. Pietkiewicz-Koutny, A. 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. details doi
  5. E. Best, P. 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. details doi
  6. P. 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. details pdf
  7. M. Bednarczyk, P. Darondeau. Looking for diamonds. In Proceedings of the Workshop on Synthesis of Concurrent Systems, P. Darondeau, L. Lavagno (eds.), Pages 11-18, Newcastle upon Tyne, UK, June 2001. details
  8. B. Caillaud, P. Darondeau, L. Hélouet, G. Lesventes. HMSCs as specifications. with PN as completions. In Proceedings of the summer school MOVEP'2k: Modelling and verification of parallel processes, F. Cassez, Claude Jard, B. Rozoy, M. Ryan (eds.), Pages 87-103, Nantes, June 2000. details
  9. P. 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, Invited paper, Volume 1825, Aarhus, Denmark, June 2000. details download
  10. P. Darondeau. Deriving unbounded nets from formal languages. In CONCUR'98, Lecture Notes in Computer Science, Volume 1466, Pages 533-548, 1998. details

Invited Conferences

  1. P. 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. details doi

Research Reports

  1. P. Darondeau, L. Petrucci. Modular Automata 2 Distributed Petri Nets 4 Synthesis. Research Report INRIA, No 6192, May 2007. details download
  2. A. Borzyszkowski, P. Darondeau. Transition Systems without Transitions. Manuscript IPI PAN, No 964, October 2003. details ps
  3. P. Darondeau, H. Wimmel. From bounded T-systems to 1-safe T-systems up to language equivalence. Research report INRIA Rennes, No 4708, January 2003. details download
  4. P. Darondeau, X. Xie. Linear Control of Live Marked Graphs. Research report INRIA Rennes, No 4251, July 2001. details download
  5. B. Caillaud, P. Darondeau, L. Hélouet, G. Lesventes. HMSCs as specifications. with PN as completions. Research report INRIA Rennes, No 3970, July 2000. details download
  6. P. Darondeau. On the Petri Net Realization of Context-Free Graphs. Research report INRIA Rennes, No 3674, May 1999. details download
  7. P. Darondeau, V. Schmitt. State Graphs of Stratified Flip-Flop Nets. Research report IRISA, No 1177, March 1998. details download
  8. P. Darondeau. Deriving Unbounded Petri Nets from Formal Languages. Research report INRIA Rennes, No 3365, February 1998. details 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.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic