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

• Instance Deadlock: A mystery behind frozen programs
  Gabriel Juhás, Igor Kazlov, Ana Juhásová
  Lecture Notes in Computer Science 6128, 2010, pp. 1-17
• Some thoughts on behavioral programming - Distinguished Carl Adam Petri Lecture
  David Harel
  Lecture Notes in Computer Science 6128, 2010, pp. 18-18
• Petri nets with localities and testing
  Jetty Kleijn, Maciej Koutny
  Lecture Notes in Computer Science 6128, 2010, pp. 19-38
• A perspective on explicit state space exploration of Coloured Petri Nets: Past, present, and future
  Lars M. Kristensen
  Lecture Notes in Computer Science 6128, 2010, pp. 39-42
• Can stubborn sets be optimal?
  Antti Valmari, Henri Hansen
  Lecture Notes in Computer Science 6128, 2010, pp. 43-62
• Efficient computation of causal behavioural profiles using structural decomposition
  Matthias Weidlich, Artem Polyvyanyy, Jan Mendling, Mathias Weske
  Lecture Notes in Computer Science 6128, 2010, pp. 63-83
• Canonical transition set semantics for Petri nets
  Yunhe Wang, Li Jiao
  Lecture Notes in Computer Science 6128, 2010, pp. 84-103
• A characterization of combined traces using labeled stratified order structures
  Dai Tri Man Lê
  Lecture Notes in Computer Science 6128, 2010, pp. 104-124
• Integrated process planning and supply chain configuration for commodity assemblies using Petri nets
  Oleg Gusikhin, Erica Klampfl
  Lecture Notes in Computer Science 6128, 2010, pp. 125-144
• The NEO protocol for large-scale distributed database systems: Modelling and initial verification
  Christine Choppy, Anna Dedova, Sami Evangelista, Silien Hong, Kais Klai, Laure Petrucci
  Lecture Notes in Computer Science 6128, 2010, pp. 145-164
• Factorization properties of symbolic unfoldings of colored Petri nets
  Thomas Chatain, Eric Fabre
  Lecture Notes in Computer Science 6128, 2010, pp. 165-184
• Forward analysis for Petri nets with name creation
  Fernando Rosa-Velardo, David de Frutos-Escrig
  Lecture Notes in Computer Science 6128, 2010, pp. 185-205
• Learning workflow Petri nets
  Javier Esparza, Martin Leucker, Maximilian Schlund
  Lecture Notes in Computer Science 6128, 2010, pp. 206-225
• Process mining from a basis of state regions
  Marc Solé, Josep Carmona
  Lecture Notes in Computer Science 6128, 2010, pp. 226-245
• Separability in persistent Petri nets
  Eike Best, Philippe Darondeau
  Lecture Notes in Computer Science 6128, 2010, pp. 246-266
• New algorithms for deciding the siphon-trap property
  Olivia Oanea, Harro Wimmel, Karsten Wolf
  Lecture Notes in Computer Science 6128, 2010, pp. 267-286
• AlPiNA: A symbolic model checker
  Didier Buchs, Steve Hostettler, Alexis Marechal, Matteo Risoldi
  Lecture Notes in Computer Science 6128, 2010, pp. 287-296
• Wendy: A tool to synthesize partners for services
  Niels Lohmann, Daniela Weinberg
  Lecture Notes in Computer Science 6128, 2010, pp. 297-307
• GreatSPN enhanced with decision diagram data structures
  Junaid Babar, Marco Beccuti, Susanna Donatelli, Andrew Miner
  Lecture Notes in Computer Science 6128, 2010, pp. 308-317
• PNML framework: An extendable reference implementation of the Petri net markup language
  L.M. Hillah, F. Kordon, L. Petrucci, N. Tr`eves
  Lecture Notes in Computer Science 6128, 2010, pp. 318-327