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

• Design, simulation, and implementation of hybrid systems
  Pravin Varaiya
  Lecture Notes in Computer Science 1639, 1999, pp. 1-5
• Efficient reachability set generation and storage using decision diagrams
  Andrew S. Miner, Gianfranco Ciardo
  Lecture Notes in Computer Science 1639, 1999, pp. 6-25
• Structural methods to improve the symbolic analysis of Petri nets
  Enric Pastor, Jordi Cortadella, Marco A. Peña
  Lecture Notes in Computer Science 1639, 1999, pp. 26-45
• Stubborn sets for standard properties
  Karsten Schmidt
  Lecture Notes in Computer Science 1639, 1999, pp. 46-65
• Petri net based behavioural specification of CORBA systems
  Rémi Bastide, Philippe Palanque, Ousmane Sy, Duc-Hoa Le, David Navarre
  Lecture Notes in Computer Science 1639, 1999, pp. 66-85
• Symmetric communication between coloured Petri net simulations and Java-processes
  Olaf Kummer, Daniel Moldt, Frank Wienberg
  Lecture Notes in Computer Science 1639, 1999, pp. 86-105
• Recent developments in modeling and analysis of hybrid dynamic systems
  Bruce H. Krogh
  Lecture Notes in Computer Science 1639, 1999, pp. 106-106
• Autonomous continuous P/T systems
  Laura Recalde, Enrique Teruel, Manuel Silva
  Lecture Notes in Computer Science 1639, 1999, pp. 107-126
• An approach to the analysis of interworking traders
  A. Tokmakoff, J. Billington
  Lecture Notes in Computer Science 1639, 1999, pp. 127-146
• Parallel approaches to the numerical transient analysis of stochastic reward nets
  Susann Allmaier, David Kreische
  Lecture Notes in Computer Science 1639, 1999, pp. 147-167
• SWN nets as a framework for the specification and the analysis of FT techniques adopted in electric plant automation
  Lorenzo Capra, Rossano Gaeta, Oliver Botti
  Lecture Notes in Computer Science 1639, 1999, pp. 168-187
• Monitoring discrete event systems using Petri net embeddings
  Christoforos N. Hadjicostis, George C. Verghese
  Lecture Notes in Computer Science 1639, 1999, pp. 188-207
• Quasi-static scheduling of embedded software using equal conflict nets
  Marco Sgroi, Luciano Lavagno, Yosinori Watanabe, Alberto Sangiovanni-Vincentelli
  Lecture Notes in Computer Science 1639, 1999, pp. 208-227
• Theoretical aspects of recursive Petri nets
  Serge Haddad, Denis Poitrenaud
  Lecture Notes in Computer Science 1639, 1999, pp. 228-247
• Petri net theory - Problems solved by commutative algebra
  Christoph Schneider, Joachim Wehler
  Lecture Notes in Computer Science 1639, 1999, pp. 248-267
• Testing undecidability of the reachability in Petri nets with the help of 10th Hilbert problem
  Piotr Chrza̧stowski-Wachtel
  Lecture Notes in Computer Science 1639, 1999, pp. 268-281
• Net theory and workflow models
  Giorgio de Michelis
  Lecture Notes in Computer Science 1639, 1999, pp. 282-283
• Concurrent implementation of asynchronous transition systems
  Walter Vogler
  Lecture Notes in Computer Science 1639, 1999, pp. 284-303
• Trace channel nets
  Jean Fanchon
  Lecture Notes in Computer Science 1639, 1999, pp. 304-323
• Reasoning about algebraic generalisation of Petri nets
  Gabriel Juhás
  Lecture Notes in Computer Science 1639, 1999, pp. 324-343
• The box algebra - A model of nets and process expressions
  Eike Best, Raymond Devillers, Maciej Koutny
  Lecture Notes in Computer Science 1639, 1999, pp. 344-363
• Detection of illegal behaviors based on unfoldings
  Jean-Michel Couvreur, Denis Poitrenaud
  Lecture Notes in Computer Science 1639, 1999, pp. 364-383
• Five classes of invariant-preserving transformations on colored Petri nets
  To-Yat Cheung, Yiqin Lu
  Lecture Notes in Computer Science 1639, 1999, pp. 384-403
• Verifying intuition - ILF checks DAWN proofs
  Thomas Baar, Ekkart Kindler, Hagen Völzer
  Lecture Notes in Computer Science 1639, 1999, pp. 404-423