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

• Expressiveness and efficient analysis of Stochastic Well-formed Nets
  Giuliana Franceschinis
  Lecture Notes in Computer Science 3536, 2005, pp. 1-14
• Applications of Craig interpolation to model checking
  Kenneth McMillan
  Lecture Notes in Computer Science 3536, 2005, pp. 15-16
• Towards an algebra for security policies
  Jon Pincus, Jeannette M. Wing
  Lecture Notes in Computer Science 3536, 2005, pp. 17-25
• Continuization of timed Petri nets: From performance evaluation to observation and control
  Manuel Silva, Laura Recalde
  Lecture Notes in Computer Science 3536, 2005, pp. 26-47
• Genetic process mining
  W.M.P. van der Aalst, A.K. Alves de Medeiros, A.J.M.M. Weijters
  Lecture Notes in Computer Science 3536, 2005, pp. 48-69
• The (true) concurrent Markov property and some applications to Markov nets
  Samy Abbes
  Lecture Notes in Computer Science 3536, 2005, pp. 70-89
• On the equivalence between liveness and deadlock-freeness in Petri nets
  Kamel Barkaoui, Jean-Michel Couvreur, Kais Klai
  Lecture Notes in Computer Science 3536, 2005, pp. 90-107
• Extremal throughputs in free-choice nets
  Anne Bouillard, Bruno Gaujal, Jean Mairesse
  Lecture Notes in Computer Science 3536, 2005, pp. 108-127
• A framework to decompose GSPN models
  Leonardo Brenner, Paulo Fernandes, Afonso Sales, Thais Webber
  Lecture Notes in Computer Science 3536, 2005, pp. 128-147
• Modeling dynamic architectures using nets-within-nets
  Lawrence Cabac, Michael Duvigneau, Daniel Moldt, Heiko Rölke
  Lecture Notes in Computer Science 3536, 2005, pp. 148-167
• A high level language for structural relations in well-formed nets
  Lorenzo Capra, Massimiliano De Pierro, Giuliana Franceschinis
  Lecture Notes in Computer Science 3536, 2005, pp. 168-187
• Derivation of non-structural invariants of Petri nets using abstract interpretation
  Robert Clarisó, Enric Rodríguez-Carbonell, Jordi Cortadella
  Lecture Notes in Computer Science 3536, 2005, pp. 188-207
• Modeling multi-valued genetic regulatory networks using high-level Petri nets
  Jean-Paul Comet, Hanna Klaudel, Stéphane Liauzu
  Lecture Notes in Computer Science 3536, 2005, pp. 208-227
• Termination properties of TCP's connection management procedures
  Bing Han, Jonathan Billington
  Lecture Notes in Computer Science 3536, 2005, pp. 228-249
• Soundness of resource-constrained workflow nets
  Kees van Hee, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve
  Lecture Notes in Computer Science 3536, 2005, pp. 250-267
• High-level nets with nets and rules as tokens
  Kathrin Hoffmann, Hartmut Ehrig, Mossakowski, Till
  Lecture Notes in Computer Science 3536, 2005, pp. 268-288
• Can I execute my scenario in your net?
  Gabriel Juhás, Robert Lorenz, Jörg Desel
  Lecture Notes in Computer Science 3536, 2005, pp. 289-308
• Reference and value semantics are equivalent for ordinary object Petri nets
  Michael Köhler, Heiko Rölke
  Lecture Notes in Computer Science 3536, 2005, pp. 309-328
• Particle Petri nets for aircraft procedure monitoring under uncertainty
  Charles Lesire, Catherine Tessier
  Lecture Notes in Computer Science 3536, 2005, pp. 329-348
• On the expressive power of Petri net schemata
  W. Reisig
  Lecture Notes in Computer Science 3536, 2005, pp. 349-364
• Determinate STG decomposition of marked graphs
  Mark Schäfer, Walter Vogler, Petr Janc̑ar
  Lecture Notes in Computer Science 3536, 2005, pp. 365-384
• Timed-arc Petri nets vs. networks of timed automata
  Jiȓí Srba
  Lecture Notes in Computer Science 3536, 2005, pp. 385-402
• Specifying and analyzing software safety requirements of a frequency converter using Coloured Petri Nets
  Lisa Wells, Thomas Maier
  Lecture Notes in Computer Science 3536, 2005, pp. 403-422
• Achieving a general, formal and decidable approach to the OR-join in workflow using reset nets
  Moe Thandar Wynn, David Edmond, W.M.P. van der Aalst, A.H.M. ter Hofstede
  Lecture Notes in Computer Science 3536, 2005, pp. 423-443
• The ProM framework: A new era in process mining tool support
  B.F. van Dongen, A.K.A. de Medeiros, H.M.W. Verbeek, A.J.M.M. Weijters, W.M.P. van der Aalst
  Lecture Notes in Computer Science 3536, 2005, pp. 444-454