F
[FJ13] John Fearnley et Marcin Jurdziński. Reachability in two-clock timed automata is PSPACE-complete. In ICALP'13, Lecture Notes in Computer Science 7966, pages 212-223. Springer-Verlag, juillet 2013. 
@inproceedings{icalp2013-FJ,
  author =              {Fearnley, John and Jurdzi{\'n}ski, Marcin},
  title =               {Reachability in two-clock timed automata is
                         {PSPACE}-complete},
  editor =              {Fomin, Fedor V. and Freivalds, Rusins and
                         Kwiatkowska, Marta and Peleg, David},
  booktitle =           {{P}roceedings of the 40th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'13)~-- Part~{II}},
  acronym =             {{ICALP}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7966},
  pages =               {212-223},
  year =                {2013},
  month =               jul,
  doi =                 {10.1007/978-3-642-39212-2_21},
}
Liste des auteurs