2008  

[BLM08]  Patricia Bouyer, Kim Guldstrand Larsen, and Nicolas Markey. Model Checking Oneclock Priced Timed Automata. Logical Methods in Computer Science 4(2). May 2008. 
[DDM+08]  Martin De Wulf, Laurent Doyen, Nicolas Markey, and JeanFrançois Raskin. Robust Safety of Timed Automata. Formal Methods in System Design 33(13):4584. SpringerVerlag, December 2008. 
[LMO08]  François Laroussinie, Nicolas Markey, and Ghassan Oreiby. On the Expressiveness and Complexity of ATL. Logical Methods in Computer Science 4(2). May 2008. 
[BBB+08]  Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, and Nicolas Markey. Quantitative ModelChecking of OneClock Timed Automata under Probabilistic Semantics. In QEST'08, pages 5564. IEEE Comp. Soc. Press, September 2008. 
[BFL+08]  Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, and Jiří Srba. Infinite Runs in Weighted Timed Automata with Energy Constraints. In FORMATS'08, Lecture Notes in Computer Science 5215, pages 3347. SpringerVerlag, September 2008. 
[BGM+08]  Thomas Brihaye, Mohamed Ghannem, Nicolas Markey, and Lionel Rieg. Good friends are hard to find!. In TIME'08, pages 3240. IEEE Comp. Soc. Press, June 2008. 
[BMO+08]  Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, and James Worrell. On Termination for Faulty Channel Machines. In STACS'08, Leibniz International Proceedings in Informatics 1, pages 121132. LeibnizZentrum für Informatik, February 2008. 
[BMO+08]  Patricia Bouyer, Nicolas Markey, Joël Ouaknine, and James Worrell. On Expressiveness and Complexity in Realtime Model Checking. In ICALP'08, Lecture Notes in Computer Science 5126, pages 124135. SpringerVerlag, July 2008. 
[BMR08]  Patricia Bouyer, Nicolas Markey, and PierreAlain Reynier. Robust Analysis of Timed Automata via Channel Machines. In FoSSaCS'08, Lecture Notes in Computer Science 4962, pages 157171. SpringerVerlag, March 2008. 
[CM08]  Franck Cassez and
Nicolas Markey.
Contrôle des systèmes temporisés.
In Olivier H. Roux and
Claude Jard (eds.),
Approches formelles des systèmes embarqués
communicants.
Hermès, October 2008.

[ABG+08]  S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, and K. Narayan Kumar. Distributed Timed Automata with Independently Evolving Clocks. In CONCUR'08, Lecture Notes in Computer Science 5201, pages 8297. SpringerVerlag, August 2008. 
[ADK+08]  Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Éva Tardos, Tom Wexler, and Tim Roughgarden. The Price of Stability for Network Design with Fair Cost Allocation. SIAM Journal on Computing 38(4):16021623. Society for Industrial and Applied Math., 2008. 
[AGG08]  Xavier Allamigeon,
Stéphane Gaubert, and
Éric Goubault.
Inferring Min and Max Invariants Using MaxPlus
Polyhedra.
In SAS'08,
Lecture Notes in Computer Science 5079, pages 189204. SpringerVerlag, July 2008.

[AGJ08]  Thomas Ågotnes,
Valentin Goranko, and
Wojciech Jamroga.
Strategic Commitment and Release in Logics for
MultiAgent Systems (Extended abstract).
Technical Report 0801, Clausthal University of Technology, Germany,
2008.

[BBB+08]  Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, and Marcus Größer. Almostsure Model Checking of Infinite Paths in Oneclock Timed Automata. In LICS'08, pages 217226. IEEE Comp. Soc. Press, June 2008. 
[BBL08]  Patricia Bouyer,
Ed Brinksma, and
Kim Guldstrand Larsen.
Optimal infinite scheduling for multipriced timed
automata.
Formal Methods in System Design 32(1):223. SpringerVerlag, February 2008.

