Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=5556

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

A survey of stochastic games with limsup and liminf objectives
Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
Lecture Notes in Computer Science 5556, 2009, pp. 1-15
Tractable optimization problems through hypergraph-based structural restrictions
Georg Gottlob, Gianluigi Greco, Francesco Scarcello
Lecture Notes in Computer Science 5556, 2009, pp. 16-30
Deciding safety properties in infinite-state pi-calculus via behavioural types
Lucia Acciai, Michele Boreale
Lecture Notes in Computer Science 5556, 2009, pp. 31-42
When are timed automata determinizable?
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye
Lecture Notes in Computer Science 5556, 2009, pp. 43-54
Faithful loops for aperiodic E-ordered monoids
Martin Beaudry, François Lemieux
Lecture Notes in Computer Science 5556, 2009, pp. 55-66
Boundedness of monadic second-order formulae over finite words
Achim Blumensath, Martin Otto, Mark Weyer
Lecture Notes in Computer Science 5556, 2009, pp. 67-78
Semilinear program feasibility
Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
Lecture Notes in Computer Science 5556, 2009, pp. 79-90
Floats and ropes: A case study for formal numerical program verification
Sylvie Boldo
Lecture Notes in Computer Science 5556, 2009, pp. 91-102
Reachability in stochastic timed games
Patricia Bouyer, Vojtȇch Forejt
Lecture Notes in Computer Science 5556, 2009, pp. 103-114
Equations defining the polynomial closure of a lattice of regular languages
Mário J.J. Branco, Jean-Éric Pin
Lecture Notes in Computer Science 5556, 2009, pp. 115-126
Approximating Markov processes by averaging
Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon Plotkin
Lecture Notes in Computer Science 5556, 2009, pp. 127-138
The theory of stabilisation monoids and regular cost functions
Thomas Colcombet
Lecture Notes in Computer Science 5556, 2009, pp. 139-150
A tight lower bound for determinization of transition labeled Büchi automata
Thomas Colcombet, Konrad Zdanowski
Lecture Notes in Computer Science 5556, 2009, pp. 151-162
On constructor rewrite systems and the lambda-calculus
Ugo Dal Lago, Simone Martini
Lecture Notes in Computer Science 5556, 2009, pp. 163-174
On regular temporal logics with past
Christian Dax, Felix Klaedtke, Martin Lange
Lecture Notes in Computer Science 5556, 2009, pp. 175-187
Forward analysis for WSTS, Part II: Complete WSTS
Alain Finkel, Jean Goubault-Larrecq
Lecture Notes in Computer Science 5556, 2009, pp. 188-199
Qualitative concurrent stochastic games with imperfect information
Vincent Gripon, Olivier Serre
Lecture Notes in Computer Science 5556, 2009, pp. 200-211
Diagrammatic confluence and completion
Jean-Pierre Jouannaud, Vincent van Oostrom
Lecture Notes in Computer Science 5556, 2009, pp. 212-222
Complexity of model checking recursion schemes for fragments of the modal mu-calculus
Naoki Kobayashi, C.-H. Luke Ong
Lecture Notes in Computer Science 5556, 2009, pp. 223-234
LTL path checking is efficiently parallelizable
Lars Kuhtz, Bernd Finkbeiner
Lecture Notes in Computer Science 5556, 2009, pp. 235-246
An explicit formula for the free exponential modality of linear logic
Paul-André Melli`es, Nicolas Tabareau, Christine Tasson
Lecture Notes in Computer Science 5556, 2009, pp. 247-260
Decidability of the guarded fragment with the transitive closure
Jakub Michaliszyn
Lecture Notes in Computer Science 5556, 2009, pp. 261-272
Weak alternating timed automata
Pawel Parys, Igor Walukiewicz
Lecture Notes in Computer Science 5556, 2009, pp. 273-284
A decidable characterization of locally testable tree languages
Thomas Place, Luc Segoufin
Lecture Notes in Computer Science 5556, 2009, pp. 285-296
The complexity of Nash equilibria in simple stochastic multiplayer games
Michael Ummels, Dominik Wojtczak
Lecture Notes in Computer Science 5556, 2009, pp. 297-308

Seiten 1 2 >