2005
[BCM05] Patricia Bouyer, Fabrice Chevalier, and Nicolas Markey. On the Expressiveness of TPTL and MTL. In FSTTCS'05, Lecture Notes in Computer Science 3821, pages 432-443. Springer-Verlag, December 2005.
Abstract

TPTL and MTL are two classical timed extensions of LTL. In this paper, we positively answer a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show that, surprisingly, the TPTL formula proposed by Alur and Henzinger for witnessing this conjecture can be expressed in MTL. More generally, we show that TPTL formulae using only the F modality can be translated into MTL.

@inproceedings{fsttcs2005-BCM,
  author =              {Bouyer, Patricia and Chevalier, Fabrice and Markey,
                         Nicolas},
  title =               {On the Expressiveness of {TPTL} and {MTL}},
  editor =              {Ramanujam, R. and Sen, Sandeep},
  booktitle =           {{P}roceedings of the 25th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'05)},
  acronym =             {{FSTTCS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3821},
  pages =               {432-443},
  year =                {2005},
  month =               dec,
  doi =                 {10.1007/11590156_35},
  abstract =            {TPTL and MTL are two classical timed extensions of
                         LTL. In this paper, we positively answer a
                         15-year-old conjecture that TPTL is strictly more
                         expressive than MTL. But we show that, surprisingly,
                         the TPTL formula proposed by Alur and Henzinger for
                         witnessing this conjecture can be expressed in MTL.
                         More generally, we show that TPTL formulae using
                         only the \textbf{F} modality can be translated into
                         MTL.},
}
[AAE05] Baruch Awerbuch, Yossi Azar, and Amir Epstein. The price of routing unsplittable flow. In STOC'05, pages 57-66. ACM Press, May 2005. 
@inproceedings{stoc2005-AAE,
  author =              {Awerbuch, Baruch and Azar, Yossi and Epstein, Amir},
  title =               {The price of routing unsplittable flow},
  editor =              {Gabow, Harold N. and Fagin, Ronald},
  booktitle =           {{P}roceedings of the 37th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'05)},
  acronym =             {{STOC}'05},
  publisher =           {ACM Press},
  pages =               {57-66},
  year =                {2005},
  month =               may,
  doi =                 {10.1145/1060590.1060599},
}
[ADO+05] Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, and James Worrell. Decidability and Complexity Results for Timed Automata via Channel Machines. In ICALP'05, Lecture Notes in Computer Science 3580, pages 1089-1101. Springer-Verlag, July 2005. 
@inproceedings{icalp2005-ADOW,
  author =              {Abdulla, Parosh Aziz and Deneux, Johann and
                         Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {Decidability and Complexity Results for Timed
                         Automata via Channel Machines},
  editor =              {Caires, Lu{\'\i}s and Italiano, Giuseppe F. and
                         Monteiro, Lu{\'\i}s and Palamidessi, Catuscia and
                         Yung, Moti},
  booktitle =           {{P}roceedings of the 32nd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'05)},
  acronym =             {{ICALP}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3580},
  pages =               {1089-1101},
  year =                {2005},
  month =               jul,
}
[dAF+05] Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, and Mariëlle Stoelinga. Model checking discounted temporal properties. Theoretical Computer Science 345(1):139-170. Elsevier, November 2005. 
@article{tcs345(1)-AFHMS,
  author =              {de Alfaro, Luca and Faella, Marco and Henzinger,
                         Thomas A. and Majumdar, Rupak and Stoelinga,
                         Mari{\"e}lle},
  title =               {Model checking discounted temporal properties},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {345},
  number =              {1},
  pages =               {139-170},
  year =                {2005},
  month =               nov,
}
[ALM05] Rajeev Alur, Salvatore La Torre, and Parthasarathy Madhusudan. Perturbed Timed Automata. In HSCC'05, Lecture Notes in Computer Science 3414, pages 70-85. Springer-Verlag, March 2005. 
@inproceedings{hscc2005-ALM,
  author =              {Alur, Rajeev and La{~}Torre, Salvatore and
                         Madhusudan, Parthasarathy},
  title =               {Perturbed Timed Automata},
  editor =              {Morari, Manfred and Thiele, Lothar},
  booktitle =           {{P}roceedings of the 8th {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'05)},
  acronym =             {{HSCC}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3414},
  pages =               {70-85},
  year =                {2005},
  month =               mar,
}
[AMR+05] Karine Altisen, Nicolas Markey, Pierre-Alain Reynier, and Stavros Tripakis. Implémentabilité des automates temporisés. In MSR'05, pages 395-406. Hermès, October 2005. 
@inproceedings{msr2005-AMRT,
  author =              {Altisen, Karine and Markey, Nicolas and Reynier,
                         Pierre-Alain and Tripakis, Stavros},
  title =               {Impl{\'e}mentabilit{\'e} des automates
                         temporis{\'e}s},
  editor =              {Alla, Hassane and Rutten, {\'E}ric},
  booktitle =           {{A}ctes du 5{\`e}me {C}olloque {F}rancophone sur la
                         {M}od{\'e}lisation des {S}yst{\`e}mes r{\'e}actifs
                         ({MSR}'05)},
  acronym =             {{MSR}'05},
  publisher =           {Herm{\`e}s},
  pages =               {395-406},
  year =                {2005},
  month =               oct,
  url =                 {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MSR05-impl.pdf},
}
[AT05] Karine Altisen and Stavros Tripakis. Implementation of Timed Automata: An Issue of Semantics or Modeling?. In FORMATS'05, Lecture Notes in Computer Science 3829, pages 273-288. Springer-Verlag, September 2005. 
@inproceedings{formats2005-AT,
  author =              {Altisen, Karine and Tripakis, Stavros},
  title =               {Implementation of Timed Automata: An Issue of
                         Semantics or Modeling?},
  editor =              {Pettersson, Paul and Yi, Wang},
  booktitle =           {{P}roceedings of the 3rd {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'05)},
  acronym =             {{FORMATS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3829},
  pages =               {273-288},
  year =                {2005},
  month =               sep,
}
[BBR05] Thomas Brihaye, Véronique Bruyère, and Jean-François Raskin. On Optimal Timed Strategies. In FORMATS'05, Lecture Notes in Computer Science 3829, pages 49-64. Springer-Verlag, September 2005. 
@inproceedings{formats2005-BBR,
  author =              {Brihaye, {\relax Th}omas and Bruy{\`e}re,
                         V{\'e}ronique and Raskin, Jean-Fran{\c c}ois},
  title =               {On Optimal Timed Strategies},
  editor =              {Pettersson, Paul and Yi, Wang},
  booktitle =           {{P}roceedings of the 3rd {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'05)},
  acronym =             {{FORMATS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3829},
  pages =               {49-64},
  year =                {2005},
  month =               sep,
  doi =                 {10.1007/11603009_5},
}
[BC05] Patricia Bouyer and Fabrice Chevalier. On Conciseness of Extensions of Timed Automata. Journal of Automata, Languages and Combinatorics 10(4):393-405. 2005. 
@article{jalc10(4)-BC,
  author =              {Bouyer, Patricia and Chevalier, Fabrice},
  title =               {On Conciseness of Extensions of Timed Automata},
  journal =             {Journal of Automata, Languages and Combinatorics},
  volume =              {10},
  number =              {4},
  pages =               {393-405},
  year =                {2005},
}
[BCD05] Patricia Bouyer, Fabrice Chevalier, and Deepak D'Souza. Fault Diagnosis Using Timed Automata. In FoSSaCS'05, Lecture Notes in Computer Science 3441, pages 219-233. Springer-Verlag, April 2005. 
@inproceedings{fossacs2005-BCD,
  author =              {Bouyer, Patricia and Chevalier, Fabrice and D'Souza,
                         Deepak},
  title =               {Fault Diagnosis Using Timed Automata},
  editor =              {Sassone, Vladimiro},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'05)},
  acronym =             {{FoSSaCS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3441},
  pages =               {219-233},
  year =                {2005},
  month =               apr,
  doi =                 {10.1007/978-3-540-31982-5_14},
}
[BG05] Dietmar Berwanger and Erich Grädel. Entanglement – A Measure for the Complexity of Directed Graphs with Applications to Logic and Games. In LPAR'04, Lecture Notes in Computer Science 3452, pages 209-223. Springer-Verlag, March 2005. 
@inproceedings{lpar2004-BG,
  author =              {Berwanger, Dietmar and Gr{\"a}del, Erich},
  title =               {Entanglement~-- {A}~Measure for the Complexity of
                         Directed Graphs with Applications to Logic and
                         Games},
  editor =              {Baader, Franz and Voronkov, Andrei},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference {L}ogic {P}rogramming and {A}utomated
                         {R}easoning ({LPAR}'04)},
  acronym =             {{LPAR}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3452},
  pages =               {209-223},
  year =                {2005},
  month =               mar,
}
[BH05] Dragan Bosnacki and Gerard J. Holzmann. Improving Spin's Partial-Order Reduction for Breadth-First Search. In SPIN'05, Lecture Notes in Computer Science 3639, pages 91-105. Springer-Verlag, April 2005. 
@inproceedings{spin2005-BH,
  author =              {Bosnacki, Dragan and Holzmann, Gerard J.},
  title =               {Improving {S}pin's Partial-Order Reduction for
                         Breadth-First Search},
  editor =              {Godefroid, Patrice},
  booktitle =           {{P}roceedings of the 12th {I}nternational {SPIN}
                         {W}orkshop ({SPIN}'05)},
  acronym =             {{SPIN}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3639},
  pages =               {91-105},
  year =                {2005},
  month =               apr,
  doi =                 {10.1007/11537328_10},
}
[BJK+05] Manfred Broy, Bengt Jonsson, Joost-Pieter Katoen, Martin Leucker, and Alexander Pretschner. Model-Based Testing of Reactive Systems – Advanced lectures. Lecture Notes in Computer Science 3472. Springer-Verlag, 2005. 
@book{mbt-bjklp,
  author =              {Broy, Manfred and Jonsson, Bengt and Katoen,
                         Joost-Pieter and Leucker, Martin and Pretschner,
                         Alexander},
  title =               {Model-Based Testing of Reactive Systems~-- Advanced
                         lectures},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3472},
  year =                {2005},
}
[BLR05] Patricia Bouyer, François Laroussinie, and Pierre-Alain Reynier. Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. In FORMATS'05, Lecture Notes in Computer Science 3829, pages 112-126. Springer-Verlag, September 2005. 
@inproceedings{formats2005-BLR,
  author =              {Bouyer, Patricia and Laroussinie, Fran{\c c}ois and
                         Reynier, Pierre-Alain},
  title =               {Diagonal Constraints in Timed Automata: Forward
                         Analysis of Timed Systems},
  editor =              {Pettersson, Paul and Yi, Wang},
  booktitle =           {{P}roceedings of the 3rd {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'05)},
  acronym =             {{FORMATS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3829},
  pages =               {112-126},
  year =                {2005},
  month =               sep,
  doi =                 {10.1007/11603009_10},
}
[BLR05] Gerd Behrmann, Kim Guldstrand Larsen, and Jacob Illum Rasmussen. Optimal scheduling using priced timed automata. SIGMETRICS Performance Evaluation Review 32(4):34-40. March 2005. 
@article{SIGper32(4)-BLR,
  author =              {Behrmann, Gerd and Larsen, Kim Guldstrand and
                         Rasmussen, Jacob Illum},
  title =               {Optimal scheduling using priced timed automata},
  journal =             {SIGMETRICS Performance Evaluation Review},
  volume =              {32},
  number =              {4},
  pages =               {34-40},
  year =                {2005},
  month =               mar,
}
[BT05] Harry Buhrman and Leen Torenvliet. A Post's Program for Complexity Theory. EATCS Bulletin 85:41-51. EATCS, February 2005. 
@article{eatcs-bull85()-BT,
  author =              {Buhrman, Harry and Torenvliet, Leen},
  title =               {A {P}ost's Program for Complexity Theory},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {85},
  pages =               {41-51},
  year =                {2005},
  month =               feb,
}
[CDF+05] Franck Cassez, Alexandre David, Emmanuel Fleury, Kim Guldstrand Larsen, and Didier Lime. Efficient On-the-fly Algorithms for the Analysis of Timed Games. In CONCUR'05, Lecture Notes in Computer Science 3653, pages 66-80. Springer-Verlag, August 2005. 
@inproceedings{concur2005-CDFLL,
  author =              {Cassez, Franck and David, Alexandre and Fleury,
                         Emmanuel and Larsen, Kim Guldstrand and Lime,
                         Didier},
  title =               {Efficient On-the-fly Algorithms for the Analysis of
                         Timed Games},
  editor =              {Abadi, Mart{\'\i}n and de Alfaro, Luca},
  booktitle =           {{P}roceedings of the 16th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'05)},
  acronym =             {{CONCUR}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3653},
  pages =               {66-80},
  year =                {2005},
  month =               aug,
  doi =                 {10.1007/11539452_9},
}
[CHJ05] Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdziński. Mean-payoff Parity Games. In LICS'05, pages 178-187. IEEE Comp. Soc. Press, July 2005. 
@inproceedings{lics2005-CHJ,
  author =              {Chatterjee, Krishnendu and Henzinger, Thomas A. and
                         Jurdzi{\'n}ski, Marcin},
  title =               {Mean-payoff Parity Games},
  booktitle =           {{P}roceedings of the 20th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'05)},
  acronym =             {{LICS}'05},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {178-187},
  year =                {2005},
  month =               jul,
}
[CK05] George Christodoulou and Elias Koutsoupias. The price of anarchy of finite congestion games. In STOC'05, pages 67-73. ACM Press, May 2005. 
@inproceedings{stoc2005-CK,
  author =              {Christodoulou, George and Koutsoupias, Elias},
  title =               {The price of anarchy of finite congestion games},
  editor =              {Gabow, Harold N. and Fagin, Ronald},
  booktitle =           {{P}roceedings of the 37th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'05)},
  acronym =             {{STOC}'05},
  publisher =           {ACM Press},
  pages =               {67-73},
  year =                {2005},
  month =               may,
  doi =                 {10.1145/1060590.1060600},
}
[DDR05] Martin De Wulf, Laurent Doyen, and Jean-François Raskin. Almost ASAP Semantics: From Timed Models to Timed Implementations. Formal Aspects of Computing 17(3):319-341. Springer-Verlag, 2005. 
@article{fac17(3)-DDR,
  author =              {De{~}Wulf, Martin and Doyen, Laurent and Raskin,
                         Jean-Fran{\c c}ois},
  title =               {Almost {ASAP} Semantics: From Timed Models to Timed
                         Implementations},
  publisher =           {Springer-Verlag},
  journal =             {Formal Aspects of Computing},
  volume =              {17},
  number =              {3},
  pages =               {319-341},
  year =                {2005},
}
[Die05] Henning Dierks. Finding Optimal Plans for Domains with Continuous Effects with UPPAAL Cora. In VV&PS'05. June 2005. 
@inproceedings{vvps2005-dierks,
  author =              {Dierks, Henning},
  title =               {Finding Optimal Plans for Domains with Continuous
                         Effects with {UPPAAL} {C}ora},
  booktitle =           {{P}roceedings of the {ICAPS}'05 {W}orkshop on
                         {V}erification and {V}alidation of {M}odel-Based
                         {P}lanning and {S}chedulin {S}ystems ({VV\&PS}'05)},
  acronym =             {{VV\&PS}'05},
  year =                {2005},
  month =               jun,
}
[DP05] Deepak D'Souza and Pavithra Prabhakar. On the Expressiveness of MTL in the Pointwise and Continuous Semantics. Technical Report IISc-CSA-TR-2005-7, Indian Institute of Science, Bangalore, India, May 2005. 
@techreport{IISc-CSA-TR-2005-7-DP,
  author =              {D'Souza, Deepak and Prabhakar, Pavithra},
  title =               {On the Expressiveness of {MTL} in the Pointwise and
                         Continuous Semantics},
  number =              {IISc-CSA-TR-2005-7},
  year =                {2005},
  month =               may,
  institution =         {Indian Institute of Science, Bangalore, India},
  type =                {Technical Report},
}
[EY05] Kousha Etessami and Mihalis Yannakakis. Recursive Markov Decision Processes and Recursive Stochastic Games. In ICALP'05, Lecture Notes in Computer Science 3580, pages 891-903. Springer-Verlag, July 2005. 
@inproceedings{icalp2005-EY,
  author =              {Etessami, Kousha and Yannakakis, Mihalis},
  title =               {Recursive {M}arkov Decision Processes and Recursive
                         Stochastic Games},
  editor =              {Caires, Lu{\'\i}s and Italiano, Giuseppe F. and
                         Monteiro, Lu{\'\i}s and Palamidessi, Catuscia and
                         Yung, Moti},
  booktitle =           {{P}roceedings of the 32nd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'05)},
  acronym =             {{ICALP}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3580},
  pages =               {891-903},
  year =                {2005},
  month =               jul,
}
[FKS05] Dimitris Fotakis, Spyros Kontogiannis, and Paul G. Spirakis. Selfish unsplittable flows. Theoretical Computer Science 348(2-3):226-239. Elsevier, December 2005. 
@article{tcs348(2-3)-FKS,
  author =              {Fotakis, Dimitris and Kontogiannis, Spyros and
                         Spirakis, Paul G.},
  title =               {Selfish unsplittable flows},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {348},
  number =              {2-3},
  pages =               {226-239},
  year =                {2005},
  month =               dec,
  doi =                 {10.1016/j.tcs.2005.09.024},
}
[FW05] Carsten Fritz and Thomas Wilke. Simulation Relations for Alternating Büchi Automata. Theoretical Computer Science 338(1-3):275-314. Elsevier, June 2005. 
@article{tcs338(1-3)-FW,
  author =              {Fritz, Carsten and Wilke, Thomas},
  title =               {Simulation Relations for Alternating {B}{\"u}chi
                         Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {338},
  number =              {1-3},
  pages =               {275-314},
  year =                {2005},
  month =               jun,
}
[GC05] Arie Gurfinkel and Marsha Chechik. How Thorough Is Thorough Enough?. In CHARME'05, Lecture Notes in Computer Science 3725, pages 65-80. Springer-Verlag, October 2005. 
@inproceedings{charme2005-GC,
  author =              {Gurfinkel, Arie and Chechik, Marsha},
  title =               {How Thorough Is Thorough Enough?},
  editor =              {Borrine, Dominique and Paul, Wolfgang J.},
  booktitle =           {{P}roceedings of the 13th {C}orrect {H}ardware
                         {D}esign and {V}erification {M}ethods ({CHARME}'05)},
  acronym =             {{CHARME}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3725},
  pages =               {65-80},
  year =                {2005},
  month =               oct,
}
[GLM+05] Guillaume Gardey, Didier Lime, Morgan Magnin, and Olivier H. Roux. Romeo: A Tool for Analyzing Time Petri Nets. In CAV'05, Lecture Notes in Computer Science 3576, pages 418-423. Springer-Verlag, July 2005. 
@inproceedings{cav2005-GLMR,
  author =              {Gardey, Guillaume and Lime, Didier and Magnin,
                         Morgan and Roux, Olivier H.},
  title =               {Romeo: A~Tool for Analyzing Time {P}etri Nets},
  editor =              {Etessami, Kousha and Rajamani, Sriram},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'05)},
  acronym =             {{CAV}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3576},
  pages =               {418-423},
  year =                {2005},
  month =               jul,
  doi =                 {10.1007/11513988_41},
}
[Gol05] Oded Goldreich. On promise problems. Research Report 05-014, Electronic Colloquium on Computational Complexity, August 2005. 
@techreport{eccc2005-Gol,
  author =              {Goldreich, Oded},
  title =               {On promise problems},
  number =              {05-014},
  year =                {2005},
  month =               aug,
  institution =         {Electronic Colloquium on Computational Complexity},
  type =                {Research Report},
}
[GRV05] Gilles Geeraerts, Jean-François Raskin, and Laurent Van Begin. Expand, Enlarge and Check... Made Efficient. In CAV'05, Lecture Notes in Computer Science 3576, pages 394-407. Springer-Verlag, July 2005. 
@inproceedings{cav2005-GRV,
  author =              {Geeraerts, Gilles and Raskin, Jean-Fran{\c c}ois and
                         Van{~}Begin, Laurent},
  title =               {Expand, Enlarge and Check... Made Efficient},
  editor =              {Etessami, Kousha and Rajamani, Sriram},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'05)},
  acronym =             {{CAV}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3576},
  pages =               {394-407},
  year =                {2005},
  month =               jul,
}
[GTK05] Shafi Goldwasser and Yael Tauman Kalai. On the Impossibility of Obfuscation with Auxiliary Input. In FOCS'05, pages 553-562. IEEE Comp. Soc. Press, October 2005. 
@inproceedings{focs2005-GT,
  author =              {Goldwasser, Shafi and Tauman Kalai, Yael},
  title =               {On the Impossibility of Obfuscation with Auxiliary
                         Input},
  booktitle =           {{P}roceedings of the 46th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'05)},
  acronym =             {{FOCS}'05},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {553-562},
  year =                {2005},
  month =               oct,
}
[GV05] Jaco Geldenhuys and Antti Valmari. More Efficient On-the-fly LTL Verification with Tarjan's Algorithm. Theoretical Computer Science 345(1):60-82. Elsevier, November 2005. 
@article{tcs345(1)-GV,
  author =              {Geldenhuys, Jaco and Valmari, Antti},
  title =               {More Efficient On-the-fly {LTL} Verification with
                         {T}arjan's Algorithm},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {345},
  number =              {1},
  pages =               {60-82},
  year =                {2005},
  month =               nov,
}
[GZ05] Hugo Gimbert and Wiesław Zielonka. Games Where You Can Play Optimally Without Any Memory. In CONCUR'05, Lecture Notes in Computer Science 3653, pages 428-442. Springer-Verlag, August 2005. 
@inproceedings{concur2005-GZ,
  author =              {Gimbert, Hugo and Zielonka, Wies{\l}aw},
  title =               {Games Where You Can Play Optimally Without Any
                         Memory},
  editor =              {Abadi, Mart{\'\i}n and de Alfaro, Luca},
  booktitle =           {{P}roceedings of the 16th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'05)},
  acronym =             {{CONCUR}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3653},
  pages =               {428-442},
  year =                {2005},
  month =               aug,
  doi =                 {10.1007/11539452_33},
}
[Hal05] Nicolas Halbwachs. A Synchronous Language at Work: the Story of Lustre. In MEMOCODE'05, pages 3-11. IEEE Comp. Soc. Press, July 2005. 
@inproceedings{memocode2005-Hal,
  author =              {Halbwachs, Nicolas},
  title =               {A Synchronous Language at Work: the Story of Lustre},
  booktitle =           {{P}roceedings of the {T}hird {ACM} and {IEEE}
                         {I}nternational {C}onference on {F}ormal {M}ethods
                         and {M}odels for {C}o-{D}esign ({MEMOCODE}'05)},
  acronym =             {{MEMOCODE}'05},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {3-11},
  year =                {2005},
  month =               jul,
  doi =                 {10.1109/MEMCOD.2005.1487884},
}
[Har05] Aidan Harding. Symbolic Strategy Synthesis for Games with LTL Winning Conditions. PhD thesis, School of Computer Science, University of Birmingham, UK, March 2005. 
@phdthesis{phd-harding,
  author =              {Harding, Aidan},
  title =               {Symbolic Strategy Synthesis for Games with {LTL}
                         Winning Conditions},
  year =                {2005},
  month =               mar,
  school =              {School of Computer Science, University of
                         Birmingham, UK},
}
[Hen05] Thomas A. Henzinger. Games in system design and verification. In TARK'05, pages 1-4. June 2005. 
@inproceedings{tark2005-Hen,
  author =              {Henzinger, Thomas A.},
  title =               {Games in system design and verification},
  editor =              {van der Meyden, Ron},
  booktitle =           {{P}roceedings of the 10th {C}onference on
                         {T}heoretical {A}spects of {R}ationality and
                         {K}nowledge ({TARK}'05)},
  acronym =             {{TARK}'05},
  pages =               {1-4},
  year =                {2005},
  month =               jun,
}
[vdH+05] Wiebe van der Hoek, Wojciech Jamroga, and Michael Wooldridge. A Logic for Strategic Reasoning. In AAMAS'05, pages 157-164. ACM Press, July 2005. 
@inproceedings{aamas2005-HJW,
  author =              {van der Hoek, Wiebe and Jamroga, Wojciech and
                         Wooldridge, Michael},
  title =               {A Logic for Strategic Reasoning},
  editor =              {Dignum, Franck and Dignum, Virginia and Koenig, Sven
                         and Kraus, Sarit and Singh, Munindar P. and
                         Wooldridge, Michael},
  booktitle =           {{P}roceedings of the 4th {I}nternational {J}oint
                         {C}onference on {A}utonomous {A}gents and
                         {M}ultiagent {S}ystems ({AAMAS}'05)},
  acronym =             {{AAMAS}'05},
  publisher =           {ACM Press},
  pages =               {157-164},
  year =                {2005},
  month =               jul,
}
[HMP05] Thomas A. Henzinger, Rupak Majumdar, and Vinayak S. Prabhu. Quantifying Similarities Between Timed Systems. In FORMATS'05, Lecture Notes in Computer Science 3829, pages 226-241. Springer-Verlag, September 2005. 
@inproceedings{formats2005-HMP,
  author =              {Henzinger, Thomas A. and Majumdar, Rupak and Prabhu,
                         Vinayak S.},
  title =               {Quantifying Similarities Between Timed Systems},
  editor =              {Pettersson, Paul and Yi, Wang},
  booktitle =           {{P}roceedings of the 3rd {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'05)},
  acronym =             {{FORMATS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3829},
  pages =               {226-241},
  year =                {2005},
  month =               sep,
}
[Hor05] Florian Horn. Streett Games on Finite Graphs. In GDV'05. July 2005. 
@inproceedings{gdv2005-Horn,
  author =              {Horn, Florian},
  title =               {{S}treett Games on Finite Graphs},
  editor =              {Jurdzi{\'n}ski, Marcin and Majumdar, Rupak},
  booktitle =           {{P}roceedings of the 2nd {W}orkshop on {G}ames in
                         {D}esign and {V}erification ({GDV}'05)},
  acronym =             {{GDV}'05},
  year =                {2005},
  month =               jul,
}
[HR05] Yoram Hirshfeld and Alexander Rabinovich. Timer Formulas and Decidable Metric Temporal Logic. Information and Computation 198(2):148-178. Academic Press, May 2005. 
@article{icomp198(2)-HR,
  author =              {Hirshfeld, Yoram and Rabinovich, Alexander},
  title =               {Timer Formulas and Decidable Metric Temporal Logic},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {198},
  number =              {2},
  pages =               {148-178},
  year =                {2005},
  month =               may,
  doi =                 {10.1016/j.ic.2004.12.002},
}
[HR05] Ian Hodkinson and Mark Reynolds. Separation – Past, Present, and Future. In Sergei N. Artemov, Howard Barringer, Artur S. d'Avila Garcez, Luís C. Lamb, and John Woods (eds.), We Will Show Them – Essays in Honour of Dov Gabbay. College Publications, 2005. 
@incollection{wwst2005b-HR,
  author =              {Hodkinson, Ian and Reynolds, Mark},
  title =               {Separation~-- Past, Present, and Future},
  editor =              {Artemov, Sergei N. and Barringer, Howard and d'Avila
                         Garcez, Artur S. and Lamb, Lu{\'\i}s C. and Woods,
                         John},
  booktitle =           {We Will Show Them~-- Essays in Honour of
                         {D}ov~{G}abbay},
  publisher =           {College Publications},
  volume =              {2},
  pages =               {117-142},
  year =                {2005},
}
[HRS05] Aidan Harding, Mark D. Ryan, and Pierre-Yves Schobbens. A New Algorithm for Strategy Synthesis in LTL Games. In TACAS'05, Lecture Notes in Computer Science 3440, pages 477-492. Springer-Verlag, April 2005. 
@inproceedings{tacas2005-HRS,
  author =              {Harding, Aidan and Ryan, Mark D. and Schobbens,
                         Pierre-Yves},
  title =               {A New Algorithm for Strategy Synthesis in {LTL}
                         Games},
  editor =              {Halbwachs, Nicolas and Zuck, Lenore D.},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'05)},
  acronym =             {{TACAS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3440},
  pages =               {477-492},
  year =                {2005},
  month =               apr,
}
[JD05] Wojciech Jamroga and Jürgen Dix. Do Agents Make Model Checking Explode (Computationally)?. In CEEMAS'05, Lecture Notes in Artificial Intelligence 23690, pages 398-407. Springer-Verlag, September 2005. 
@inproceedings{ceemas2005-JD,
  author =              {Jamroga, Wojciech and Dix, J{\"u}rgen},
  title =               {Do Agents Make Model Checking Explode
                         (Computationally)?},
  editor =              {P{\v e}chouc{\v e}k, Michal and Petta, Paolo and
                         Varga, L{\'a}szl{\'o} Zsolt},
  booktitle =           {{P}roceedings of the 4th {I}nternational {C}entral
                         and {E}astern {E}uropean {C}onference on
                         {M}ulti-{A}gent {S}ystems ({CEEMAS}'05)},
  acronym =             {{CEEMAS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {23690},
  pages =               {398-407},
  year =                {2005},
  month =               sep,
}
[JvdH+05] Wojciech Jamroga, Wiebe van der Hoek, and Michael Wooldridge. Intentions and Strategies in Game-Like Scenarios. In EPIA'05, Lecture Notes in Artificial Intelligence 3808, pages 512-523. Springer-Verlag, December 2005. 
@inproceedings{epia2005-JHW,
  author =              {Jamroga, Wojciech and van der Hoek, Wiebe and
                         Wooldridge, Michael},
  title =               {Intentions and Strategies in Game-Like Scenarios},
  editor =              {Bento, Carlos and Cardoso, Am{\'\i}lcar and Dias,
                         Ga{\"e}l},
  booktitle =           {{P}roceedings of the 12th {P}ortuguese {C}onference
                         on {A}rtificial {I}ntelligence ({EPIA}'05)},
  acronym =             {{EPIA}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {3808},
  pages =               {512-523},
  year =                {2005},
  month =               dec,
}
[Kar05] Jarkko Kari. Theory of Cellular Automata: A Survey. Theoretical Computer Science 334(1-3):3-33. Elsevier, April 2005. 
@article{tcs334(1-3)-Kar,
  author =              {Kari, Jarkko},
  title =               {Theory of Cellular Automata: A Survey},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {334},
  number =              {1-3},
  pages =               {3-33},
  year =                {2005},
  month =               apr,
}
[KO05] Ahmed Khoumsi and Lucien Ouedraogo. A New Method for Transforming Timed Automata. In SBMF'04, Electronic Notes in Theoretical Computer Science 130. Elsevier, 2005. 
@inproceedings{sbmf2004-KO,
  author =              {Khoumsi, Ahmed and Ouedraogo, Lucien},
  title =               {A New Method for Transforming Timed Automata},
  editor =              {Mota, Alexandre and Moura, Arnaldo V.},
  booktitle =           {{P}roceedings of the 7th {B}razilian {S}ymposium on
                         {F}ormal {M}ethods ({SBMF}'04)},
  acronym =             {{SBMF}'04},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {130},
  year =                {2005},
  confyear =            {2004},
  confmonth =           {11},
}
[KP05] Yonit Kesten and Amir Pnueli. A Compositional Approach to CTL* Verification. Theoretical Computer Science 331(2-3):397-428. Elsevier, February 2005. 
@article{tcs331(2-3)-KP,
  author =              {Kesten, Yonit and Pnueli, Amir},
  title =               {A Compositional Approach to {CTL}{\(^*\)}
                         Verification},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {331},
  number =              {2-3},
  pages =               {397-428},
  year =                {2005},
  month =               feb,
}
[KP05] Pavel Krčál and Radek Pelánek. On Sampled Semantics of Timed Systems. In FSTTCS'05, Lecture Notes in Computer Science 3821, pages 310-321. Springer-Verlag, December 2005. 
@inproceedings{fsttcs2005-KP,
  author =              {Kr{\v{c}}{\'{a}}l, Pavel and Pel{\'{a}}nek, Radek},
  title =               {On Sampled Semantics of Timed Systems},
  editor =              {Ramanujam, R. and Sen, Sandeep},
  booktitle =           {{P}roceedings of the 25th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'05)},
  acronym =             {{FSTTCS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3821},
  pages =               {310-321},
  year =                {2005},
  month =               dec,
}
[KS05] Spyros Kontogiannis and Paul G. Spirakis. Atomic selfish routing in networks: a survey. In WINE'05, Lecture Notes in Computer Science 3828, pages 989-1002. Springer-Verlag, December 2005. 
@inproceedings{wine2005-KS,
  author =              {Kontogiannis, Spyros and Spirakis, Paul G.},
  title =               {Atomic selfish routing in networks: a~survey},
  editor =              {Deng, Xiaotie and Ye, Yinyu},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {I}nternet and {N}etwork {E}conomics ({WINE}'05)},
  acronym =             {{WINE}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3828},
  pages =               {989-1002},
  year =                {2005},
  month =               dec,
  doi =                 {10.1007/11600930_100},
}
[KS05] Antonín Kučera and Jan Strejček. The Stuttering Principle Revisited. Acta Informatica 41(7-8):415-434. Springer-Verlag, June 2005. 
@article{acta41(7-8)-KS,
  author =              {Ku{\v c}era, Anton{\'\i}n and Strej{\v c}ek, Jan},
  title =               {The Stuttering Principle Revisited},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {41},
  number =              {7-8},
  pages =               {415-434},
  year =                {2005},
  month =               jun,
  doi =                 {10.1007/s00236-005-0164-4},
}
[KS05] Antonín Kučera and Jan Strejček. Characteristic Patterns for LTL. In SOFSEM'05, Lecture Notes in Computer Science 3381, pages 239-249. Springer-Verlag, January 2005. 
@inproceedings{sofsem2005-KS,
  author =              {Ku{\v c}era, Anton{\'\i}n and Strej{\v c}ek, Jan},
  title =               {Characteristic Patterns for {LTL}},
  editor =              {Vojt{\'a}s, Peter and Bielikov{\'a}, M{\'a}ria and
                         Charron-Bost, Bernadette and S{\'y}kora, Ondrej},
  booktitle =           {{P}roceedings of the 31st {C}onference on {C}urrent
                         {T}rends in {T}heory and {P}ractice of {I}nformatics
                         ({SOFSEM}'05)},
  acronym =             {{SOFSEM}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3381},
  pages =               {239-249},
  year =                {2005},
  month =               jan,
}
[KW05] Shmuel Tomi Klein and Yair Wiseman. Parallel Lempel-Ziv Coding. Discrete Applied Mathematics 146(2):180-191. Elsevier, March 2005. 
@article{dam146(2)-KW,
  author =              {Klein, Shmuel Tomi and Wiseman, Yair},
  title =               {Parallel {L}empel-{Z}iv Coding},
  publisher =           {Elsevier},
  journal =             {Discrete Applied Mathematics},
  volume =              {146},
  number =              {2},
  pages =               {180-191},
  year =                {2005},
  month =               mar,
}
[Lan05] Martin Lange. Weak Automata for the Linear Time μ-Calculus. In VMCAI'05, Lecture Notes in Computer Science 3385, pages 267-281. Springer-Verlag, January 2005. 
@inproceedings{vmcai2005-Lan,
  author =              {Lange, Martin},
  title =               {Weak Automata for the Linear Time
                         {\(\mu\)}-Calculus},
  editor =              {Cousot, Radhia},
  booktitle =           {{P}roceedings of the 6th {I}nternational {W}orkshop
                         on {V}erification, {M}odel {C}hecking, and
                         {A}bstract {I}nterpretation ({VMCAI}'05)},
  acronym =             {{VMCAI}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3385},
  pages =               {267-281},
  year =                {2005},
  month =               jan,
}
[Lim05] Nutan Limaye. Parallel Complexity Classes Centered around LOGCFL. Master's thesis, Anna University, Chennai, India, April 2005. 
@mastersthesis{master05-limaye,
  author =              {Limaye, Nutan},
  title =               {Parallel Complexity Classes Centered around
                         {LOGCFL}},
  year =                {2005},
  month =               apr,
  school =              {Anna University, Chennai, India},
}
[LNZ05] Denis Lugiez, Peter Niebert, and Sarah Zennou. A partial order semantics approach to the clock explosion problem of timed automata. Theoretical Computer Science 345(1):27-59. Elsevier, November 2005. 
@article{tcs345(1)-LNZ,
  author =              {Lugiez, Denis and Niebert, Peter and Zennou, Sarah},
  title =               {A~partial order semantics approach to the clock
                         explosion problem of timed automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {345},
  number =              {1},
  pages =               {27-59},
  year =                {2005},
  month =               nov,
}
[Loh05] Markus Lohrey. Model Checking Hierarchical Structures. In LICS'05, pages 168- 177. IEEE Comp. Soc. Press, July 2005. 
@inproceedings{lics2005-Loh,
  author =              {Lohrey, Markus},
  title =               {Model Checking Hierarchical Structures},
  booktitle =           {{P}roceedings of the 20th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'05)},
  acronym =             {{LICS}'05},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {168- 177},
  year =                {2005},
  month =               jul,
}
[LR05] Kim Guldstrand Larsen and Jacob Illum Rasmussen. Optimal Conditional reachability for Multi-Priced Timed Automata. In FoSSaCS'05, Lecture Notes in Computer Science 3441, pages 234-249. Springer-Verlag, April 2005. 
@inproceedings{fossacs2005-LR,
  author =              {Larsen, Kim Guldstrand and Rasmussen, Jacob Illum},
  title =               {Optimal Conditional reachability for Multi-Priced
                         Timed Automata},
  editor =              {Sassone, Vladimiro},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'05)},
  acronym =             {{FoSSaCS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3441},
  pages =               {234-249},
  year =                {2005},
  month =               apr,
}
[LW05] Sławomir Lasota and Igor Walukiewicz. Alternating Timed Automata. In FoSSaCS'05, Lecture Notes in Computer Science 3441, pages 250-265. Springer-Verlag, April 2005. 
@inproceedings{fossacs2005-LW,
  author =              {Lasota, S{\l}awomir and Walukiewicz, Igor},
  title =               {Alternating Timed Automata},
  editor =              {Sassone, Vladimiro},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'05)},
  acronym =             {{FoSSaCS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3441},
  pages =               {250-265},
  year =                {2005},
  month =               apr,
}
[Mar05] Wilfredo R. Marrero. Using BDDs to Decide CTL. In TACAS'05, Lecture Notes in Computer Science 3440, pages 222-236. Springer-Verlag, April 2005. 
@inproceedings{tacas2005-Mar,
  author =              {Marrero, Wilfredo R.},
  title =               {Using {BDD}s to Decide~{CTL}},
  editor =              {Halbwachs, Nicolas and Zuck, Lenore D.},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'05)},
  acronym =             {{TACAS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3440},
  pages =               {222-236},
  year =                {2005},
  month =               apr,
}
[Mit05] David G. Mitchell. A SAT Solver Primer. EATCS Bulletin 85:112-132. EATCS, February 2005. 
@article{eatcs-bull85()-Mit,
  author =              {Mitchell, David G.},
  title =               {A {SAT} Solver Primer},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {85},
  pages =               {112-132},
  year =                {2005},
  month =               feb,
}
[MP05] Filippo Mera and Giovanni Pighizzini. Complementing Unary Nondeterministic Automata. Theoretical Computer Science 330(2):349-360. Elsevier, February 2005. 
@article{tcs330(2)-MP,
  author =              {Mera, Filippo and Pighizzini, Giovanni},
  title =               {Complementing Unary Nondeterministic Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {330},
  number =              {2},
  pages =               {349-360},
  year =                {2005},
  month =               feb,
}
[MRW05] Peter Bro Miltersen, Jaikumar Radhakrishnan, and Ingo Wegener. On Converting CNF to DNF. Theoretical Computer Science 347(1-2):325-335. Elsevier, November 2005. 
@article{tcs347(1-2)-MRW,
  author =              {Miltersen, Peter Bro and Radhakrishnan, Jaikumar and
                         Wegener, Ingo},
  title =               {On Converting {CNF} to {DNF}},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {347},
  number =              {1-2},
  pages =               {325-335},
  year =                {2005},
  month =               nov,
}
[MW05] Anca Muscholl and Igor Walukiewicz. An NP-complete Fragment of LTL. International Journal of Foundations of Computer Science 16(4):743-753. August 2005. 
@article{ijfcs16(4)-MW,
  author =              {Muscholl, Anca and Walukiewicz, Igor},
  title =               {An {NP}-complete Fragment of~{LTL}},
  journal =             {International Journal of Foundations of Computer
                         Science},
  volume =              {16},
  number =              {4},
  pages =               {743-753},
  year =                {2005},
  month =               aug,
}
[OW05] Joël Ouaknine and James Worrell. On the Decidability of Metric Temporal Logic. In LICS'05, pages 188-197. IEEE Comp. Soc. Press, July 2005. 
@inproceedings{lics2005-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {On the Decidability of Metric Temporal Logic},
  booktitle =           {{P}roceedings of the 20th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'05)},
  acronym =             {{LICS}'05},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {188-197},
  year =                {2005},
  month =               jul,
}
[PPQ05] Davide Prandi, Corrado Priami, and Paola Quaglia. Process Calculi in a Biological Context. EATCS Bulletin 85:53-69. EATCS, February 2005. 
@article{eatcs-bull85()-PPQ,
  author =              {Prandi, Davide and Priami, Corrado and Quaglia,
                         Paola},
  title =               {Process Calculi in a Biological Context},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {85},
  pages =               {53-69},
  year =                {2005},
  month =               feb,
}
[PS05] Radek Pelánek and Jan Strejček. Deeper Connections Between LTL and Alternating Automata.. In CIAA'05, Lecture Notes in Computer Science 3845, pages 238-249. Springer-Verlag, June 2005. 
@inproceedings{ciaa2005-PS,
  author =              {Pel{\'a}nek, Radek and Strej{\v c}ek, Jan},
  title =               {Deeper Connections Between {LTL} and Alternating
                         Automata.},
  editor =              {Farr{\'e}, Jacques and Litovsky, Igor and Schmitz,
                         Sylvain},
  booktitle =           {{R}evised {S}elected {P}apers of the 10th
                         {I}nternational {C}onference on Implementation and
                         Application of Automata ({CIAA}'05)},
  acronym =             {{CIAA}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3845},
  pages =               {238-249},
  year =                {2005},
  month =               jun,
}
[Rey05] Mark Reynolds. An Axiomatization of PCTL*. Information and Computation 201(1):72-119. Academic Press, August 2005. 
@article{icomp201(1)-Rey,
  author =              {Reynolds, Mark},
  title =               {An Axiomatization of {PCTL}{\(^*\)}},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {201},
  number =              {1},
  pages =               {72-119},
  year =                {2005},
  month =               aug,
}
[San05] Sven Sandberg. Homing and Synchronizing Sequences. In MBTRS'04, Lecture Notes in Computer Science 3472, pages 5-33. Springer-Verlag, 2005. 
@inproceedings{mbtrs2004-San,
  author =              {Sandberg, Sven},
  title =               {Homing and Synchronizing Sequences},
  editor =              {Broy, Manfred and Jonsson, Bengt and Katoen,
                         Joost-Pieter and Leucker, Martin and Pretschner,
                         Alexander},
  booktitle =           {{A}dvanced {L}ectures on {M}odel-{B}ased {T}esting
                         of {R}eactive {S}ystems ({MBTRS}'04)},
  acronym =             {{MBTRS}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3472},
  pages =               {5-33},
  year =                {2005},
  confyear =            {2004},
  confmonth =           {1},
}
[Sla05] John K. Slaney. Semipositive LTL with an Uninterpreted Past Operator. Logic Journal of the IGPL 13(2):211-229. Oxford University Press, March 2005. 
@article{jigpl13(2)-Sla,
  author =              {Slaney, John K.},
  title =               {Semipositive {LTL} with an Uninterpreted Past
                         Operator},
  publisher =           {Oxford University Press},
  journal =             {Logic Journal of the IGPL},
  volume =              {13},
  number =              {2},
  pages =               {211-229},
  year =                {2005},
  month =               mar,
}
[TYB05] Stavros Tripakis, Sergio Yovine, and Ahmed Bouajjani. Checking Timed Büchi Automata Emptiness Efficiently. Formal Methods in System Design 26(3):267-292. Springer-Verlag, May 2005. 
@article{fmsd26(3)-TYB,
  author =              {Tripakis, Stavros and Yovine, Sergio and Bouajjani,
                         Ahmed},
  title =               {Checking Timed {B}{\"u}chi Automata Emptiness
                         {E}fficiently},
  publisher =           {Springer-Verlag},
  journal =             {Formal Methods in System Design},
  volume =              {26},
  number =              {3},
  pages =               {267-292},
  year =                {2005},
  month =               may,
  doi =                 {10.1007/s10703-005-1632-8},
}
[Umm05] Michael Ummels. Rational Behavious and Strategy Construction in Infinite Multiplayer Games. Diplomarbeit, RWTH Aachen, Germany, July 2005. 
@mastersthesis{diplom05-Umm,
  author =              {Ummels, Michael},
  title =               {Rational Behavious and Strategy Construction in
                         Infinite Multiplayer Games},
  year =                {2005},
  month =               jul,
  school =              {RWTH Aachen, Germany},
  type =                {Diplomarbeit},
}
[Vin05] N. V. Vinodchandran. A Note on the Circuit Complexity of PP. Theoretical Computer Science 347(1-2):415-418. Elsevier, November 2005. 
@article{tcs347(1-2)-Vin,
  author =              {Vinodchandran, N. V.},
  title =               {A Note on the Circuit Complexity of~{PP}},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {347},
  number =              {1-2},
  pages =               {415-418},
  year =                {2005},
  month =               nov,
}
[Wee05] Hoeteck Wee. On Obfuscating Point Functions. In STOC'05, pages 523-532. ACM Press, May 2005. 
@inproceedings{stoc2005-Wee,
  author =              {Wee, Hoeteck},
  title =               {On Obfuscating Point Functions},
  editor =              {Gabow, Harold N. and Fagin, Ronald},
  booktitle =           {{P}roceedings of the 37th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'05)},
  acronym =             {{STOC}'05},
  publisher =           {ACM Press},
  pages =               {523-532},
  year =                {2005},
  month =               may,
}
[Zur05] Richard Zurawski. Embedded Systems Handbook. CRC Press, 2005. 
@book{ESH2005-zurawski,
  author =              {Zurawski, Richard},
  title =               {Embedded Systems Handbook},
  publisher =           {CRC Press},
  year =                {2005},
}
List of authors