[BHM08]  Aske Wiid Brekling,
Michael R. Hansen, and
Jan Madsen.
Models and formal verification of multiprocessor
systemonchips.
Journal of Logic and Algebraic Programming 77(12):119. Elsevier, October 2008.

[BK08]  Christel Baier and JoostPieter Katoen. Principles of ModelChecking. MIT Press, May 2008. 
[BKO+08]  Thomas Bøgholm, Henrik Karghhansen, Petur Olsen, Bent Thomsen, and Kim Guldstrand Larsen. Modelbased schedulability analysis of safety critical hard realtime Java programs. In JTRES'08, ACM International Conference Proceeding Series 343, pages 106114. ACM Press, September 2008. 
[Boj08]  Mikołaj Bojańczyk.
The Common Fragment of ACTL and LTL.
In FoSSaCS'08,
Lecture Notes in Computer Science 4962, pages 172185. SpringerVerlag, March 2008.

[Boz08]  Laura Bozzelli. The complexity of CTL* + Linear Past. In FoSSaCS'08, Lecture Notes in Computer Science 4962, pages 186200. SpringerVerlag, March 2008. 
[CDH08]  Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. Quantitative Languages. In CSL'08, Lecture Notes in Computer Science 5213, pages 385400. SpringerVerlag, September 2008. 
[CHP08]  Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. Algorithms for Büchi games. Research Report 0805.2620, arXiv, May 2008. 
[CMH08]  Krishnendu Chatterjee,
Rupak Majumdar, and
Thomas A. Henzinger.
Controller Synthesis with Budget Constraints.
In HSCC'08,
Lecture Notes in Computer Science 4981.
SpringerVerlag, April 2008.

[CPJ08]  Hubert Comon, Nicolas Perrin, and Florent Jacquemard. Visibly Tree Automata with Memory and Constraints. Logical Methods in Computer Science 4(2). May 2008. 
[DG08]  Anuj Dawar and Erich Grädel. The Descriptive Complexity of Parity Games. In CSL'08, Lecture Notes in Computer Science 5213, pages 354368. SpringerVerlag, September 2008. 
[DG08]  Volker Diekert and
Paul Gastin.
Firstorder definable languages.
In Jörg Flum,
Erich Grädel, and
Thomas Wilke (eds.),
Logic and Automata: History and Perspectives,
Texts in Logic and Games 2, pages 261306. Amsterdam University Press, 2008.

[DKR08]  Manfred Droste, Werner Kuich, and George Rahonis. MultiValued MSO Logics over Words and Trees. Fundamenta Informaticae 84(134):305327. IOS Press, 2008. 
[DLL+08]  Alexandre David,
Kim Guldstrand Larsen,
Shuhao Li, and
Brian Nielsen.
A GameTheoretic Approach to RealTime System
Testing.
In DATE'08,
pages 486491.
IEEE Comp. Soc. Press, March 2008.

[FLS08]  Marco Faella, Axel Legay, and Mariëlle Stoelinga. Model Checking Quantitative Linear Time Logic. In QAPL'08, Electronic Notes in Theoretical Computer Science 220(3), pages 6177. Elsevier, March 2008. 
[Fot08]  Dimitris Fotakis. Congestion games with linearlyindependent paths: convergence time and price of anarchy. In SAGT'08, Lecture Notes in Computer Science 4997, pages 3345. SpringerVerlag, April 2008. 
[GHK+08]  Elisabeth Gassner, Johannes Hatzl, Sven O. Krumke, Heike Sperber, and Gerhard J. Woeginger. How hard is it to find extreme Nash equilibria in network congestion games?. In WINE'08, Lecture Notes in Computer Science 5385, pages 8293. SpringerVerlag, December 2008. 
[Gri08]  Olga Grinchtein.
Learning of Timed Systems.
PhD thesis,
Deparment of Information Technology, Uppsala
University, Sweden,
2008.

