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

• Hardware and Petri nets application to asynchronous circuit design
  Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Alex Yakovlev
  Lecture Notes in Computer Science 1825, 2000, pp. 1-15
• Region based synthesis of P/T-nets and its potential applications
  Philippe Darondeau
  Lecture Notes in Computer Science 1825, 2000, pp. 16-23
• UML - A universal modeling language?
  Gregor Engels, Reiko Heckel, Stefan Sauer
  Lecture Notes in Computer Science 1825, 2000, pp. 24-38
• Verification of timed and hybrid systems
  Kim Guldstrand Larsen
  Lecture Notes in Computer Science 1825, 2000, pp. 39-42
• Parametric stochastic well-formed nets and compositional modelling
  Paolo Ballarini, Susanna Donatelli, Giuliana Franceschinis
  Lecture Notes in Computer Science 1825, 2000, pp. 43-62
• Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets
  Eike Best, Harro Wimmel
  Lecture Notes in Computer Science 1825, 2000, pp. 63-82
• Executing transactions in zero-safe nets
  Roberto Bruni, Ugo Montanari
  Lecture Notes in Computer Science 1825, 2000, pp. 83-102
• Efficient symbolic state-space construction for asynchronous systems
  Gianfranco Ciardo, Gerald Lüttgen, Radu Siminiceanu
  Lecture Notes in Computer Science 1825, 2000, pp. 103-122
• Designing a LTL model-checker based on unfolding graphs
  Jean-Michel Couvreur, Sébastien Grivet, Denis Poitrenaud
  Lecture Notes in Computer Science 1825, 2000, pp. 123-145
• Process semantics of Petri nets over partial algebra
  Jörg Desel, Gabriel Juhás, Robert Lorenz
  Lecture Notes in Computer Science 1825, 2000, pp. 146-165
• User interface prototyping based on UML scenarios and high-level Petri nets
  Mohammed Elkoutbi, Rudolf K. Keller
  Lecture Notes in Computer Science 1825, 2000, pp. 166-186
• Decidability of properties of timed-arc Petri nets
  David de Frutos Escrig, Valentín Valero Ruiz, Olga Marroquín Alonso
  Lecture Notes in Computer Science 1825, 2000, pp. 187-206
• Analysing the WAP class 2 wireless transaction protocol using coloured Petri nets
  Steven Gordon, Jonathan Billington
  Lecture Notes in Computer Science 1825, 2000, pp. 207-226
• Liveness verification of discrete event systems modeled by n-safe ordinary Petri nets
  Kevin X. He, Michael D. Lemmon
  Lecture Notes in Computer Science 1825, 2000, pp. 227-243
• Modelling and analysing the SDL description of the ISDN-DSS1 protocol
  Nisse Husberg, Teemu Tynjälä, Kimmo Varpaaniemi
  Lecture Notes in Computer Science 1825, 2000, pp. 244-260
• Process semantics of P/T-nets with inhibitor arcs
  Jetty Kleijn, Maciej Koutny
  Lecture Notes in Computer Science 1825, 2000, pp. 261-281
• Improved question-guided stubborn set methods for state properties
  Lars Michael Kristensen, Antti Valmari
  Lecture Notes in Computer Science 1825, 2000, pp. 282-302
• A compositional model of time Petri nets
  Maciej Koutny
  Lecture Notes in Computer Science 1825, 2000, pp. 303-322
• Composing abstractions of coloured Petri nets
  Charles Lakos
  Lecture Notes in Computer Science 1825, 2000, pp. 323-345
• Modelling and analysis of a DANFOSS flowmeter system using coloured Petri nets
  Louise Lorentsen, Lars Michael Kristensen
  Lecture Notes in Computer Science 1825, 2000, pp. 346-366
• Automatic code generation method based on coloured Petri net models applied on an access control system
  Kjeld H. Mortensen
  Lecture Notes in Computer Science 1825, 2000, pp. 367-386
• Pre- and post-agglomerations for LTL model checking
  Denis Poitrenaud, Jean-Francois Pradat-Peyre
  Lecture Notes in Computer Science 1825, 2000, pp. 387-408
• Bisimulation and the reduction of Petri nets
  Philippe Schnoebelen, Natalia Sidorova
  Lecture Notes in Computer Science 1825, 2000, pp. 409-423
• Efficiency of asynchronous systems that communicate asynchronously
  Walter Vogler
  Lecture Notes in Computer Science 1825, 2000, pp. 424-444
• CASCADE: A tool kernel supporting a comprehensive design method for asynchronous controllers
  Jochen Beister, Gernot Eckstein, Ralf Wollowski
  Lecture Notes in Computer Science 1825, 2000, pp. 445-454