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

• Checking regular properties of Petri nets
  Petr Janc̑ar, Faron Moller
  Lecture Notes in Computer Science 962, 1995, pp. 348-362
• Metric predicate transformers: Towards a notion of refinement for concurrency
  Marcello M. Bonsangue, Joost N. Kok, Erik de Vink
  Lecture Notes in Computer Science 962, 1995, pp. 363-377
• A refinement theory that supports both "Decrease of Nondeterminism" and "Increase of Parallelism"
  M. Siegel
  Lecture Notes in Computer Science 962, 1995, pp. 378-392
• Model checking and efficient automation of temporal reasoning
  E. Allen Emerson
  Lecture Notes in Computer Science 962, 1995, pp. 393-394
• Verifying parameterized networks using abstraction and regular languages
  E.M. Clarke, O. Grumberg, S. Jha
  Lecture Notes in Computer Science 962, 1995, pp. 395-407
• On the complexity of branching modular model checking
  Orna Kupferman, M.Y. Vardi
  Lecture Notes in Computer Science 962, 1995, pp. 408-422
• Axiomatising linear time Mu-calculus
  Roope Kaivola
  Lecture Notes in Computer Science 962, 1995, pp. 423-437
• A trace consistent subset of PTL
  P.S. Thiagarajan
  Lecture Notes in Computer Science 962, 1995, pp. 438-452
• Proving properties of concurrent systems with SPIN
  G.J. Holzmann
  Lecture Notes in Computer Science 962, 1995, pp. 453-455
• On sharing and determinacy in concurrent systems
  Anna Philippou, David Walker
  Lecture Notes in Computer Science 962, 1995, pp. 456-470
• Process semantics of graph reduction
  Simon Brock, Gerald Ostheimer
  Lecture Notes in Computer Science 962, 1995, pp. 471-485
• Bisimulations for a calculus of broadcasting systems
  M. Hennessy, J. Rathke
  Lecture Notes in Computer Science 962, 1995, pp. 486-500
• Delayed choice for process algebra with abstraction
  P.R. D'Argenio, S. Mauw
  Lecture Notes in Computer Science 962, 1995, pp. 501-515
• CTR: A calculus of timed refinement
  Kārlis C̑erāns
  Lecture Notes in Computer Science 962, 1995, pp. 516-530
• Temporal logic + timed automata: Expressiveness and decidability
  Ahmed Bouajjani, Yassine Lakhnech
  Lecture Notes in Computer Science 962, 1995, pp. 531-545