Robust Reachability in Timed Automata and Games: A Game-based Approach

October 16, 2017 in by

by Patricia Bouyer, Nicolas Markey, Ocan Sankur
Reference:
Patricia Bouyer, Nicolas Markey, Ocan Sankur. Robust Reachability in Timed Automata and Games: A Game-based Approach. In Theoretical Computer Science 563:43-74. Elsevier, January 2015.
Bibtex Entry:
@string{jan="January"}
@article{BMS-tcs14,
  author =        {Bouyer, Patricia and Markey, Nicolas and
                   Sankur, Ocan},
  journal =       {Theoretical Computer Science},
  month =         jan,
  pages =         {43-74},
  publisher =     {Elsevier},
  title =         {Robust Reachability in Timed Automata and Games:
                   A~Game-based Approach},
  volume =        {563},
  year =          {2015},
  doi =           {10.1016/j.tcs.2014.08.014},
  url =           {http://www.cassting-project.eu/wp-content/uploads/
                  BMS-tcs14.pdf},
  category =      {jour},
  wps =           {wp3},
  partners =      {CNRS},
  casstingpart =  {25},
}