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

• Modeling concurrent systems: Actors, nets, and the problem of abstraction and composition
  Gul A. Agha
  Lecture Notes in Computer Science 1091, 1996, pp. 1-10
• Temporal uncertainty and fuzzy-timing high-level Petri nets
  Tadao Murata
  Lecture Notes in Computer Science 1091, 1996, pp. 11-28
• Compositionality in state space verification methods
  Antti Valmari
  Lecture Notes in Computer Science 1091, 1996, pp. 29-56
• On liveness and controlled siphons in Petri nets
  Kamel Barkaoui, Jean-François Pradat-Peyre
  Lecture Notes in Computer Science 1091, 1996, pp. 57-72
• Behavioural and structural composition rules preserving liveness by synchronization for colored FIFO nets
  Mohamed-Lyes Benalycherif, Claude Girault
  Lecture Notes in Computer Science 1091, 1996, pp. 73-92
• High level synthesis of synchronous parallel controllers
  Krzysztof Biliński, Erik L. Dagless
  Lecture Notes in Computer Science 1091, 1996, pp. 93-112
• Non sequential semantics for contextual P/T nets
  Nadia Busi, G. Michele Pinna
  Lecture Notes in Computer Science 1091, 1996, pp. 113-132
• The PSR methodology: Integrating hardware and software models
  Susanna Donatelli, Giuliana Franceschinis
  Lecture Notes in Computer Science 1091, 1996, pp. 133-152
• Designing and verifying a communications gateway using colored Petri nets and Design/CPN
  D.J. Floreani, J. Billington, A. Dadej
  Lecture Notes in Computer Science 1091, 1996, pp. 153-171
• Expected impulse rewards in Markov regenerative stochastic Petri nets
  Reinhard German, Aad P.A. van Moorsel, Muhammad A. Qureshi, William H. Sanders
  Lecture Notes in Computer Science 1091, 1996, pp. 172-191
• Asynchronous composition of high level Petri nets: A quantitative approach
  Serge Haddad, Patrice Moreaux
  Lecture Notes in Computer Science 1091, 1996, pp. 192-211
• A formal definition of hierarchical predicate transition nets
  Xudong He
  Lecture Notes in Computer Science 1091, 1996, pp. 212-229
• Reduced state space representation for unbounded vector state spaces
  Kunihiko Hiraishi
  Lecture Notes in Computer Science 1091, 1996, pp. 230-248
• Modelling and analysis of distributed program execution in BETA using colored Petri nets
  Jens Bæk Jrgensen, Kjeld Hyer Mortensen
  Lecture Notes in Computer Science 1091, 1996, pp. 249-268
• Reachability analysis based on structured representations
  Peter Kemper
  Lecture Notes in Computer Science 1091, 1996, pp. 269-288
• Arc-typed Petri nets
  Ekkart Kindler, Rolf Walter
  Lecture Notes in Computer Science 1091, 1996, pp. 289-306
• The SEA language for System Engineering and Animation
  B. Kleinjohann, E. Kleinjohann, J. Tacken
  Lecture Notes in Computer Science 1091, 1996, pp. 307-326
• A new iterative numerical solution algorithm for a class of stochastic Petri nets
  Werner Knaup
  Lecture Notes in Computer Science 1091, 1996, pp. 327-345
• A structural approach for the analysis of Petri nets by reduced unfoldings
  Alex Kondratyev, Michael Kishinevsky, Alexander Taubin, Sergei Ten
  Lecture Notes in Computer Science 1091, 1996, pp. 346-365
• An O(|S| x |T|)-algorithm to verify if a net is regular
  Andrei Kovalyov
  Lecture Notes in Computer Science 1091, 1996, pp. 366-379
• The consistent use of names and polymorphism in the definition of object Petri nets
  Charles Lakos
  Lecture Notes in Computer Science 1091, 1996, pp. 380-399
• Designing a security system by means of coloured Petri nets
  Jens Linneberg Rasmussen, Mejahr Singh
  Lecture Notes in Computer Science 1091, 1996, pp. 400-419
• Modeling and analysing DART systems through high-level Petri nets
  Libero Nigro, Francesco Pupo
  Lecture Notes in Computer Science 1091, 1996, pp. 420-439
• {SC}*ECS: A class of modular and hierarchical cooperating systems
  Laura Recalde, Enrique Teruel, Manuel Silva
  Lecture Notes in Computer Science 1091, 1996, pp. 440-459
• Behavioural equivalence for infinite systems - Partially decidable!
  Kim Sunesen, Mogens Nielsen
  Lecture Notes in Computer Science 1091, 1996, pp. 460-479