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 YEAR=1992

• Dynamic closest pairs - A probabilistic approach
  Mordecai J. Golin
  Lecture Notes in Computer Science 621, 1992, pp. 340-351
• Decomposing the boundary of a nonconvex polyhedron
  Bernard Chazelle, Leonidas Palios
  Lecture Notes in Computer Science 621, 1992, pp. 364-375
• Convex polygons made from few lines and convex decompositions of polyhedra
  John Hershberger, Jack Snoeyink
  Lecture Notes in Computer Science 621, 1992, pp. 376-387
• Voronoi diagrams of moving points in higher dimensional spaces
  Gerhard Albers, Thomas Roos
  Lecture Notes in Computer Science 621, 1992, pp. 399-409
• Performance issues in parallel programming
  Gianfranco Balbo
  Lecture Notes in Computer Science 616, 1992, pp. 1-23
• 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
• Using Petri nets to develop programs for PLC systems
  Geoff Cutts, Shaun Rattigan
  Lecture Notes in Computer Science 616, 1992, pp. 368-372
• Esprit basic research action 3148 DEMON (Design Methods Based on Nets) - aims, scope and achievements
  Eike Best
  Lecture Notes in Computer Science 609, 1992, pp. 1-20
• The box calculus: a new causal algebra with multi-label communication
  Eike Best, Raymond Devillers, Jon G. Hall
  Lecture Notes in Computer Science 609, 1992, pp. 21-69
• Modular functional modelling of Petri nets with individual tokens
  Manfred Broy, Thomas Streicher
  Lecture Notes in Computer Science 609, 1992, pp. 70-88
• Interleaving semantics and action refinement with atomic choice
  Ingo Czaja, Rob J. van Glabbeek, Ursula Goltz
  Lecture Notes in Computer Science 609, 1992, pp. 89-107
• Maximality preservation and the ST-idea for action refinements
  Raymond Devillers
  Lecture Notes in Computer Science 609, 1992, pp. 108-151
• A fifo-net model for processes with asynchronous communication
  J. Fanchon
  Lecture Notes in Computer Science 609, 1992, pp. 152-178
• A basic-net algebra for program semantics and its application to OCCAM
  Richard Hopkins, Jon Hall, Oliver Botti
  Lecture Notes in Computer Science 609, 1992, pp. 179-214