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

• Robustness in timed automata
  Patricia Bouyer, Nicolas Markey, Ocan Sankur
  Lecture Notes in Computer Science 8169, 2013, pp. 1-18
• Automated verification of concurrent software
  Daniel Kroening
  Lecture Notes in Computer Science 8169, 2013, pp. 19-20
• Provenance verification
  Rupak Majumdar, Roland Meyer, Zilong Wang
  Lecture Notes in Computer Science 8169, 2013, pp. 21-22
• Reachability modulo theories
  Akash Lal, Shaz Qadeer
  Lecture Notes in Computer Science 8169, 2013, pp. 23-44
• The dynamic complexity of the reachability problem on graphs
  Thomas Schwentick
  Lecture Notes in Computer Science 8169, 2013, pp. 45-45
• Reachability problems for hierarchical piecewise constant derivative systems
  Paul C. Bell, Shang Chen
  Lecture Notes in Computer Science 8169, 2013, pp. 46-58
• Parametric interrupt timed automata
  Beatrice Bérard, Serge Haddad, Aleksandra Jovanović, Didier Lime
  Lecture Notes in Computer Science 8169, 2013, pp. 59-69
• Deciding continuous-time metric temporal logic with counting modalities
  Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
  Lecture Notes in Computer Science 8169, 2013, pp. 70-82
• MaRDiGraS: Simplified building of reachability graphs on large clusters
  Carlo Bellettini, Matteo Camilli, Lorenzo Capra, Mattia Monga
  Lecture Notes in Computer Science 8169, 2013, pp. 83-95
• Modular synthesis with open components
  Ilaria De Crescenzo, Salvatore La Torre
  Lecture Notes in Computer Science 8169, 2013, pp. 96-108
• Parameterized verification of broadcast networks of register automata
  Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso
  Lecture Notes in Computer Science 8169, 2013, pp. 109-121
• Monomial strategies for concurrent reachability games and other stochastic games
  Sren Kristoffer Stiil Frederiksen, Peter Bro Miltersen
  Lecture Notes in Computer Science 8169, 2013, pp. 122-134
• Stability controllers for sampled switched systems
  Laurent Fribourg, Romain Soulat
  Lecture Notes in Computer Science 8169, 2013, pp. 135-145
• Formal languages, word problems of groups and decidability
  Sam A.M. Jones, Richard M. Thomas
  Lecture Notes in Computer Science 8169, 2013, pp. 146-158
• Verification of reachability properties for Time Petri Nets
  Kais Klai, Naim Aber, Laure Petrucci
  Lecture Notes in Computer Science 8169, 2013, pp. 159-170
• Branching-time model checking gap-order constraint systems
  Richard Mayr, Patrick Totzke
  Lecture Notes in Computer Science 8169, 2013, pp. 171-182
• Constructing minimal coverability sets
  Artturi Piipponen, Antti Valmari
  Lecture Notes in Computer Science 8169, 2013, pp. 183-195
• On the complexity of counter reachability games
  Julien Reichert
  Lecture Notes in Computer Science 8169, 2013, pp. 196-208
• Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities
  Ernst W. Mayr, Jeremias Weihmann
  Lecture Notes in Computer Science 8169, 2013, pp. 209-221