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

• Performance issues in parallel programming
  Gianfranco Balbo
  Lecture Notes in Computer Science 616, 1992, pp. 1-23
• Combining Petri nets and other formal methods
  W. Reisig
  Lecture Notes in Computer Science 616, 1992, pp. 24-44
• Place bisimulations in Petri nets
  C. Autant, Ph. Schnoebelen
  Lecture Notes in Computer Science 616, 1992, pp. 45-61
• A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets
  Kamel Barkaoui, Michel Minoux
  Lecture Notes in Computer Science 616, 1992, pp. 62-75
• Refinement and simulation of nets - a categorical characterisation
  Carolyn Brown, Doug Gurr
  Lecture Notes in Computer Science 616, 1992, pp. 76-92
• Scheduling hard real time systems using high-level Petri nets
  Giorgio Bruno, Andrea Castella, Gianpaolo Macario, Marco P. Pescarmona
  Lecture Notes in Computer Science 616, 1992, pp. 93-112
• Towards a modular analysis of coloured Petri nets
  Sren Christensen, Laure Petrucci
  Lecture Notes in Computer Science 616, 1992, pp. 113-133
• A proof of the rank theorem for extended free choice nets
  Jörg Desel
  Lecture Notes in Computer Science 616, 1992, pp. 134-153
• On the product form solution for stochastic Petri nets
  Susanna Donatelli, Matteo Sereno
  Lecture Notes in Computer Science 616, 1992, pp. 154-172
• Obtaining deadlock-preserving skeletons for coloured nets
  Greg Findlow
  Lecture Notes in Computer Science 616, 1992, pp. 173-192
• P-superfairness in nets
  Hans Fleischhack
  Lecture Notes in Computer Science 616, 1992, pp. 193-204
• Formal verification of an arbiter cascade
  Hartmann J. Genrich, Robert M. Shapiro
  Lecture Notes in Computer Science 616, 1992, pp. 205-223
• Constructs for modeling information systems with Petri nets
  Carlos A. Heuser, Gernot Richter
  Lecture Notes in Computer Science 616, 1992, pp. 224-243
• Construction of a class of safe Petri nets by presenting firing sequences
  Kunihiko Hiraishi
  Lecture Notes in Computer Science 616, 1992, pp. 244-262
• An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets
  Peter Kemper, Falko Bause
  Lecture Notes in Computer Science 616, 1992, pp. 263-278
• Hierarchical solution of generalized stochastic Petri nets by means of traffic processes
  Guenter Klas
  Lecture Notes in Computer Science 616, 1992, pp. 279-298
• Concurrency relations and the safety problem for Petri nets
  A.V. Kovalyov
  Lecture Notes in Computer Science 616, 1992, pp. 299-309
• High-level nets and linear logic
  Johan Lilius
  Lecture Notes in Computer Science 616, 1992, pp. 310-327
• Liveness and boundedness analysis for Petri nets with event graph modules
  Vanio M. Savi, Xiaolan Xie
  Lecture Notes in Computer Science 616, 1992, pp. 328-347
• On weighted T-systems
  E. Teruel, P. Chrza̧stowski-Wachtel, J.M. Colom, M. Silva
  Lecture Notes in Computer Science 616, 1992, pp. 348-367
• Using Petri nets to develop programs for PLC systems
  Geoff Cutts, Shaun Rattigan
  Lecture Notes in Computer Science 616, 1992, pp. 368-372
• Modelling and control of complex logistic systems for manufacturing
  K. Lemmer, E. Schnieder
  Lecture Notes in Computer Science 616, 1992, pp. 373-378
• Modelling and evaluation of a satellite system using EVAL, a Petri net based industrial tool
  J.C. Lloret, J.L. Roux, B. Algayres, M. Chamontin
  Lecture Notes in Computer Science 616, 1992, pp. 379-383
• Analysis of an ADA system using coloured Petri nets and occurence graphs
  William W., Jr. McLendon, Richard F. Vidale
  Lecture Notes in Computer Science 616, 1992, pp. 384-388
• The stubborn set method in practice
  Kimmo Varpaaniemi, Marko Rauhamaa
  Lecture Notes in Computer Science 616, 1992, pp. 389-393