[HR08]  Yoram Hirshfeld and Alexander Rabinovich. Decidable Metric Logics. Information and Computation 206(12):14251442. Elsevier, December 2008. 
[IKY+08]  Georgeta Igna,
Vankatesh Kannan,
Yang Yang,
Twan Basten,
Marc C.W. Geilen,
Frits Vaandrager,
Marc Voorhoeve,
Sebastian de Smet, and
Lou J. Somers.
Formal Modeling and Scheduling of Datapaths of
Digital Document Printers.
In FORMATS'08,
Lecture Notes in Computer Science 5215, pages 170187. SpringerVerlag, September 2008.

[JD08]  Wojciech Jamroga and Jürgen Dix. Model Checking Abilities of Agents: A Closer Look. Theory of Computing Systems 42(3):366410. SpringerVerlag, April 2008. 
[KBB+08]  Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich, Gabor Rudolf, and Jihui Zhao. On short paths interdiction problems: Total and nodewise limited interdiction. Theory of Computing Systems 43(2):204233. SpringerVerlag, August 2008. 
[KHL08]  Sebastian Kupferschmid,
Jörg Hoffmann, and
Kim Guldstrand Larsen.
Fast Directed Model Checking Via Russian Doll
Abstraction.
In TACAS'08,
Lecture Notes in Computer Science 4963, pages 203217. SpringerVerlag, March 2008.

[KSC08]  Egor V. Kuzmin,
Valery A. Sokolov, and
Dmitry Y. Chaly.
Boundedness Problems for Minsky Counter Machines.
Doklady Mathematics 78(1):604606. Pleiades Publishing, 2008.

[KWN+08]  Sebastian Kupferschmid,
Martin Wehrle,
Bernhard Nebel, and
Andreas Podelski.
Faster Than Uppaal?.
In CAV'08,
Lecture Notes in Computer Science 5123, pages 552555. SpringerVerlag, July 2008.

[Lan08]  Martin Lange.
A purely modeltheoretic proof of the exponential
succinctness gap between CTL+ and CTL.
Information Processing Letters 108(5):308312. Elsevier, November 2008.

[LR08]  Kim Guldstrand Larsen and
Jacob Illum Rasmussen.
Optimal Conditional reachability for MultiPriced
Timed Automata.
Theoretical Computer Science 390(23):197213. Elsevier, January 2008.

[Lut08]  Michael Luttenberger.
Strategy Iteration using NonDeterministic
Strategies for Solving Parity Games.
Research Report cs.GT/0806.2923, arXiv,
June 2008.

[LW08]  Sławomir Lasota and
Igor Walukiewicz.
Alternating Timed Automata.
ACM Transactions on Computational Logic 9(2).
ACM Press, March 2008.

[MB08]  Oded Maler and Grégory Batt. Approximating continuous systems by timed automata. In FMSB'08, Lecture Notes in Bioinformatics 5054, pages 7789. SpringerVerlag, June 2008. 
[MMT+08]  Arne Meier,
Martin Mundhenk,
Michael Thomas, and
Heribert Vollmer.
The Complexity of Satisfiability for Fragmentf of
CTL and CTL*.
In RP'08,
pages 201213.
September 2008.

[Mon08]  David Monniaux. A Quantifier Elimination Algorithm for Linear Real Arithmetic. In LPAR'08, Lecture Notes in Computer Science 5330, pages 243257. SpringerVerlag, November 2008. 
[Nic08]  Dejan Nickovic.
Checking Timed and Hybrid Properties: Theory and
Applications.
PhD thesis,
Lab. VERIMAG, Grenoble, France,
October 2008.

[Ore08]  Ghassan Oreiby. Logiques temporelles pour le contrôle temporisé. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, December 2008. 
[Rab08]  Roman Rabinovich. Complexity Measures for Directed Graphs. Diplomarbeit, RWTH Aachen, Germany, August 2008. 
[RS08]  R. Ramanujam and
Sunil Simon.
Dynamic Logic on Games with Structured Strategies.
In KR'08,
pages 4958.
AAAI Press, September 2008.

