A Logical Characterization for Weighted Timed Automata

@inproceedings{Quaas2010ALC,
  title={A Logical Characterization for Weighted Timed Automata},
  author={Karin Quaas},
  year={2010}
}
We aim to generalize Büchi’s fundamental theorem on the coincidence of recognizable and MSO-definable languages to a weighted timed setting. For this, we investigate weighted timed automata and show how we can extend Wilke’s relative distance logic with weights taken from an arbitrary semiring. We show that every formula in our logic can effectively be… CONTINUE READING