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 [1]	Hilfe

Suche: Series=LNCS AND Volume=962

• Local model checking games
  Colin Stirling
  Lecture Notes in Computer Science 962, 1995, pp. 1-11
• Compositional proof systems for model checking infinite state processes
  Mads Dam
  Lecture Notes in Computer Science 962, 1995, pp. 12-26
• Compositional model checking of real time systems
  François Laroussinie, Kim G. Larsen
  Lecture Notes in Computer Science 962, 1995, pp. 27-41
• Checking bisimilarity for finitary \pi-calculus
  Ugo Montanari, Marco Pistore
  Lecture Notes in Computer Science 962, 1995, pp. 42-56
• The weak late \pi-calculus semantics as observation equivalence
  Gian-Luigi Ferrari, Ugo Montanari, Paola Quaglia
  Lecture Notes in Computer Science 962, 1995, pp. 57-71
• The fixpoint-analysis machine
  Bernhard Steffen, Andreas Class̈en, Marion Klein, Jens Knoop, Tiziana Margaria
  Lecture Notes in Computer Science 962, 1995, pp. 72-87
• Unique fixpoint induction for mobile processes
  H. Lin
  Lecture Notes in Computer Science 962, 1995, pp. 88-102
• A polymorphic type system for the polyadic \pi-calculus
  Xinxin Liu, David Walker
  Lecture Notes in Computer Science 962, 1995, pp. 103-116
• Fibrational control structures
  Claudio Hermida, John Power
  Lecture Notes in Computer Science 962, 1995, pp. 117-129
• Fully abstract models for nondeterministic regular expressions
  Flavio Corradini, Rocco De Nicola, Anna Labella
  Lecture Notes in Computer Science 962, 1995, pp. 130-144
• A Petri net semantics for \pi-calculus
  Nadia Busi, Roberto Gorrieri
  Lecture Notes in Computer Science 962, 1995, pp. 145-159
• A complete theory of deterministic event structures
  Arend Rensink
  Lecture Notes in Computer Science 962, 1995, pp. 160-174
• Characterising behavioural congruences for Petri nets
  Mogens Nielsen, Lutz Priese, Vladimiro Sassone
  Lecture Notes in Computer Science 962, 1995, pp. 175-189
• Verification of a distributed summation algorithm
  Frits Vaandrager
  Lecture Notes in Computer Science 962, 1995, pp. 190-203
• Confluence for process verification
  J.F. Groote, M.P.A. Sellink
  Lecture Notes in Computer Science 962, 1995, pp. 204-218
• Axiomatisations of weak equivalences for De Simone languages
  Irek Ulidowski
  Lecture Notes in Computer Science 962, 1995, pp. 219-233
• A compositional trace-based semantics for probabilistic automata
  Roberto Segala
  Lecture Notes in Computer Science 962, 1995, pp. 234-248
• Acceptance trees for probabilistic processes
  Manuel Núñez, David de Frutos, Luis Llana
  Lecture Notes in Computer Science 962, 1995, pp. 249-263
• Will I be pretty, will I be rich? Some thoughts on theory vs. practice in systems engineering
  David Harel
  Lecture Notes in Computer Science 962, 1995, pp. 264-268
• Towards a denotational semantics for ET-LOTOS
  Jeremy Bryans, Jim Davies, Steve Schneider
  Lecture Notes in Computer Science 962, 1995, pp. 269-283
• Reachability analysis at procedure level through timing coincidence
  Farn Wang
  Lecture Notes in Computer Science 962, 1995, pp. 284-298
• Faster asynchronous systems
  Walter Vogler
  Lecture Notes in Computer Science 962, 1995, pp. 299-312
• Fair testing
  Ed Brinksma, Arend Rensink, Walter Vogler
  Lecture Notes in Computer Science 962, 1995, pp. 313-327
• Formal methods technology transfer: Impediments and innovation
  Dan Craigen
  Lecture Notes in Computer Science 962, 1995, pp. 328-332
• Decidability of simulation and bisimulation between lossy channel systems and finite state systems
  Parosh Aziz Abdulla, Mats Kindahl
  Lecture Notes in Computer Science 962, 1995, pp. 333-347