2009 | |
---|---|
[BDL+09] | Thomas Brihaye, Arnaud Da Costa, François Laroussinie, and Nicolas Markey. ATL with Strategy Contexts and Bounded Memory. In LFCS'09, Lecture Notes in Computer Science 5407, pages 92-106. Springer-Verlag, January 2009. |
[BDM+09] | Patricia Bouyer, Marie Duflot, Nicolas Markey, and Gabriel Renault. Measuring Permissivity in Finite Games. In CONCUR'09, Lecture Notes in Computer Science 5710, pages 196-210. Springer-Verlag, September 2009. |
[CM09] | Franck Cassez and
Nicolas Markey.
Control of Timed Systems.
In Claude Jard and
Olivier H. Roux (eds.),
Communicating Embedded Systems – Software and
Design.
Wiley-ISTE, October 2009.
|
[AB09] | Sanjeev Arora and Boaz Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2009. |
[AD09] | Timos Antonopoulos and
Anuj Dawar.
Separating Graph Logic from MSO.
In FoSSaCS'09,
Lecture Notes in Computer Science 5504, pages 63-77. Springer-Verlag, March 2009.
|
[ADM+09] | Rajeev Alur, Aldric Degorre, Oded Maler, and Gera Weiss. On Omega-Languages Defined by Mean-Payoff Conditions. In FoSSaCS'09, Lecture Notes in Computer Science 5504. Springer-Verlag, March 2009. |
[BBB+09] | Christel Baier, Nathalie Bertrand, Patricia Bouyer, and Thomas Brihaye. When are timed automata determinizable?. In ICALP'09, Lecture Notes in Computer Science 5556, pages 43-54. Springer-Verlag, July 2009. |
[BDS+09] | Hans Bherer, Jules Desharnais, and Richard St-Denis. Control of Parameterized Discrete Event Systems. Discrete Event Dynamic Systems 19(2):213-165. Kluwer Academic, June 2009. |
[BF09] | Patricia Bouyer and
Vojtěch Forejt.
Reachability in Stochastic Timed Games.
In ICALP'09,
Lecture Notes in Computer Science 5556, pages 103-114. Springer-Verlag, July 2009.
|
[BFH09] | Felix Brandt, Felix Fischer, and Markus Holzer. Symmetries and the complexity of pure Nash equilibrium. Journal of Computer and System Sciences 75(3):163-177. Elsevier, May 2009. |
[BGH+09] | Roderick Bloem,
Karin Greimel,
Thomas A. Henzinger, and
Barbara Jobstmann.
Synthesizing robust systems.
In FMCAD'09,
pages 85-92.
IEEE Comp. Soc. Press, November 2009.
|
[Bhe09] | Hans Bherer. Controller Synthesis for Parameterized Discrete Event Systems. PhD thesis, Université Laval, Québec, Canada, 2009. |
[BHR09] | Patricia Bouyer, Serge Haddad, and Pierre-Alain Reynier. Undecidability Results for Timed Automata with Silent Transitions. Fundamenta Informaticae 92(1-2):1-25. IOS Press, 2009. |
[BJS09] | Joakim Byg, Kenneth Yrke Jørgensen, and Jiří Srba. TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets. In ATVA'09, Lecture Notes in Computer Science 5799, pages 84-89. Springer-Verlag, October 2009. |
[BM09] | Costas Busch and Malik Magdon-Ismail. Atomic routing games on maximum congestion. Theoretical Computer Science 410(36):3337-3347. Elsevier, August 2009. |
[Cas09] | Franck Cassez. A note on fault diagnosis algorithms. In CDC'09, pages 6941-6946. IEEE Comp. Soc. Press, December 2009. |
[CES09] | Edmund M. Clarke, E. Allen Emerson, and Joseph Sifakis. Model checking: algorithmic verification and debugging. Communications of the ACM 52(11):74-84. ACM Press, November 2009. |
[Cha09] | Patryk Chamuczyński.
Algorithms and data structures for parametric
analysis of real time systems.
Thèse de doctorat,
University of Göttingen, Germany,
2009.
|
[CJL+09] | Franck Cassez, Jan J. Jensen, Kim Guldstrand Larsen, Jean-François Raskin, and Pierre-Alain Reynier. Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study. In HSCC'09, Lecture Notes in Computer Science 5469, pages 90-104. Springer-Verlag, April 2009. |
[DG09] | Stéphane Demri and Régis Gascon. The Effects of Bounding Syntactic Resources on Presburger LTL. Journal of Logic and Computation 19(6):1541-1575. Oxford University Press, December 2009. |
[DGP09] | Constantinos Daskalakis,
Paul W. Goldberg, and
Christos H. Papadimitriou.
The complexity of computing a Nash equilibrium.
SIAM Journal on Computing 39(1):195-259. Society for Industrial and Applied Math., 2009.
|
[DGR09] | Laurent Doyen,
Raffaella Gentilini, and
Jean-François Raskin.
Faster Pseudo-Polynomial Algorithms for Mean-Payoff
Games.
Technical Report 2009-121, CFV, 2009.
|
[DGR+09] | Laurent Doyen,
Gilles Geeraerts,
Jean-François Raskin, and
Julien Reichert.
Realizability of Real-Time Logics.
In FORMATS'09,
Lecture Notes in Computer Science 5813, pages 133-148. Springer-Verlag, September 2009.
|
[DKL09] | Christian Dax, Felix Klaedtke, and Martin Lange. On Regular Temporal Logics with Past. In ICALP'09, Lecture Notes in Computer Science 5556, pages 175-187. Springer-Verlag, July 2009. |
[DKV09] | Manfred Droste,
Werner Kuich, and
Walter Vogler.
Handbook of Weighted Automata.
Springer-Verlag, 2009.
|
[DLR+09] | Alexandre David, Kim Guldstrand Larsen, Jacob Illum Rasmussen, and Arne Skou. Model-based framework for schedulability analysis using UPPAAL 4.1. In Gabriela Nicolescu and Pieter J. Mosterman (eds.), Model-Based Design for Embedded Systems, Computational Analysis, Synthesis, and Design of Dynamic Systems, pages 93-119. CRC Press, 2009. |
[ER09] | Andrzej Ehrenfeucht and Grzegorz Rozenberg. Introducing Time in Reaction Systems. Theoretical Computer Science 410(4-5). Elsevier, February 2009. |
[FJR09] | Emmanuel Filiot,
Naiyong Jin, and
Jean-François Raskin.
An Antichain Algorithm for LTL Realizability.
In CAV'09,
Lecture Notes in Computer Science 5643, pages 263-277. Springer-Verlag, June 2009.
|
[FKK+09] | Dimitris Fotakis, Spyros Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, and Paul G. Spirakis. The structure and complexity of Nash equilibria for a selfish routing game. Theoretical Computer Science 410(36):3305-3326. Elsevier, August 2009. |
[FL09] | Oliver Friedmann and Martin Lange. Solving Parity Games in Practice. In ATVA'09, Lecture Notes in Computer Science 5799, pages 182-196. Springer-Verlag, October 2009. |
[FL09] | Uli Fahrenberg and
Kim Guldstrand Larsen.
Discount-optimal infinite Runs in Proced Timed
Automata.
In INFINITY'06-08,
Electronic Notes in Theoretical Computer Science 239, pages 179-191. Elsevier, July 2009.
|
[FLT09] | Uli Fahrenberg,
Kim Guldstrand Larsen, and
Claus Thrane.
A Quantitative Characterization of Weighted Kripke
Structures in Temporal Logics.
In MEMICS'09,
OpenAccess Series in Informatics 13.
Leibniz-Zentrum für Informatik, September 2009.
|
[For09] | Lance Fortnow.
The Status of the P versus NP Problem.
Communications of the ACM 52(9):78-86. ACM Press, September 2009.
|
[GL09] | Sahika Genc and Stéphane Lafortune. Predictability of event occurrences in partially-observed discrete-event systems. Automatica 45(2):301-311. Elsevier, February 2009. |
[GS09] | Thomas Gawlitza and Helmut Seidl. Games through Nested Fixpoints. In CAV'09, Lecture Notes in Computer Science 5643, pages 291-305. Springer-Verlag, June 2009. |
[GSZ09] | Paul Gastin,
Tali Sznajder, and
Marc Zeitoun.
Distributed synthesis for well-connected
architectures.
Formal Methods in System Design 34(3):215-237. Springer-Verlag, June 2009.
|
[HKO+09] | Christoph Haase, Stephan Kreutzer, Joël Ouaknine, and James Worrell. Reachability in Succinct and Parametric One-Counter Automata. In CONCUR'09, Lecture Notes in Computer Science 5710, pages 369-383. Springer-Verlag, September 2009. |
[JdB+09] | Mohammad Mahdi Jaghoori,
Frank S. de Boer,
Tom Chothia, and
Marjan Sirjani.
Schedulability of asynchronous real-time concurrent
objects.
Journal of Logic and Algebraic Programming 78(5):402-416. Elsevier, May 2009.
|
[KF09] | Lars Kuhtz and
Bernd Finkbeiner.
LTL Path Checking is Efficiently Parallelizable.
In ICALP'09,
Lecture Notes in Computer Science 5556, pages 235-246. Springer-Verlag, July 2009.
|
[KFS+09] | Jeroen Kuipers,
Janos Flesch,
Gijs Schoenmakers, and
Koos Vrieze.
Pure subgame-perfect equilibria in free transition
games.
European Journal of Operational Research 199(2):442-447. Elsevier, December 2009.
|
[KP09] | Elias Koutsoupias and Christos H. Papadimitriou. Worst-case equilibria. Computer Science Review 3(2):65-69. May 2009. |
[KRT09] | Dominik Klein,
Frank G. Radmacher, and
Wolfgang Thomas.
The Complexity of Reachability in Randomized
Sabotage Games.
In FSEN'09,
Lecture Notes in Computer Science 5961, pages 162-177. Springer-Verlag, April 2009.
|
[KT09] | Moez Krichen and Stavros Tripakis. Conformance testing for real-time systems. Formal Methods in System Design 34(3):238-304. Springer-Verlag, June 2009. |
[LPT09] | Kai Lampka, Simon Perathoner, and Lothar Thiele. Analytic Real-time Analysis and Timed Automata: A Hybrid Method for Analyzing Embedded Real-time Systems. In EMSOFT'09, pages 107-116. ACM Press, October 2009. |
[LS09] | Martin Leucker and Christian Schallart. A brief account of runtime verification. Journal of Logic and Algebraic Programming 78(5):293-303. Elsevier, May 2009. |
[ORW09] | Joël Ouaknine,
Alexander Rabinovich, and
James Worrell.
Time-Bounded Verification.
In CONCUR'09,
Lecture Notes in Computer Science 5710, pages 496-510. Springer-Verlag, September 2009.
|
[PPT09] | Michal Penn, Maria Polukarov, and Moshe Tennenholtz. Random Order Congestion Games. Mathematics of Operations Research 34(3):706-725. Informs, August 2009. |
[Rah09] | George Rahonis. Fuzzy Languages. In Manfred Droste, Werner Kuich, and Walter Vogler (eds.), Handbook of Weighted Automata. Springer-Verlag, 2009. |
[SLB09] | Yoav Shoham and Kevin Leyton-Brown. Multiagent Systems – Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press, 2009. |
[SRS09] | Anu Singh, C. R. Ramakrishnan, and Scott A. Smolka. Query-Based Model Checking of Ad Hoc Network Protocols. In CONCUR'09, Lecture Notes in Computer Science 5710, pages 603-619. Springer-Verlag, September 2009. |
[SZH+09] | Mathijs Schuts,
Yunshan Zhu,
Faranak Heidarian, and
Frits Vaandrager.
Modelling Clock Synchronization in the Chess gMAC
WSN Protocol.
In QFM'09,
Electronic Proceedings in Theoretical Computer
Science 13, pages 41-54. November 2009.
|
[TD09] | Cong Tian and
Zhenhua Duan.
A Note on Stutter-Invariant PLTL.
Information Processing Letters 109(13):663-667. Elsevier, June 2009.
|
[Tri09] | Stavros Tripakis. Checking Timed Büchi Automata Emptiness on Simulation Graphs. ACM Transactions on Computational Logic 10(3). ACM Press, April 2009. |
[UW09] | Michael Ummels and
Dominik Wojtczak.
Decision Problems for Nash Equilibria in
Stochastic Games.
In CSL'09,
Lecture Notes in Computer Science 5771, pages 51-530. Springer-Verlag, September 2009.
|
[UW09] | Michael Ummels and
Dominik Wojtczak.
The Complexity of Nash Equilibria in Simple
Stochastic Multiplayer Games.
In ICALP'09,
Lecture Notes in Computer Science 5556, pages 297-308. Springer-Verlag, July 2009.
|
[Web09] | Michael Weber.
On the Complexity of Branching-Time Logics.
In CSL'09,
Lecture Notes in Computer Science 5771, pages 530-545. Springer-Verlag, September 2009.
|
Search
Displayed 56 resultsList of authors
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 4
- 1
- 2
- 1
- 1
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 4
- 1
- 1
- 1
- 1
- 3
- 1
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1