[RT08]  Frank G. Radmacher and
Wolfgang Thomas.
A Game Theoretic Approach to the Analysis of Dynamic
Networks.
In VerAS'07,
Electronic Notes in Theoretical Computer Science 200(2), pages 2137. Elsevier, February 2008.

[Sch08]  Sven Schewe.
ATL* Satisfiability Is 2EXPTIMEComplete.
In ICALP'08,
Lecture Notes in Computer Science 5126, pages 373385. SpringerVerlag, July 2008.

[Sch08]  Sven Schewe. Synthesis of Distributed Systems. PhD thesis, Saarland University, Germany, July 2008. 
[SFK08]  Mani Swaminathan,
Martin Fränzle, and
JoostPieter Katoen.
The Surprising Robustness of (Closed) Timed Automata
against ClockDrift.
In IFIPTCS'08,
IFIP Conference Proceedings 273, pages 537553. SpringerVerlag, September 2008.

[Sho08]  Yoav Shoham. Computer Science and Game Theory. Communications of the ACM 51(8):7479. ACM Press, August 2008. 
[SPN+08]  P. Vijay Suman,
Paritosh K. Pandya,
Shankara Narayanan Krishna, and
Lakshmi Manasa.
Timed Automata with Integer Resets: Language
Inclusion and Expressiveness.
In FORMATS'08,
Lecture Notes in Computer Science 5215, pages 7892. SpringerVerlag, September 2008.

[Umm08]  Michael Ummels.
The Complexity of Nash Equilibria in Infinite
Multiplayer Games.
In FoSSaCS'08,
Lecture Notes in Computer Science 4962, pages 2034. SpringerVerlag, March 2008.

[Vol08]  Mikhail V. Volkov. Synchronizing Automata and the Černý Conjecture. In LATA'08, Lecture Notes in Computer Science 5196, pages 1127. SpringerVerlag, March 2008. 
[VPK+08]  P. Vijay Suman, Paritosh K. Pandya, Shankara Narayanan Krishna, and Lakshmi Manasa. Timed Automata with Integer Resets: Language Inclusion and Expressiveness. In FORMATS'08, Lecture Notes in Computer Science 5215, pages 7892. SpringerVerlag, September 2008. 
[VW08]  Moshe Y. Vardi and
Thomas Wilke.
Automata: from logics to algorithms.
In Jörg Flum,
Erich Grädel, and
Thomas Wilke (eds.),
Logic and Automata: History and Perspectives,
Texts in Logic and Games 2, pages 629736. Amsterdam University Press, 2008.

[Wan08]  Farn Wang. Efficient ModelChecking of DenseTime Systems with TimeConvexity Analysis. In RTSS'08, pages 195205. IEEE Comp. Soc. Press, November 2008. 
[WBE08]  Thomas Wahl, Nicolas Blanc, and E. Allen Emerson. SVISS: Symbolic Verification of Symmetric Systems. In TACAS'08, Lecture Notes in Computer Science 4963, pages 459462. SpringerVerlag, March 2008. 
[WH08]  Libor Waszniowski and
Zdeněk Hanzálek.
Formal verification of multitasking applications
based on timed automata model.
RealTime Systems 38(1):3965. Kluwer Academic, January 2008.

Search
Displayed 64 resultsList of authors
 1
 1
 1
 1
 1
 2
 1
 1
 2
 1
 1
 1
 1
 1
 8
 1
 1
 3
 1
 1
 1
 3
 1
 1
 1
 1
 1
 1
 1
 1
 2
 1
 1
 1
 1
 1
 1
 1
 1
 2
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 3
 1
 1
 1
 1
 2
 1
 1
 2
 1
 1
 1
 1
 1
 2
 1
 1
 1
 7
 1
 1
 1
 1
 1
 1
 1
 2
 10
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 2
 2
 2
 1
 1
 1
 1
 1
 1
 1
 1
 1
 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