Symbolic Optimal Reachability in Weighted Timed Automata

December 12, 2017 in by

by Patricia Bouyer, Maximilien Colange, Nicolas Markey
Reference:
Patricia Bouyer, Maximilien Colange, Nicolas Markey. Symbolic Optimal Reachability in Weighted Timed Automata. In Proceedings of the 28th International Conference on Computer Aided Verification (CAV’16). Lecture Notes in Computer Science. Springer, 2016. (To appear)
Bibtex Entry:
@inproceedings{BCM-cav16,
  author =        {Bouyer, Patricia and Colange, Maximilien and
                   Markey, Nicolas},
  booktitle =     {Proceedings of the 28th International Conference on
                   Computer Aided Verification ({CAV}'16)},
  note =          {To~appear},
  publisher =     {Springer},
  series =        {Lecture Notes in Computer Science},
  title =         {Symbolic Optimal Reachability in Weighted Timed
                   Automata},
  year =          {2016},
  url =           {http://www.cassting-project.eu/wp-content/uploads/
                  BCM-arxiv16.pdf},
  category =      {conf},
  wps =           {wp2},
  partners =      {CNRS},
  casstingpart =  {50},
}