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

• Kronecker algebra and (stochastic) Petri nets: Is it worth the effort?
  Susanna Donatelli
  Lecture Notes in Computer Science 2075, 2001, pp. 1-18
• The flux of interaction
  Robin Milner
  Lecture Notes in Computer Science 2075, 2001, pp. 19-22
• Towards a notion of distributed time for Petri nets
  Mogens Nielsen, Vladimiro Sassone, Jiȓí Srba
  Lecture Notes in Computer Science 2075, 2001, pp. 23-31
• Identifying commonalities and differences in object life cycles using behavioral inheritance
  Wil M.P. van der Aalst, Twan Basten
  Lecture Notes in Computer Science 2075, 2001, pp. 32-52
• Timed Petri nets and BQOs
  Parosh Aziz Abdulla, Aletta Nylén
  Lecture Notes in Computer Science 2075, 2001, pp. 53-70
• CPN/Tools: A post-WIMP interface for editing and simulating coloured Petri nets
  Michel Beaudouin-Lafon, Wendy E. Mackay, Peter Andersen, Paul Janecek, Mads Jensen, Michael Lassen, Kasper Lund, Kjeld Mortensen, Stephanie Munck, Anne Ratzer, Katrine Ravn, Sren Christensen, Kurt Jensen
  Lecture Notes in Computer Science 2075, 2001, pp. 71-80
• Petri net based design and implementation methodology for discrete event control systems
  Slavek Bulach, Anton Brauchle, Hans-Jörg Pfleiderer, Zdenek Kucerovsky
  Lecture Notes in Computer Science 2075, 2001, pp. 81-100
• Condensed state spaces for timed Petri nets
  Sren Christensen, Lars Michael Kristensen, Thomas Mailund
  Lecture Notes in Computer Science 2075, 2001, pp. 101-120
• Unfolding of products of symmetrical Petri nets
  Jean-Michel Couvreur, Sébastien Grivet, Denis Poitrenaud
  Lecture Notes in Computer Science 2075, 2001, pp. 121-143
• Partial order verification of programmable logic controllers
  Peter Deussen
  Lecture Notes in Computer Science 2075, 2001, pp. 144-163
• Structural characterization and qualitative properties of product form stochastic Petri nets
  Serge Haddad, Patrice Moreaux, Matteo Sereno, Manuel Silva
  Lecture Notes in Computer Science 2075, 2001, pp. 164-183
• Generalized conditions for liveness enforcement and deadlock prevention in Petri nets
  Marian V. Iordache, Panos J. Antsaklis
  Lecture Notes in Computer Science 2075, 2001, pp. 184-203
• A concurrent semantics of static exceptions in a parallel programming language
  Hanna Klaudel, Franck Pommereau
  Lecture Notes in Computer Science 2075, 2001, pp. 204-223
• Modelling the structure and behaviour of Petri net agents
  Michael Köhler, Daniel Moldt, Heiko Rölke
  Lecture Notes in Computer Science 2075, 2001, pp. 224-241
• Model checking LTL properties of high-level Petri nets with fairness constraints
  Timo Latvala
  Lecture Notes in Computer Science 2075, 2001, pp. 242-262
• Incremental state space construction for coloured Petri nets
  Glenn Lewis, Charles Lakos
  Lecture Notes in Computer Science 2075, 2001, pp. 263-282
• Optimising enabling tests and unfoldings of algebraic system nets
  Marko Mäkelä
  Lecture Notes in Computer Science 2075, 2001, pp. 283-302
• Extending the Petri Box Calculus with time
  Olga Marroquín Alonso, David de Frutos Escrig
  Lecture Notes in Computer Science 2075, 2001, pp. 303-322
• Abstractions and partial order reductions for checking branching properties of Time Petri Nets
  Wojciech Penczek, Agata Póƚrola
  Lecture Notes in Computer Science 2075, 2001, pp. 323-342
• Pr/T-Net based seamless design of embedded real-time systems
  Carsten Rust, Jürgen Tacken, Carsten Böke
  Lecture Notes in Computer Science 2075, 2001, pp. 343-362
• Rewriting logic and elan: Prototyping tools for Petri nets with time
  L. Jason Steggles
  Lecture Notes in Computer Science 2075, 2001, pp. 363-381
• Partial S-invariants for the verification of infinite systems families
  Walter Vogler
  Lecture Notes in Computer Science 2075, 2001, pp. 382-401