License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2016.3
URN: urn:nbn:de:0030-drops-65090
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6509/
Go to the corresponding LIPIcs Volume Portal

Bouyer-Decitre, Patricia

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

pdf-format:
LIPIcs-MFCS-2016-3.pdf (0.3 MB)

Abstract

This is an overview of the invited talk delivered at the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS-2016).

BibTeX - Entry

@InProceedings{bouyerdecitre:LIPIcs:2016:6509,
  author =	{Patricia Bouyer-Decitre},
  title =	{{Optimal Reachability in Weighted Timed Automata and Games (Invited Talk)}},
  booktitle =	{41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
  pages =	{3:1--3:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-016-3},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{58},
  editor =	{Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6509},
  URN =		{urn:nbn:de:0030-drops-65090},
  doi =		{10.4230/LIPIcs.MFCS.2016.3},
  annote =	{Keywords: timed automata, model-checking, optimization}
}

Keywords: timed automata, model-checking, optimization
Collection: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Issue Date: 2016
Date of publication: 19.08.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI