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=7347

• Net models for concurrent object behaviour
  Tony Hoare
  Lecture Notes in Computer Science 7347, 2012, pp. 1-2
• The theory of WSTS: The case of complete WSTS
  Alain Finkel, Jean Goubault-Larrecq
  Lecture Notes in Computer Science 7347, 2012, pp. 3-31
• Using colored Petri nets to construct coalescent hidden Markov models: Automatic translation from demographic specifications to efficient inference methods
  Thomas Mailund, Anders E. Halager, Michael Westergaard
  Lecture Notes in Computer Science 7347, 2012, pp. 32-50
• An SMT-based discovery algorithm for C-nets
  Marc Solé, Josep Carmona
  Lecture Notes in Computer Science 7347, 2012, pp. 51-71
• Decomposing process mining problems using passages
  Wil M.P. van der Aalst
  Lecture Notes in Computer Science 7347, 2012, pp. 72-91
• Complexity of the soundness problem of bounded workflow nets
  Guan Jun Liu, Jun Sun, Yang Liu, Jin Song Dong
  Lecture Notes in Computer Science 7347, 2012, pp. 92-107
• Cost soundness for priced resource-constrained workflow nets
  María Martos-Salgado, Fernando Rosa-Velardo
  Lecture Notes in Computer Science 7347, 2012, pp. 108-127
• On the \alpha-reconstructibility of workflow nets
  Eric Badouel
  Lecture Notes in Computer Science 7347, 2012, pp. 128-147
• On profiles and footprints - Relational semantics for Petri nets
  Matthias Weidlich, Jan Martijn van der Werf
  Lecture Notes in Computer Science 7347, 2012, pp. 148-167
• Data and abstraction for scenario-based modeling with Petri nets
  Dirk Fahland, Robert Prüfer
  Lecture Notes in Computer Science 7347, 2012, pp. 168-187
• Maximal confluent processes
  Xu Wang
  Lecture Notes in Computer Science 7347, 2012, pp. 188-207
• Old and new algorithms for minimal coverability sets
  Antti Valmari, Henri Hansen
  Lecture Notes in Computer Science 7347, 2012, pp. 208-227
• Stubborn sets for simple linear time properties
  Andreas Lehmann, Niels Lohmann, Karsten Wolf
  Lecture Notes in Computer Science 7347, 2012, pp. 228-247
• Hybrid on-the-fly LTL model checking with the sweep-line method
  Sami Evangelista, Lars Michael Kristensen
  Lecture Notes in Computer Science 7347, 2012, pp. 248-267
• Safety slicing Petri nets
  Astrid Rakow
  Lecture Notes in Computer Science 7347, 2012, pp. 268-287
• Capacity planning for vertical search engines: An approach based on coloured Petri nets
  Veronica Gil-Costa, Jair Lobos, Alonso Inostrosa-Psijas, Mauricio Marin
  Lecture Notes in Computer Science 7347, 2012, pp. 288-307
• An infrastructure for cost-effective testing of operational support algorithms based on colored Petri nets
  Joyce Nakatumba, Michael Westergaard, Wil M.P. van der Aalst
  Lecture Notes in Computer Science 7347, 2012, pp. 308-327
• Designing weakly terminating ROS systems
  Debjyoti Bera, Kees M. van Hee, Jan Martijn van der Werf
  Lecture Notes in Computer Science 7347, 2012, pp. 328-347
• Nets-within-nets to model innovative space system architectures
  Frédéric Cristini, Catherine Tessier
  Lecture Notes in Computer Science 7347, 2012, pp. 348-367
• P- and T-Systems in the nets-within-nets-formalism
  Frank Heitmann, Michael Köhler-Bußmeier
  Lecture Notes in Computer Science 7347, 2012, pp. 368-387
• Stochastic modeling and analysis using QPME: Queueing Petri net modeling environment v2.0
  Simon Spinner, Samuel Kounev, Philipp Meier
  Lecture Notes in Computer Science 7347, 2012, pp. 388-397
• Snoopy - A unifying Petri net tool
  Monika Heiner, Mostafa Herajy, Fei Liu, Christian Rohr, Martin Schwarick
  Lecture Notes in Computer Science 7347, 2012, pp. 398-407
• CPN assistant II: A tool for management of networked simulations
  S̑tefan Korec̑ko, Ján Marcinc̑in, Viliam Slodic̑ák
  Lecture Notes in Computer Science 7347, 2012, pp. 408-417