Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=6709

• Occurrence nets then and now: The path to structured occurrence nets
  Brian Randell
  Lecture Notes in Computer Science 6709, 2011, pp. 1-16
• How might Petri nets enhance your systems biology toolkit
  Monika Heiner, David Gilbert
  Lecture Notes in Computer Science 6709, 2011, pp. 17-37
• State estimation and fault detection using Petri nets
  Alessandro Giua
  Lecture Notes in Computer Science 6709, 2011, pp. 38-48
• Forward analysis and model checking for trace bounded WSTS
  Pierre Chambart, Alain Finkel, Sylvain Schmitz
  Lecture Notes in Computer Science 6709, 2011, pp. 49-68
• Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning
  Pierre-Alain Reynier, Frédéric Servais
  Lecture Notes in Computer Science 6709, 2011, pp. 69-88
• An algorithm for direct construction of complete merged processes
  Victor Khomenko, Andrey Mokhov
  Lecture Notes in Computer Science 6709, 2011, pp. 89-108
• How much is worth to remember? A taxonomy based on Petri nets unfoldings
  G. Michele Pinna
  Lecture Notes in Computer Science 6709, 2011, pp. 109-128
• Branching processes of general Petri nets
  Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil
  Lecture Notes in Computer Science 6709, 2011, pp. 129-148
• Refinement of synchronizable places with multi-workflow nets: Weak termination preserved!
  Kees M. van Hee, Natalia Sidorova, Jan Martijn van der Werf
  Lecture Notes in Computer Science 6709, 2011, pp. 149-168
• Modeling and verification of a protocol for operational support using coloured Petri nets
  Michael Westergaard, Fabrizio M. Maggi
  Lecture Notes in Computer Science 6709, 2011, pp. 169-188
• Finding a witness path for non-liveness in free-choice nets
  Harro Wimmel, Karsten Wolf
  Lecture Notes in Computer Science 6709, 2011, pp. 189-207
• A Petri net interpretation of open reconfigurable systems
  Frédéric Peschanski, Hanna Klaudel, Raymond Devillers
  Lecture Notes in Computer Science 6709, 2011, pp. 208-227
• The mutex paradigm of concurrency
  Jetty Kleijn, Maciej Koutny
  Lecture Notes in Computer Science 6709, 2011, pp. 228-247
• On the origin of events: Branching cells as stubborn sets
  Henri Hansen, Xu Wang
  Lecture Notes in Computer Science 6709, 2011, pp. 248-267
• On parametric steady state analysis of a generalized stochastic Petri net with a fork-join subnet
  Jonathan Billington, Guy Edward Gallasch
  Lecture Notes in Computer Science 6709, 2011, pp. 268-287
• Synthesis and analysis of product-form Petri nets
  S. Haddad, J. Mairesse, H.-T. Nguyen
  Lecture Notes in Computer Science 6709, 2011, pp. 288-307
• A tool for automated test code generation from high-level Petri nets
  Dianxiang Xu
  Lecture Notes in Computer Science 6709, 2011, pp. 308-317
• The ePNK: An extensible Petri net tool for PNML
  Ekkart Kindler
  Lecture Notes in Computer Science 6709, 2011, pp. 318-327
• Access/CNP 2.0: A high-level interface to coloured Petri net models
  Michael Westergaard
  Lecture Notes in Computer Science 6709, 2011, pp. 328-337
• Crocodile: A symbolic/symbolic tool for the analysis of symmetric nets with bag
  M. Colange, S. Baarir, F. Kordon, Y. Thierry-Mieg
  Lecture Notes in Computer Science 6709, 2011, pp. 338-347