T
[TA99] Stavros Tripakis and Karine Altisen. On-the-Fly Controller Synthesis for Discrete and Dense-Time Systems. In FM'99, Lecture Notes in Computer Science 1708, pages 233-252. Springer-Verlag, September 1999. 
@inproceedings{fm1999-TA,
  author =              {Tripakis, Stavros and Altisen, Karine},
  title =               {On-the-Fly Controller Synthesis for Discrete and
                         Dense-Time Systems},
  editor =              {Wing, Jeannette M. and Woodcock, Jim and Davies,
                         Jim},
  booktitle =           {{P}roceedings of the {W}orld {C}ongress on {F}ormal
                         {M}ethods ({FM}'99)},
  acronym =             {{FM}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1708},
  pages =               {233-252},
  year =                {1999},
  month =               sep,
}
[Tak97] Masayuki Takeda. Pattern Maching Machine for Text Compressed Using Finite State Model. Technical Report DOI-TR-142, Dept. of Informatics, Kyushu University, Fukuoka, Japan, October 1997. 
@techreport{DOI-TR-142,
  author =              {Takeda, Masayuki},
  title =               {Pattern Maching Machine for Text Compressed Using
                         Finite State Model},
  number =              {DOI-TR-142},
  year =                {1997},
  month =               oct,
  institution =         {Dept. of Informatics, Kyushu University, Fukuoka,
                         Japan},
  type =                {Technical Report},
}
[TAK+96] Serdar Taşiran, Rajeev Alur, Robert P. Kurshan, and Robert K. Brayton. Verifying Abstractions of Timed Systems. In CONCUR'96, Lecture Notes in Computer Science 1119, pages 546-562. Springer-Verlag, August 1996. 
@inproceedings{concur1996-TAKB,
  author =              {Ta{\c s}iran, Serdar and Alur, Rajeev and Kurshan,
                         Robert P. and Brayton, Robert K.},
  title =               {Verifying Abstractions of Timed Systems},
  editor =              {Montanari, Ugo and Sassone, Vladimiro},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'96)},
  acronym =             {{CONCUR}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1119},
  pages =               {546-562},
  year =                {1996},
  month =               aug,
}
[Tan01] Till Tantau. A Note on the Complexity of the Reachability Problem for Tournaments. Research Report 01-092, Electronic Colloquium on Computational Complexity, 2001. 
@techreport{eccc2001-Tan,
  author =              {Tantau, Till},
  title =               {A Note on the Complexity of the Reachability Problem
                         for Tournaments},
  number =              {01-092},
  year =                {2001},
  institution =         {Electronic Colloquium on Computational Complexity},
  type =                {Research Report},
}
[Tan02] Till Tantau. Comparing Verboseness for Finite Automata and Turing Machines. In STACS'02, Lecture Notes in Computer Science 2285, pages 465-476. Springer-Verlag, March 2002. 
@inproceedings{stacs2002-Tan,
  author =              {Tantau, Till},
  title =               {Comparing Verboseness for Finite Automata and Turing
                         Machines},
  editor =              {Alt, Helmut and Ferreira, Afonso},
  booktitle =           {{P}roceedings of the 19th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'02)},
  acronym =             {{STACS}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2285},
  pages =               {465-476},
  year =                {2002},
  month =               mar,
}
[Tar55] Alfred Tarski. A Lattice-Theoretical Fixpoint Theorem and its Applications. Pacific Journal of Mathematics 5(2):285-309. 1955. 
@article{pjm5(2)-Tar,
  author =              {Tarski, Alfred},
  title =               {A Lattice-Theoretical Fixpoint Theorem and its
                         Applications},
  journal =             {Pacific Journal of Mathematics},
  volume =              {5},
  number =              {2},
  pages =               {285-309},
  year =                {1955},
}
[Tar72] Robert Endre Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2):146-160. Society for Industrial and Applied Math., June 1972. 
@article{siamcomp1(2)-Tar,
  author =              {Tarjan, Robert Endre},
  title =               {Depth-first search and linear graph algorithms},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {1},
  number =              {2},
  pages =               {146-160},
  year =                {1972},
  month =               jun,
}
[Tar83] Robert Endre Tarjan. Data structures and network algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics 44. Society for Industrial and Applied Math., 1983. 
@book{Tar83-DSNA,
  author =              {Tarjan, Robert Endre},
  title =               {Data structures and network algorithms},
  publisher =           {Society for Industrial and Applied Math.},
  series =              {CBMS-NSF Regional Conference Series in Applied
                         Mathematics},
  volume =              {44},
  year =                {1983},
}
[Tau03] Heikko Tauriainen. On Translating Linear Temporal Logic into Alternating and Nondeterministic Automata. Licentiate thesis, Helsinki University of Technology, Finland, 2003. 
@mastersthesis{licentiate-tauriainen,
  author =              {Tauriainen, Heikko},
  title =               {On Translating Linear Temporal Logic into
                         Alternating and Nondeterministic Automata},
  year =                {2003},
  school =              {Helsinki University of Technology, Finland},
  type =                {Licentiate thesis},
}
[Tau06] Heikko Tauriainen. Automata and Linear Temporal Logic: Translations with Transition-based Acceptance. Technical Report HUT-TCS-A104, Helsinki University of Technology, Finland, 2006. 
@techreport{hut-tcs-a104-Tau,
  author =              {Tauriainen, Heikko},
  title =               {Automata and Linear Temporal Logic: Translations
                         with Transition-based Acceptance},
  number =              {HUT-TCS-A104},
  year =                {2006},
  institution =         {Helsinki University of Technology, Finland},
}
[TD98] Josef Tapken and Henning Dierks. MOBY/PLC – Graphical Development of PLC-Automata. In FTRTFT'98, Lecture Notes in Computer Science 1486, pages 311-314. Springer-Verlag, September 1998. 
@inproceedings{ftrtft1998-TD,
  author =              {Tapken, Josef and Dierks, Henning},
  title =               {{MOBY/PLC}~-- Graphical Development of
                         {PLC}-Automata},
  editor =              {Ravn, Anders P. and Rischel, Hans},
  booktitle =           {{P}roceedings of the 5th {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'98)},
  acronym =             {{FTRTFT}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1486},
  pages =               {311-314},
  year =                {1998},
  month =               sep,
}
[TD09] Cong Tian and Zhenhua Duan. A Note on Stutter-Invariant PLTL. Information Processing Letters 109(13):663-667. Elsevier, June 2009. 
@article{ipl109(13)-TD,
  author =              {Tian, Cong and Duan, Zhenhua},
  title =               {A~Note on Stutter-Invariant {PLTL}},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {109},
  number =              {13},
  pages =               {663-667},
  year =                {2009},
  month =               jun,
}
[TvE+87] Leen Torenvliet and Peter van Emde Boas. A Note on Time and Space. In CSN'87. SION, November 1987. 
@inproceedings{csn1987-TE,
  author =              {Torenvliet, Leen and van Emde Boas, Peter},
  title =               {A Note on Time and Space},
  booktitle =           {{P}roceedings of the 1st {C}onference on {C}omputing
                         {S}cience in the {N}etherlands ({CSN}'87)},
  acronym =             {{CSN}'87},
  publisher =           {SION},
  year =                {1987},
  month =               nov,
}
[TFL10] Claus Thrane, Uli Fahrenberg, and Kim Guldstrand Larsen. Quantitative Analysis of Weighted Transition Systems. Journal of Logic and Algebraic Programming 79(7):689-703. Elsevier, October 2010. 
@article{jlap79(7)-TFL,
  author =              {Thrane, Claus and Fahrenberg, Uli and Larsen, Kim
                         Guldstrand},
  title =               {Quantitative Analysis of Weighted Transition
                         Systems},
  publisher =           {Elsevier},
  journal =             {Journal of Logic and Algebraic Programming},
  volume =              {79},
  number =              {7},
  pages =               {689-703},
  year =                {2010},
  month =               oct,
}
[TH00] Heikko Tauriainen and Keijo Heljanko. Testing SPIN's LTL Formula Conversion into Büchi Automata with Randomly Generated Input. In SPIN'00, Lecture Notes in Computer Science 1885, pages 54-72. Springer-Verlag, August 2000. 
@inproceedings{spin2000-TH,
  author =              {Tauriainen, Heikko and Heljanko, Keijo},
  title =               {Testing {SPIN}'s {LTL} Formula Conversion into
                         {B}{\"u}chi Automata with Randomly Generated Input},
  editor =              {Havelund, Klaus and Penix, John and Viser, Willem},
  booktitle =           {{P}roceedings of the 7th {I}nternational {SPIN}
                         {W}orkshop ({SPIN}'00)},
  acronym =             {{SPIN}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1885},
  pages =               {54-72},
  year =                {2000},
  month =               aug,
}
[THH+12] Takashi Tomita, Shin Hiura, Shigeki Hagihara, and Naoki Yonezaki. A Temporal Logic with Mean-Payoff Constraints. In ICFEM'12, Lecture Notes in Computer Science 7635, pages 249-265. Springer-Verlag, November 2012. 
@inproceedings{icfem2012-THHY,
  author =              {Tomita, Takashi and Hiura, Shin and Hagihara,
                         Shigeki and Yonezaki, Naoki},
  title =               {A~Temporal Logic with Mean-Payoff Constraints},
  editor =              {Aoki, Toshiaki and Taguchi, Kenji},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {F}ormal {E}ngineering {M}ethods
                         ({ICFEM}'12)},
  acronym =             {{ICFEM}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7635},
  pages =               {249-265},
  year =                {2012},
  month =               nov,
  doi =                 {10.1007/978-3-642-34281-3_19},
}
[Thi15] Yann Thierry-Mieg. Symbolic Model-Checking Using ITS-Tools. In TACAS'15, Lecture Notes in Computer Science 9035, pages 231-237. Springer-Verlag, April 2015. 
@inproceedings{tacas2015-Thi,
  author =              {Thierry{-}Mieg, Yann},
  title =               {Symbolic Model-Checking Using {ITS}-Tools},
  editor =              {Baier, {\relax Ch}ristel and Tinelli, Cesare},
  booktitle =           {{P}roceedings of the 21st {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'15)},
  acronym =             {{TACAS}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9035},
  pages =               {231-237},
  year =                {2015},
  month =               apr,
  doi =                 {10.1007/978-3-662-46681-0_20},
}
[Tho88] Wolfgang Thomas. Automata on Infinite Objects. Technical Report AIB-88-17, Aachener Informatik Berichte, Aachen, Germany, October 1988. 
@techreport{AIB-8817-Tho,
  author =              {Thomas, Wolfgang},
  title =               {Automata on Infinite Objects},
  number =              {AIB-88-17},
  year =                {1988},
  month =               oct,
  institution =         {Aachener Informatik Berichte, Aachen, Germany},
  type =                {Technical Report},
}
[Tho90] Wolfgang Thomas. Automata on Infinite Objects. In Jan van Leeuwen (eds.), Handbook of Theoretical Computer Science. Elsevier, 1990. 
@incollection{HBTCS2-Tho,
  author =              {Thomas, Wolfgang},
  title =               {Automata on Infinite Objects},
  editor =              {van Leeuwen, Jan},
  booktitle =           {Handbook of Theoretical Computer Science},
  publisher =           {Elsevier},
  volume =              {B},
  pages =               {133-191},
  year =                {1990},
  doi =                 {10.1016/b978-0-444-88074-1.50009-3},
}
[Tho91] Wolfgang Thomas. On Logics, Tilings, and Automata. In ICALP'91, Lecture Notes in Computer Science 510, pages 441-454. Springer-Verlag, July 1991. 
@inproceedings{icalp1991-Tho,
  author =              {Thomas, Wolfgang},
  title =               {On Logics, Tilings, and Automata},
  editor =              {Albert, Javier Leach and Monien, Burkhard and
                         Rodr{\'\i}guez{-}Artalejo, Mario},
  booktitle =           {{P}roceedings of the 19th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'91)},
  acronym =             {{ICALP}'91},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {510},
  pages =               {441-454},
  year =                {1991},
  month =               jul,
}
[Tho95] Wolfgang Thomas. On the Synthesis of Strategies in Infinite Games. In STACS'95, Lecture Notes in Computer Science 900, pages 1-13. Springer-Verlag, March 1995. 
@inproceedings{stacs1995-Tho,
  author =              {Thomas, Wolfgang},
  title =               {On the Synthesis of Strategies in Infinite Games},
  editor =              {Mayr, Ernst W. and Puech, Claude},
  booktitle =           {{P}roceedings of the 12th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'95)},
  acronym =             {{STACS}'95},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {900},
  pages =               {1-13},
  year =                {1995},
  month =               mar,
}
[Tho96] Wolfgang Thomas. Languages, Automata and Logics. Technical Report 9607, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität, Kiel, Germany, May 1996. 
@techreport{TR-9607-Tho,
  author =              {Thomas, Wolfgang},
  title =               {Languages, Automata and Logics},
  number =              {9607},
  year =                {1996},
  month =               may,
  institution =         {Institut f{\"u}r Informatik und Praktische
                         Mathematik, Christian-Albrechts-Universit{\"a}t,
                         Kiel, Germany},
  type =                {Technical Report},
}
[Tho97] Wolfgang Thomas. Automata Theory on Tress and Partial Orders. In TAPSOFT'97, Lecture Notes in Computer Science 1214, pages 20-38. Springer-Verlag, April 1997. 
@inproceedings{tapsoft1997-Tho,
  author =              {Thomas, Wolfgang},
  title =               {Automata Theory on Tress and Partial Orders},
  editor =              {Bidoit, Michel and Dauchet, Max},
  booktitle =           {{P}roceedings of the 7th {I}nternational {J}oint
                         {C}onference {CAAP}{\slash}{FASE} on {T}heory and
                         {P}ractice of {S}oftware {D}evelopment
                         ({TAPSOFT}'97)},
  acronym =             {{TAPSOFT}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1214},
  pages =               {20-38},
  year =                {1997},
  month =               apr,
}
[Tho97] Wolfgang Thomas. Languages, Automata and Logics. In Grzegorz Rozenberg and Arto Salomaa (eds.), Handbook of Formal Languages. Springer-Verlag, 1997. 
@incollection{HFL1997(3)-Tho,
  author =              {Thomas, Wolfgang},
  title =               {Languages, Automata and Logics},
  editor =              {Rozenberg, Grzegorz and Salomaa, Arto},
  booktitle =           {Handbook of Formal Languages},
  publisher =           {Springer-Verlag},
  volume =              {3},
  pages =               {389-455},
  year =                {1997},
}
[Tho02] Wolfgang Thomas. Infinite Games and Verification (Extended Abstract of a Tutoral). In CAV'02, Lecture Notes in Computer Science 2404, pages 58-64. Springer-Verlag, July 2002. 
@inproceedings{cav2002-Tho,
  author =              {Thomas, Wolfgang},
  title =               {Infinite Games and Verification (Extended Abstract
                         of a Tutoral)},
  editor =              {Brinksma, Ed and Larsen, Kim Guldstrand},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'02)},
  acronym =             {{CAV}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2404},
  pages =               {58-64},
  year =                {2002},
  month =               jul,
}
[TM17] Tamás Tóth and István Majzik. Lazy reachability checking for timed automata using interpolants. In FORMATS'17, Lecture Notes in Computer Science 10419, pages 264-280. Springer-Verlag, September 2017. 
@inproceedings{formats2017-TM,
  author =              {T{\'o}th, Tam{\'a}s and Majzik, Istv{\'a}n},
  title =               {Lazy reachability checking for timed automata using
                         interpolants},
  editor =              {Abate, Alessandro and Geeraerts, Gilles},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'17)},
  acronym =             {{FORMATS}'17},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10419},
  pages =               {264-280},
  year =                {2017},
  month =               sep,
  doi =                 {10.1007/978-3-319-65765-3_15},
}
[Too63] Andrei L. Toom. The complexity of a scheme of functional elements realizing the multiplication of integers. Doklady Akademii Nauk SSSR 150(3):496-498. Russian Academy of Sciences, 1963. 
@article{danSSSR150(3)-Too,
  author =              {Toom, Andrei L.},
  title =               {The complexity of a scheme of functional elements
                         realizing the multiplication of integers},
  publisher =           {Russian Academy of Sciences},
  journal =             {Doklady Akademii Nauk SSSR},
  volume =              {150},
  number =              {3},
  pages =               {496-498},
  year =                {1963},
}
[TR04] Prasanna Thati and Grigore Roşu. Monitoring Algorithms for Metric Temporal Logic Specifications. In RV'04, Electronic Notes in Theoretical Computer Science 113, pages 131-147. Elsevier, April 2004. 
@inproceedings{rv2004-TR,
  author =              {Thati, Prasanna and Ro{\c{s}}u, Grigore},
  title =               {Monitoring Algorithms for Metric Temporal Logic
                         Specifications},
  editor =              {Havelund, Klaus and Ro{\c{s}}u, Grigore},
  booktitle =           {{P}roceedings of the 4th {I}nternational {W}orkshop
                         on {R}untime {V}erification ({RV}'04)},
  acronym =             {{RV}'04},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {113},
  pages =               {131-147},
  year =                {2004},
  month =               apr,
  doi =                 {10.1016/j.entcs.2004.12.01},
}
[Tra62] Boris A. Trakhtenbrot. Finite automata and the logic of one-place predicates. Siberskii Matematicheskii Zhurnal 3(1):103-131. Sobolev Institute of Mathematics, 1962. 
@article{smj3(1)-Tra,
  author =              {Trakhtenbrot, Boris A.},
  title =               {Finite automata and the logic of one-place
                         predicates},
  publisher =           {Sobolev Institute of Mathematics},
  journal =             {Siberskii Matematicheskii Zhurnal},
  volume =              {3},
  number =              {1},
  pages =               {103-131},
  year =                {1962},
}
[Tre96] Jan Tretmans. Test Generation with Inputs, Outputs, and Quiescence. In TACAS'96, Lecture Notes in Computer Science 1055, pages 127-146. Springer-Verlag, March 1996. 
@inproceedings{tacas1996-Tre,
  author =              {Tretmans, Jan},
  title =               {Test Generation with Inputs, Outputs, and
                         Quiescence},
  editor =              {Margaria, Tiziana and Steffen, Bernhard},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {W}orkshop
                         on {T}ools and {A}lgorithms for {C}onstruction and
                         {A}nalysis of {S}ystems ({TACAS}'96)},
  acronym =             {{TACAS}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1055},
  pages =               {127-146},
  year =                {1996},
  month =               mar,
  doi =                 {10.1007/3-540-61042-1_42},
}
[Tre96] Jan Tretmans. Conformance Testing with Labelled Transition Systems: Implementation Relations and Test Generation. Computer Networks and ISDN Systems 29(1):49-79. Elsevier, 1996. 
@article{cnISDNs29(1)-Tre,
  author =              {Tretmans, Jan},
  title =               {Conformance Testing with Labelled Transition
                         Systems: Implementation Relations and Test
                         Generation},
  publisher =           {Elsevier},
  journal =             {Computer Networks and {ISDN} Systems},
  volume =              {29},
  number =              {1},
  pages =               {49-79},
  year =                {1996},
  doi =                 {10.1016/S0169-7552(96)00017-7},
}
[Tri99] Stavros Tripakis. Timed Diagnostics for Reachability Properties. In TACAS'99, Lecture Notes in Computer Science 1579, pages 59-73. Springer-Verlag, March 1999. 
@inproceedings{tacas1999-Tri,
  author =              {Tripakis, Stavros},
  title =               {Timed Diagnostics for Reachability Properties},
  editor =              {Cleaveland, Rance},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'99)},
  acronym =             {{TACAS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1579},
  pages =               {59-73},
  year =                {1999},
  month =               mar,
}
[Tri02] Stavros Tripakis. Description and Schedulability Analysis of the Software Architecture of an Automated Vehicle Control System. In EMSOFT'02, Lecture Notes in Computer Science 2491, pages 123-137. Springer-Verlag, October 2002. 
@inproceedings{emsoft2002-Tri,
  author =              {Tripakis, Stavros},
  title =               {Description and Schedulability Analysis of the
                         Software Architecture of an Automated Vehicle
                         Control System},
  editor =              {Sangiovani{-}Vincentelli, Alberto L. and Sifakis,
                         Joseph},
  booktitle =           {{P}roceedings of the 2nd {I}nternational
                         {C}onference on {E}mbedded {S}oftware ({EMSOFT}'02)},
  acronym =             {{EMSOFT}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2491},
  pages =               {123-137},
  year =                {2002},
  month =               oct,
}
[Tri06] Stavros Tripakis. Folk theorems on the determinization and minimization of timed automata. Information Processing Letters 99(6):222-226. Elsevier, September 2006. 
@article{ipl99(6)-Tri,
  author =              {Tripakis, Stavros},
  title =               {Folk theorems on the determinization and
                         minimization of timed automata},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {99},
  number =              {6},
  pages =               {222-226},
  year =                {2006},
  month =               sep,
  doi =                 {10.1016/j.ipl.2006.04.015},
}
[Tri09] Stavros Tripakis. Checking Timed Büchi Automata Emptiness on Simulation Graphs. ACM Transactions on Computational Logic 10(3). ACM Press, April 2009. 
@article{tocl10(3)-Tri,
  author =              {Tripakis, Stavros},
  title =               {Checking Timed B{\"{u}}chi Automata Emptiness on
                         Simulation Graphs},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computational Logic},
  volume =              {10},
  number =              {3},
  year =                {2009},
  month =               apr,
  doi =                 {10.1145/1507244.1507245},
}
[Tsa03] Boaz Tsaban. Bernoulli Numbers and the Probability of a Birthday Surprise. Discrete Applied Mathematics 127(1):657-663. Elsevier, April 2003. 
@article{dam127(1)-Tsa,
  author =              {Tsaban, Boaz},
  title =               {{B}ernoulli Numbers and the Probability of a
                         Birthday Surprise},
  publisher =           {Elsevier},
  journal =             {Discrete Applied Mathematics},
  volume =              {127},
  number =              {1},
  pages =               {657-663},
  year =                {2003},
  month =               apr,
}
[Tur37] Alan M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society s2-42(1):230-265. 1937. 
@article{plms-s2-42(1)-Tur,
  author =              {Turing, Alan M.},
  title =               {On~computable numbers, with an application to the
                         {\emph{Entscheidungsproblem}}},
  journal =             {Proceedings of the London Mathematical Society},
  volume =              {s2-42},
  number =              {1},
  pages =               {230-265},
  year =                {1937},
  doi =                 {10.1112/plms/s2-42.1.230},
}
[Tur38] Alan M. Turing. On computable numbers, with an application to the Entscheidungsproblem. A Correction. Proceedings of the London Mathematical Society s2-43(6):544-546. 1938. 
@article{plms-s2-43(6)-Tur,
  author =              {Turing, Alan M.},
  title =               {On~computable numbers, with an application to the
                         {\emph{Entscheidungsproblem}}. A~Correction},
  journal =             {Proceedings of the London Mathematical Society},
  volume =              {s2-43},
  number =              {6},
  pages =               {544-546},
  year =                {1938},
  doi =                 {10.1112/plms/s2-43.6.544},
}
[TV87] Frank Thuijsman and Okko J. Vrieze. The bad match; A total reward stochastic game. OR Spektrum 9(2):93-99. 1987. 
@article{ORspectrum9(2)-TV,
  author =              {Thuijsman, Frank and Vrieze, Okko J.},
  title =               {The bad match; A~total reward stochastic game},
  journal =             {OR Spektrum},
  volume =              {9},
  number =              {2},
  pages =               {93-99},
  year =                {1987},
  doi =                 {10.1007/BF01732644},
}
[TW96] Denis Thérien and Thomas Wilke. Temporal Logic and Semidirect Products: an Effective Characterization of the Until Hierarchy. In FOCS'96, pages 256-263. IEEE Comp. Soc. Press, October 1996. 
@inproceedings{focs1996-TW,
  author =              {Th{\'e}rien, Denis and Wilke, Thomas},
  title =               {Temporal Logic and Semidirect Products: an Effective
                         Characterization of the Until Hierarchy},
  booktitle =           {{P}roceedings of the 37th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'96)},
  acronym =             {{FOCS}'96},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {256-263},
  year =                {1996},
  month =               oct,
}
[TW98] Denis Thérien and Thomas Wilke. Over Words, Two Variables Are as Powerful as One Quantifier Alternation: FO2 = Σ2 ∩Π2. In STOC'98, pages 234-240. ACM Press, May 1998. 
@inproceedings{stoc1998-TW,
  author =              {Th{\'e}rien, Denis and Wilke, Thomas},
  title =               {Over Words, Two Variables Are as Powerful as One
                         Quantifier Alternation: {\(\textup{FO}^2 = \Sigma_2
                         \cap \Pi_2\)}},
  booktitle =           {{P}roceedings of the 30th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'98)},
  acronym =             {{STOC}'98},
  publisher =           {ACM Press},
  pages =               {234-240},
  year =                {1998},
  month =               may,
}
[TW02] Denis Thérien and Thomas Wilke. Nesting Until and Since in Linear Temporal Logic. In STACS'02, Lecture Notes in Computer Science 2285, pages 455-464. Springer-Verlag, March 2002. 
@inproceedings{stacs2002-TW,
  author =              {Th{\'e}rien, Denis and Wilke, Thomas},
  title =               {Nesting Until and Since in Linear Temporal Logic},
  editor =              {Alt, Helmut and Ferreira, Afonso},
  booktitle =           {{P}roceedings of the 19th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'02)},
  acronym =             {{STACS}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2285},
  pages =               {455-464},
  year =                {2002},
  month =               mar,
}
[TW02] P. S. Thiagarajan and Igor Walukiewicz. An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. Information and Computation 179(2):230-249. Academic Press, December 2002. 
@article{icomp179(2)-TW,
  author =              {Thiagarajan, P. S. and Walukiewicz, Igor},
  title =               {An Expressively Complete Linear Time Temporal Logic
                         for {M}azurkiewicz Traces},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {179},
  number =              {2},
  pages =               {230-249},
  year =                {2002},
  month =               dec,
}
[TW12] Nicolas Troquard and Dirk Walther. On Satisfiability in ATL with Strategy Contexts. In JELIA'12, Lecture Notes in Computer Science 7519, pages 398-410. Springer-Verlag, September 2012. 
@inproceedings{jelia2012-TW,
  author =              {Troquard, Nicolas and Walther, Dirk},
  title =               {On Satisfiability in {ATL} with Strategy Contexts},
  editor =              {Fari{\~n}as{ }del{ }Cerro, Luis and Herzig, Andreas
                         and Mengin, J{\'e}r{\^o}me},
  booktitle =           {{P}roceedings of the 13th {E}uropean {C}onference in
                         {L}ogics in {A}rtificial {I}ntelligence
                         ({JELIA}'12)},
  acronym =             {{JELIA}'12},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7519},
  pages =               {398-410},
  year =                {2012},
  month =               sep,
  doi =                 {10.1007/978-3-642-33353-8_31},
}
[TY01] Stavros Tripakis and Sergio Yovine. Timing Analysis and Code Generation of Vehicle Control Software using Taxys. In RV'01, Electronic Notes in Theoretical Computer Science 55(2), pages 277-286. Elsevier, July 2001. 
@inproceedings{rv2001-TY,
  author =              {Tripakis, Stavros and Yovine, Sergio},
  title =               {Timing Analysis and Code Generation of Vehicle
                         Control Software using {T}axys},
  editor =              {Havelund, Klaus and Ro{\c{s}}u, Grigore},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {R}untime {V}erification ({RV}'01)},
  acronym =             {{RV}'01},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {55},
  number =              {2},
  pages =               {277-286},
  year =                {2001},
  month =               jul,
}
[TY01] Stavros Tripakis and Sergio Yovine. Analysis of Timed Systems Using Time-Abstracting Bisimulations. Formal Methods in System Design 18(1):25-68. Kluwer Academic, January 2001. 
@article{fmsd18(1)-TY,
  author =              {Tripakis, Stavros and Yovine, Sergio},
  title =               {Analysis of Timed Systems Using Time-Abstracting
                         Bisimulations},
  publisher =           {Kluwer Academic},
  journal =             {Formal Methods in System Design},
  volume =              {18},
  number =              {1},
  pages =               {25-68},
  year =                {2001},
  month =               jan,
  doi =                 {10.1023/A:1008734703554},
}
[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},
}
List of authors