Petri nets

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. details
  2. Fourth International Conference on Application of Concurrency to System Design. Mike Kishinevsky, Philippe Darondeau (eds.), IEEE Computer Society, 2004. details
  3. Benoît Caillaud, Philippe Darondeau, Luciano Lavagno, Xiaolan Xie (eds.). Synthesis and Control of Discrete Event Systems. Kluwer Academic Press, 2002. details download
  4. Benoît Caillaud, X. Xie (eds.). Proceedings of the Symposium on the Supervisory Control of Discrete Event Systems, SCODES'2001. Paris, France, July 2001. details
  5. Philippe Darondeau, Luciano Lavagno (eds.). Proceedings of the Workshop on Synthesis of Concurrent Systems. Newcastle upon Tyne, UK, June 2001. details

Academic Journals

  1. Eike Best, Philippe Darondeau. Separability in Persistent Petri Nets. Fundamenta Informaticae, 2011. details
  2. Eike Best, Philippe Darondeau. A decomposition theorem for finite persistent transition systems. Acta Informatica, 46:237-254, 2009. details
  3. Philippe Darondeau, Maciej Koutny, Marta Pietkiewicz-Koutny, Alex Yakovlev. Synthesis of Nets with Step Firing Policies. Fundamenta Informaticae, 94(3):275-474, 2009. details
  4. Eric Badouel, Jules Chenou, Gurvan Guillou. An axiomatization of the token game based on Petri algebras. Fundamenta Informaticae, 77(3):187-215, 2007. details
  5. Eike Best, Philippe Darondeau, Harro Wimmel. Making Petri Nets Safe and Free of Internal Transitions. Fundamenta Informaticae, 80(1):75-90, 2007. details
  6. Eric Badouel, Jules Chenou, Goulven Guillou. An axiomatization of the token game based on Petri algebras. Fundamenta Informaticae, 76:1-30, 2006. details
  7. Andrzej Borzyszkowski, Philippe Darondeau. Transition systems without transitions. Theoretical Computer Science, 338:1-16, 2005. details
  8. 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. details
  9. Guillaume Feuillade, Sophie Pinchinat. Spécifications modales de réseaux de Petri. Journal Européen des Systèmes Automatisés, 39(1), October 2005. details
  10. Eric Badouel, Philippe Darondeau. The synthesis of Petri nets from path-automatic specifications. Information and Computation, 193:117-135, 2004. details
  11. Philippe Darondeau, Xiaolan Xie. Linear Control of Live Marked Graphs. Automatica, 39(3):429-440, 2003. details
  12. Eric Badouel, Benoît Caillaud, Philippe Darondeau. Distributing Finite Automata through Petri Net Synthesis. Journal on Formal Aspects of Computing, 13:447-470, 2002. details
  13. Philippe Darondeau. On the Petri net realization of context-free graphs. Theoretical Computer Science, 258(1):573-598, 2001. details
  14. Benoît Caillaud. Bounded Petri-net synthesis techniques and their applications to the distribution of reactive automata. JESA, European Journal on Automated Systems, 33(8):925-942, 1999. details

Book Chapters

  1. 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. details
  2. 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. details

International Conferences

  1. Eike Best, Philippe Darondeau. Petri Net Distributability. In PSI, Lecture Notes in Computer Science, Volume 7162, 2011. details
  2. 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. details
  3. 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. details
  4. 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. details
  5. Mateus Oliveira. Hasse Diagram Generators and Petri Nets. In Petri Nets 2009: 30th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency, Lecture Notes in Computer Science, Volume, Paris, France, June 2009. details
  6. 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. details
  7. 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. details
  8. 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. details
  9. Eric Badouel, Jules Chenou, Goulven Guillou. Petri Algebras. In Automata, Languages and Programming, ICALP'2005, L. Caires, G. Italiano, L. Monteiro, C. Palamidessi, M. Yung (eds.), Lecture Notes in Computer Science, Volume 3580, Pages 742-754, 2005. details
  10. 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. details
  11. Eric Badouel, Jules Chenou. Les algèbres de Petri commutatives. In 7th African Conference on Research in Computer Science, CARI'04, 2004. details
  12. 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. details
  13. Eric Badouel, Jules Chenou. Nets Enriched over Closed Monoidal Structures. In Applications and Theory of Petri Nets 2003: 24th International Conference, ICATPN 2003, W. van der Aalst, E. Best (eds.), Lecture Notes in Computer Science, Volume 2679, Pages 64-81, Eindhoven, The Netherlands, June 2003. details
  14. Marek A. Bednarczyk, Luca Bernardinello, Benoît Caillaud, W. Pawlowski, Lucia Pomello. Modular system development with pullbacks. In Applications and Theory of Petri Nets 2003, Lecture Notes in Computer Science, Volume 2679, Pages 140-160, June 2003. details
  15. 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. details download
  16. 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. details download
  17. 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. details
  18. 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. details
  19. 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. details download
  20. Philippe Darondeau. Deriving unbounded nets from formal languages. In CONCUR'98, Lecture Notes in Computer Science, Volume 1466, Pages 533-548, 1998. details

Research Reports

  1. Philippe Darondeau, Laure Petrucci. Modular Automata 2 Distributed Petri Nets 4 Synthesis. Research Report INRIA, No 6192, May 2007. details download
  2. Eric Badouel, Jules Chenou, Goulven Guillou. Petri Algebras. Research Report INRIA, No 5355, November 2004. details download
  3. Andrzej Borzyszkowski, Philippe Darondeau. Transition Systems without Transitions. Manuscript IPI PAN, No 964, October 2003. details
  4. Marek A. Bednarczyk, Luca Bernardinello, Benoît Caillaud, W. Pawlowski, Lucia Pomello. Modular system development with pullbacks. Research report INRIA Rennes, No 4828, May 2003. details download
  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. details download
  6. Eric Badouel, Philippe Darondeau. The Petri net synthesis problem for automatic graphs. Research report INRIA Rennes, No 4661, December 2002. details download
  7. Philippe Darondeau, Xiaolan Xie. Linear Control of Live Marked Graphs. Research report INRIA Rennes, No 4251, July 2001. details 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. details download
  9. Philippe Darondeau. On the Petri Net Realization of Context-Free Graphs. Research report INRIA Rennes, No 3674, May 1999. details download
  10. Philippe Darondeau, Vincent Schmitt. State Graphs of Stratified Flip-Flop Nets. Research report IRISA, No 1177, March 1998. details download
  11. Philippe Darondeau. Deriving Unbounded Petri Nets from Formal Languages. Research report INRIA Rennes, No 3365, February 1998. details download

Thesis

  1. Benoît Caillaud. Analysis, Control and Synthesis of Concurrent Systems. Habilitation à diriger des recherches University of Rennes 1, March 2011. details
  2. Guillaume Feuillade. Spécification logique de réseaux de Petri. PhD Thesis Université de Rennes 1, école doctorale MATISSE, December 2005. details

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 part the S4 project web site.
It has been automatically generated using the bib2html program.