On conciseness of extensions of timed automata

  • Authors:
  • Patricia Bouyer;Fabrice Chevalier

  • Affiliations:
  • LSV - CNRS & ENS de Cachan, Cachan, France;LSV - CNRS & ENS de Cachan, Cachan, France

  • Venue:
  • Journal of Automata, Languages and Combinatorics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we study conciseness of various extensions of timed automata, and prove that several features like diagonal constraints or updates lead to exponentially more concise timed models.