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

• Making work flow: On the application of Petri nets to business process management
  Wil M.P. van der Aalst
  Lecture Notes in Computer Science 2360, 2002, pp. 1-22
• Model validation - A theoretical issue?
  Jörg Desel
  Lecture Notes in Computer Science 2360, 2002, pp. 23-43
• The real-time refinement calculus: A foundation for machine-independent real-time programming
  Ian J. Hayes
  Lecture Notes in Computer Science 2360, 2002, pp. 44-58
• The challenge of object orientation for the analysis of concurrent systems
  Charles Lakos
  Lecture Notes in Computer Science 2360, 2002, pp. 59-67
• Abstract cyclic communicating processes: A logical view
  P.S. Thiagarajan
  Lecture Notes in Computer Science 2360, 2002, pp. 68-69
• Is the die cast for the token game?
  Alex Yakovlev
  Lecture Notes in Computer Science 2360, 2002, pp. 70-79
• Quasi-static scheduling of independent tasks for reactive systems
  Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Claudio Passerone, Yosinori Watanabe
  Lecture Notes in Computer Science 2360, 2002, pp. 80-100
• Data decision diagrams for Petri net analysis
  Jean-Michel Couvreur, Emmanuelle Encrenaz, Emmanuel Paviot-Adet, Denis Poitrenaud, Pierre-André Wacrenier
  Lecture Notes in Computer Science 2360, 2002, pp. 101-120
• Non-controllable choice robustness expressing the controllability of workflow processes
  Juliane Dehnert
  Lecture Notes in Computer Science 2360, 2002, pp. 121-141
• Real-time synchronised Petri nets
  Giovanna Di Marzo Serugendo, Dino Mandrioli, Didier Buchs, Nicolas Guelfi
  Lecture Notes in Computer Science 2360, 2002, pp. 142-162
• Computing a finite prefix of a time Petri net
  Hans Fleischhack, Christian Stehno
  Lecture Notes in Computer Science 2360, 2002, pp. 163-181
• Verification of a revised WAP wireless transaction protocol
  Steven Gordon, Lars Kristensen, Jonathan Billington
  Lecture Notes in Computer Science 2360, 2002, pp. 182-202
• Characterizing liveness of Petri nets in terms of siphons
  Li Jiao, To-Yat Cheung, Weiming Lu
  Lecture Notes in Computer Science 2360, 2002, pp. 203-216
• Petri nets, situations, and automata
  Ekkart Kindler
  Lecture Notes in Computer Science 2360, 2002, pp. 217-236
• Reproducibility of the empty marking
  Kurt Lautenbach
  Lecture Notes in Computer Science 2360, 2002, pp. 237-253
• Modeling and analysis of multi-class threshold-based queues with hysteresis using stochastic Petri nets
  Louis-Marie Le Ny, Bruno Tuffin
  Lecture Notes in Computer Science 2360, 2002, pp. 254-272
• Tackling the infinite state space of a multimedia control protocol service specification
  Lin Liu, Jonathan Billington
  Lecture Notes in Computer Science 2360, 2002, pp. 273-293
• Modelling of features and feature interactions in Nokia mobile phones using Coloured Petri Nets
  Louise Lorentsen, Antti-Pekka Tuovinen, Jianli Xu
  Lecture Notes in Computer Science 2360, 2002, pp. 294-313
• Analysing infinite-state systems by combining equivalence reduction and the sweep-line method
  Thomas Mailund
  Lecture Notes in Computer Science 2360, 2002, pp. 314-334
• Regular event structures and finite Petri nets: The conflict-free case
  Mogens Nielsen, P.S. Thiagarajan
  Lecture Notes in Computer Science 2360, 2002, pp. 335-351
• A formal service specification for the Internet Open Trading Protocol
  Chun Ouyang, Lars Michael Kristensen, Jonathan Billington
  Lecture Notes in Computer Science 2360, 2002, pp. 352-373
• Transition refinement for deriving a distributed minimum weight spanning tree algorithm
  Sibylle Peuker
  Lecture Notes in Computer Science 2360, 2002, pp. 374-393
• Token-controlled place refinement in hierarchical Petri nets with application to active document workflow
  David Stork, Rob van Glabbeek
  Lecture Notes in Computer Science 2360, 2002, pp. 394-413
• Translating TPAL specifications into Timed-Arc Petri nets
  Valentín Valero, Juan José Pardo, Fernando Cuartero
  Lecture Notes in Computer Science 2360, 2002, pp. 414-433
• Maria: Modular reachability analyser for algebraic system nets
  Marko Mäkelä
  Lecture Notes in Computer Science 2360, 2002, pp. 434-444