MSO logics for weighted timed automata
K Quaas - Formal Methods in System Design, 2011 - Springer
K Quaas
Formal Methods in System Design, 2011•SpringerWe 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
transformed into a weighted timed automaton, and vice versa. The results indicate the
robustness of weighted timed automata and may also be used for specification purposes.
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
transformed into a weighted timed automaton, and vice versa. The results indicate the
robustness of weighted timed automata and may also be used for specification purposes.
Abstract
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 transformed into a weighted timed automaton, and vice versa. The results indicate the robustness of weighted timed automata and may also be used for specification purposes.
Springer
Showing the best result for this search. See all results