Document Open Access Logo

Optimal Reachability in Weighted Timed Automata and Games (Invited Talk)

Author Patricia Bouyer-Decitre

PDF
Thumbnail PDF

File

LIPIcs.MFCS.2016.3.pdf
  • Filesize: 308 kB
  • 3 pages

Document Identifiers

Author Details

Patricia Bouyer-Decitre

Cite AsGet BibTex

Patricia Bouyer-Decitre. Optimal Reachability in Weighted Timed Automata and Games (Invited Talk). In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 3:1-3:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.MFCS.2016.3

Abstract

This is an overview of the invited talk delivered at the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS-2016).
Keywords
  • timed automata
  • model-checking
  • optimization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Rajeev Alur, Mikhail Bernadsky, and P. Madhusudan. Optimal reachability in weighted timed games. In Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP'04), volume 3142 of LNCS, pages 122-133. Springer, 2004. Google Scholar
  2. Rajeev Alur and David L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994. Google Scholar
  3. Rajeev Alur, Salvatore La Torre, and George J. Pappas. Optimal paths in weighted timed automata. In Proc. 4th International Workshop on Hybrid Systems: Computation and Control (HSCC'01), volume 2034 of LNCS, pages 49-62. Springer, 2001. Google Scholar
  4. Eugene Asarin, Oded Maler, Amir Pnueli, and Joseph Sifakis. Controller synthesis for timed automata. In Proc. IFAC Symposium on System Structure and Control, pages 469-474. Elsevier Science, 1998. Google Scholar
  5. Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim G. Larsen, Paul Pettersson, Judi Romijn, and Frits Vaandrager. Minimum-cost reachability for priced timed automata. In Proc. 4th International Workshop on Hybrid Systems: Computation and Control (HSCC'01), volume 2034 of LNCS, pages 147-161. Springer, 2001. Google Scholar
  6. Gerd Behrmann, Kim G. Larsen, and Jacob I. Rasmussen. Optimal scheduling using priced timed automata. ACM Sigmetrics Performancs Evaluation Review, 32(4):34-40, 2005. Google Scholar
  7. Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, and Jean-François Raskin. On the optimal reachability problem. Formal Methods in System Design, 31(2):135-175, 2007. Google Scholar
  8. Patricia Bouyer, Thomas Brihaye, and Nicolas Markey. Improved undecidability results on weighted timed automata. Information Processing Letters, 98(5):188-194, 2006. Google Scholar
  9. Patricia Bouyer, Franck Cassez, Emmanuel Fleury, and Kim G. Larsen. Optimal strategies in priced timed game automata. In Proc. 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'04), volume 3328 of LNCS, pages 148-160. Springer, 2004. Google Scholar
  10. Patricia Bouyer, Maximilien Colange, and Nicolas Markey. Symbolic optimal reachability in weighted timed automata. In Proc. 28th International Conference on Computer Aided Verification (CAV'16) - Part I, LNCS. Springer, 2016. To appear. Google Scholar
  11. Patricia Bouyer, Samy Jaziri, and Nicolas Markey. On the value problem in weighted timed games. In Proc. 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of LIPIcs, pages 311-324. Leibniz-Zentrum für Informatik, 2015. Google Scholar
  12. Patricia Bouyer, Nicolas Markey, Nicolas Perrin, and Philipp Schlehuber. Timed automata abstraction of switched dynamical systems using control funnels. In Proc. 13th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'15), volume 9268 of LNCS, pages 60-75. Springer, 2015. Google Scholar
  13. Thomas Brihaye, Véronique Bruyère, and Jean-François Raskin. On optimal timed strategies. In Proc. 3rd International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'05), volume 3821 of LNCS, pages 49-64. Springer, 2005. Google Scholar
  14. Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What’s decidable about hybrid automata? Journal of Computer and System Sciences, 57(1):94-124, 1998. Google Scholar
  15. Salvatore La Torre, Supratik Mukhopadhyay, and Aniello Murano. Optimal-reachability and control for acyclic weighted timed automata. In Proc. 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), volume 223 of IFIP Conference Proceedings, pages 485-497. Kluwer, 2002. Google Scholar
  16. Kim G. Larsen, Gerd Behrmann, Ed Brinksma, Angskar Fehnker, Thomas Hune, Paul Pettersson, and Judi Romijn. As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In Proc. 13th International Conference on Computer Aided Verification (CAV'01), volume 2102 of LNCS, pages 493-505. Springer, 2001. Google Scholar
  17. Jacob I. Rasmussen, Kim G. Larsen, and K. Subramani. On using priced timed automata to achieve optimal scheduling. Formal Methods in System Design, 29(1):97-114, 2006. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact