@InProceedings{   BBBB:ICALP:2009,
  Author        = "Baier, Christel and Bertrand, Nathalie and Bouyer, Patricia and Brihaye, Thomas",
  Editor        = "Albers, Susanne and Marchetti-Spaccamela, Alberto and Matias, Yossi and Nikoletseas, Sotiris and Thomas, Wolfgang",
  Abstract      = "In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boundedness condition, the infinite timed tree can be reduced into a classical deterministic timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be determinizable (event-clock timed automata, automata with integer resets), but some others were not. We prove for instance that strongly non-Zeno timed automata can be determinized. As a corollary of those constructions, we get for those classes the decidability of the universality and of the inclusion problems, and compute their complexities (the inclusion problem is for instance EXPSPACE-complete for strongly non-Zeno timed automata).",
  Address       = "Berlin, Heidelberg",
  BookTitle     = "Proc of ICALP'09",
  date-added    = "2020-01-06 12:28:05 +0100",
  date-modified = "2020-01-06 12:28:35 +0100",
  ISBN          = "978-3-642-02930-1",
  Pages         = "43--54",
  Publisher     = "Springer Berlin Heidelberg",
  Title         = "When Are Timed Automata Determinizable?",
  Year          = "2009",
  File          = "When Are Timed Automata Determinizable - a - t.pdf",
  file-2        = "When are timed automata determinizable - rr-lsv-2009-08 - a - t.pdf",
  file-3        = "When are timed automata determinizable - slides - 2fbae6ebd9186277357051d2f2860e0753c6 - a - t.pdf"
}

@InProceedings{ BBBB:ICALP:2009, Author = "Baier, Christel and Bertrand, Nathalie and Bouyer, Patricia and Brihaye, Thomas", Editor = "Albers, Susanne and Marchetti-Spaccamela, Alberto and Matias, Yossi and Nikoletseas, Sotiris and Thomas, Wolfgang", Abstract = "In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boundedness condition, the infinite timed tree can be reduced into a classical deterministic timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be determinizable (event-clock timed automata, automata with integer resets), but some others were not. We prove for instance that strongly non-Zeno timed automata can be determinized. As a corollary of those constructions, we get for those classes the decidability of the universality and of the inclusion problems, and compute their complexities (the inclusion problem is for instance EXPSPACE-complete for strongly non-Zeno timed automata).", Address = "Berlin, Heidelberg", BookTitle = "Proc of ICALP'09", date-added = "2020-01-06 12:28:05 +0100", date-modified = "2020-01-06 12:28:35 +0100", ISBN = "978-3-642-02930-1", Pages = "43--54", Publisher = "Springer Berlin Heidelberg", Title = "When Are Timed Automata Determinizable?", Year = "2009", File = "When Are Timed Automata Determinizable - a - t.pdf", file-2 = "When are timed automata determinizable - rr-lsv-2009-08 - a - t.pdf", file-3 = "When are timed automata determinizable - slides - 2fbae6ebd9186277357051d2f2860e0753c6 - a - t.pdf" }