O
[Obd03] Jan Obdržálek. Fast Mu-Calculus Model Checking When Tree-Width is Bounded. In CAV'03, Lecture Notes in Computer Science 2725, pages 80-92. Springer-Verlag, July 2003. 
@inproceedings{cav2003-obd,
  author =              {Obdr{\v z}{\'a}lek, Jan},
  title =               {Fast Mu-Calculus Model Checking When Tree-Width is
                         Bounded},
  editor =              {Hunt, Jr, Warren A. and Somenzi, Fabio},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'03)},
  acronym =             {{CAV}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2725},
  pages =               {80-92},
  year =                {2003},
  month =               jul,
  doi =                 {10.1007/978-3-540-45069-6_7},
}
[Odd00] Denis Oddoux. Génération efficace d'automates de Büchi à partir de formules LTL. Mémoire de D.E.A., Lab. Informatique Algorithmique: Fondements et Applications, Université Paris 7, France, June 2000. 
@mastersthesis{dea-oddoux,
  author =              {Oddoux, Denis},
  title =               {G{\'e}n{\'e}ration efficace d'automates de
                         {B}{\"u}chi {\`a} partir de formules {LTL}},
  year =                {2000},
  month =               jun,
  school =              {Lab.~Informatique Algorithmique: Fondements et
                         Applications, Universit{\'e} Paris~7, France},
  type =                {M\'emoire de D.E.A.},
}
[Odd03] Denis Oddoux. Utilisation des automates alternants pour un model-checking efficace des logiques temporelles linéaires. Thèse de doctorat, Lab. Informatique Algorithmique: Fondements et Applications, Université Paris 7, France, December 2003. 
@phdthesis{phd-oddoux,
  author =              {Oddoux, Denis},
  title =               {Utilisation des automates alternants pour un
                         model-checking efficace des logiques temporelles
                         lin{\'e}aires},
  year =                {2003},
  month =               dec,
  school =              {Lab.~Informatique Algorithmique: Fondements et
                         Applications, Universit{\'e} Paris~7, France},
  type =                {Th\`ese de doctorat},
}
[ON80] Hiroakira Ono and Akira Nakamura. On the Size of Refutation Kripke Models for Some Linear Modal and Tense Logics. Studia Logica 39(4):325-333. Kluwer Academic, 1980. 
@article{studlog39(4)-ON,
  author =              {Ono, Hiroakira and Nakamura, Akira},
  title =               {On the Size of Refutation Kripke Models for Some
                         Linear Modal and Tense Logics},
  publisher =           {Kluwer Academic},
  journal =             {Studia Logica},
  volume =              {39},
  number =              {4},
  pages =               {325-333},
  year =                {1980},
}
[OR94] Martin J. Osborne and Ariel Rubinstein. A Course in Game Theory. MIT Press, 1994. 
@book{cgt-OR94,
  author =              {Osborne, Martin J. and Rubinstein, Ariel},
  title =               {A Course in Game Theory},
  publisher =           {MIT Press},
  year =                {1994},
}
[Ore08] Ghassan Oreiby. Logiques temporelles pour le contrôle temporisé. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, December 2008. 
@phdthesis{phd-oreiby,
  author =              {Oreiby, Ghassan},
  title =               {Logiques temporelles pour le contr{\^o}le
                         temporis{\'e}},
  year =                {2008},
  month =               dec,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Th\`ese de doctorat},
}
[ORS14] Youssouf Oualhadj, Pierre-Alain Reynier, and Ocan Sankur. Probabilistic Robust Timed Games. In CONCUR'14, Lecture Notes in Computer Science 8704, pages 203-217. Springer-Verlag, September 2014. 
@inproceedings{concur2014-ORS,
  author =              {Oualhadj, Youssouf and Reynier, Pierre-Alain and
                         Sankur, Ocan},
  title =               {Probabilistic Robust Timed Games},
  editor =              {Baldan, Paolo and Gorla, Daniele},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'14)},
  acronym =             {{CONCUR}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8704},
  pages =               {203-217},
  year =                {2014},
  month =               sep,
  doi =                 {10.1007/978-3-662-44584-6_15},
}
[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. 
@inproceedings{concur2009-ORW,
  author =              {Ouaknine, Jo{\"e}l and Rabinovich, Alexander and
                         Worrell, James},
  title =               {Time-Bounded Verification},
  editor =              {Bravetti, Mario and Zavattaro, Gianluigi},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'09)},
  acronym =             {{CONCUR}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5710},
  pages =               {496-510},
  year =                {2009},
  month =               sep,
}
[Osb04] Martin J. Osborne. An Introduction to Game Theory. Oxford University Press, 2004. 
@book{igt-Osb04,
  author =              {Osborne, Martin J.},
  title =               {An~Introduction to Game Theory},
  publisher =           {Oxford University Press},
  year =                {2004},
}
[Ost92] Jonathan S. Ostroff. Formal methods for the specification and design of real-time safety critical systems. Journal of Systems and Software 18(1):33-60. Elsevier, April 1992. 
@article{jss18(1)-Ost,
  author =              {Ostroff, Jonathan S.},
  title =               {Formal methods for the specification and design of
                         real-time safety critical systems},
  publisher =           {Elsevier},
  journal =             {Journal of Systems and Software},
  volume =              {18},
  number =              {1},
  pages =               {33-60},
  year =                {1992},
  month =               apr,
  doi =                 {10.1016/0164-1212(92)90045-L},
}
[OW02] Joël Ouaknine and James Worrell. Timed CSP = Closed Timed Safety Automata. In EXPRESS'02, Electronic Notes in Theoretical Computer Science 68(2), pages 145-162. Elsevier, August 2002. 
@inproceedings{express2002-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {Timed {CSP} = Closed Timed Safety Automata},
  editor =              {Nestmann, Uwe and Panangaden, Prakash},
  booktitle =           {{P}roceedings of the 9th {I}nternational {W}orkshop
                         on {E}xpressiveness in {C}oncurrency ({EXPRESS}'02)},
  acronym =             {{EXPRESS}'02},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {68},
  number =              {2},
  pages =               {145-162},
  year =                {2002},
  month =               aug,
}
[OW03] Joël Ouaknine and James Worrell. Revisiting Digitization, Robustness, and Decidability for Timed Automata. In LICS'03, pages 198-207. IEEE Comp. Soc. Press, June 2003. 
@inproceedings{lics2003-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {Revisiting Digitization, Robustness, and
                         Decidability for Timed Automata},
  booktitle =           {{P}roceedings of the 18th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'03)},
  acronym =             {{LICS}'03},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {198-207},
  year =                {2003},
  month =               jun,
}
[OW04] Joël Ouaknine and James Worrell. On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. In LICS'04, pages 54-63. IEEE Comp. Soc. Press, July 2004. 
@inproceedings{lics2004-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {On the Language Inclusion Problem for Timed
                         Automata: {C}losing a Decidability Gap},
  booktitle =           {{P}roceedings of the 19th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'04)},
  acronym =             {{LICS}'04},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {54-63},
  year =                {2004},
  month =               jul,
}
[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,
}
[OW06] Joël Ouaknine and James Worrell. Safety Metric Temporal Logic is Fully Decidable. In TACAS'06, Lecture Notes in Computer Science 3920, pages 411-425. Springer-Verlag, March 2006. 
@inproceedings{tacas2006-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {Safety Metric Temporal Logic is Fully Decidable},
  editor =              {Hermanns, Holger and Palsberg, Jens},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'06)},
  acronym =             {{TACAS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3920},
  pages =               {411-425},
  year =                {2006},
  month =               mar,
}
[OW06] Joël Ouaknine and James Worrell. On Metric Temporal Logic and Faulty Turing Machines. In FoSSaCS'06, Lecture Notes in Computer Science 3921, pages 217-230. Springer-Verlag, March 2006. 
@inproceedings{fossacs2006-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {On Metric Temporal Logic and Faulty {T}uring
                         Machines},
  editor =              {Aceto, Luca and Ing{\'o}lfsd{\'o}ttir, Anna},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'06)},
  acronym =             {{FoSSaCS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3921},
  pages =               {217-230},
  year =                {2006},
  month =               mar,
}
[OW07] Joël Ouaknine and James Worrell. On the Decidability and Complexity of Metric Temporal Logic over Finite Words. Logical Methods in Computer Science 3(1). March 2007. 
@article{lmcs3(1)-OW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {On the Decidability and Complexity of Metric
                         Temporal Logic over Finite Words},
  journal =             {Logical Methods in Computer Science},
  volume =              {3},
  number =              {1},
  year =                {2007},
  month =               mar,
  doi =                 {10.2168/LMCS-3(1:8)2007},
}
[OW10] Joël Ouaknine and James Worrell. Towards a theory of time-bounded verification. In ICALP'10, Lecture Notes in Computer Science 6199, pages 22-37. Springer-Verlag, July 2010. 
@inproceedings{icalp2010-ORW,
  author =              {Ouaknine, Jo{\"e}l and Worrell, James},
  title =               {Towards a theory of time-bounded verification},
  editor =              {Abramsky, Samson and Gavoille, Cyril and Kirchner,
                         Claude and Meyer auf der Heide, Friedhelm and
                         Spirakis, Paul G.},
  booktitle =           {{P}roceedings of the 37th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'10)~-- Part~{II}},
  acronym =             {{ICALP}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6199},
  pages =               {22-37},
  year =                {2010},
  month =               jul,
}
List of authors