Symbolic Optimal Reachability in Weighted Timed Automata

Patricia Bouyer, Maximilien Colange, Nicolas Markey. Symbolic Optimal Reachability in Weighted Timed Automata. In Swarat Chaudhuri, Azadeh Farzan, editors, Computer Aided Verification - 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I. Volume 9779 of Lecture Notes in Computer Science, pages 513-530, Springer, 2016. [doi]

@inproceedings{BouyerCM16,
  title = {Symbolic Optimal Reachability in Weighted Timed Automata},
  author = {Patricia Bouyer and Maximilien Colange and Nicolas Markey},
  year = {2016},
  doi = {10.1007/978-3-319-41528-4_28},
  url = {http://dx.doi.org/10.1007/978-3-319-41528-4_28},
  researchr = {https://researchr.org/publication/BouyerCM16},
  cites = {0},
  citedby = {0},
  pages = {513-530},
  booktitle = {Computer Aided Verification - 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I},
  editor = {Swarat Chaudhuri and Azadeh Farzan},
  volume = {9779},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-41527-7},
}