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

• Modeling and enactment of workflow systems
  Clarence A. Ellis, Gary J. Nutt
  Lecture Notes in Computer Science 691, 1993, pp. 1-16
• Interleaving functional and performance structural analysis of net models
  Manuel Silva
  Lecture Notes in Computer Science 691, 1993, pp. 17-23
• FSPNs: Fluid stochastic Petri nets
  Kishor S. Trivedi, Vidyadhar G. Kulkarni
  Lecture Notes in Computer Science 691, 1993, pp. 24-31
• Taking advantages of temporal redundancy in high level Petri nets implementations
  J.A. Bañares, P.R. Muro-Medrano, J.L. Villarroel
  Lecture Notes in Computer Science 691, 1993, pp. 32-48
• A subset of Lotos with the computational power of place/transition-nets
  Michel Barbeau, Gregor von Bochmann
  Lecture Notes in Computer Science 691, 1993, pp. 49-68
• An efficient algorithm for finding structural deadlocks in colored Petri nets
  K. Barkaoui, C. Dutheillet, S. Haddad
  Lecture Notes in Computer Science 691, 1993, pp. 69-88
• Synthesis of net systems
  Luca Bernardinello
  Lecture Notes in Computer Science 691, 1993, pp. 89-105
• Hierarchies in colored GSPNs
  Peter Buchholz
  Lecture Notes in Computer Science 691, 1993, pp. 106-125
• Variable reasoning and analysis about uncertainty with fuzzy Petri nets
  Tiehua Cao, Arthur C. Sanderson
  Lecture Notes in Computer Science 691, 1993, pp. 126-145
• Distributed simulation of timed Petri nets: Exploiting the net structure to obtain efficiency
  Giovanni Chiola, Alois Ferscha
  Lecture Notes in Computer Science 691, 1993, pp. 146-165
• Transient analysis of deterministic and stochastic Petri nets
  Hoon Choi, Vidyadhar G. Kulkarni, Kishor S. Trivedi
  Lecture Notes in Computer Science 691, 1993, pp. 166-185
• Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs
  Sren Christensen, Niels Damgaard Hansen
  Lecture Notes in Computer Science 691, 1993, pp. 186-205
• Integrating software engineering methods and Petri nets for the specification and prototyping of complex information systems
  Yi Deng, S.K. Chang, Jorge C.A. de Figueired, Angelo Perkusich
  Lecture Notes in Computer Science 691, 1993, pp. 206-223
• Shortest paths in reachability graphs
  Jörg Desel, Javier Esparza
  Lecture Notes in Computer Science 691, 1993, pp. 224-241
• Construction of S-invariants and S-components for refined Petri boxes
  Raymond Devillers
  Lecture Notes in Computer Science 691, 1993, pp. 242-261
• Compositional liveness properties of EN-systems
  D. Gomm, E. Kindler, B. Paech, R. Walter
  Lecture Notes in Computer Science 691, 1993, pp. 262-281
• Analysis of place/transition nets with timed arcs and its application to batch process control
  Hans-Michael Hanisch
  Lecture Notes in Computer Science 691, 1993, pp. 282-299
• On well-formed nets and optimizations in enabling tests
  Jean-Michel Ilié, Omar Rojas
  Lecture Notes in Computer Science 691, 1993, pp. 300-318
• Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net
  Peter Kemper
  Lecture Notes in Computer Science 691, 1993, pp. 319-338
• Exploiting T-invariant analysis in diagnostic reasoning on a Petri net model
  Luigi Portinale
  Lecture Notes in Computer Science 691, 1993, pp. 339-356
• Marking optimization of stochastic timed event graphs
  Nathalie Sauer, Xiaolan Xie
  Lecture Notes in Computer Science 691, 1993, pp. 357-376
• A client-server protocol for the composition of Petri nets
  C. Sibertin-Blanc
  Lecture Notes in Computer Science 691, 1993, pp. 377-396
• Analysis of dynamic load balancing strategies using a combination of stochastic Petri nets and queueing networks
  C.R.M. Sundaram, Y. Narahari
  Lecture Notes in Computer Science 691, 1993, pp. 397-414
• Liveness and home states in equal conflict systems
  Enrique Teruel, Manuel Silva
  Lecture Notes in Computer Science 691, 1993, pp. 415-432
• Bridging the gap between place- and Floyd-invariants with applications to preemptive scheduling
  Rüdiger Valk
  Lecture Notes in Computer Science 691, 1993, pp. 433-452