Characteristic formulae for timed automata
Luca Aceto; Anna Ingólfsdóttir; Mikkel Lykke Pedersen; Jan Poulsen — 2000
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Characteristic formulae for timed automata
Characteristic Formulae for Timed Automata
This paper offers characteristic formula constructions in the real-time logic for several behavioural relations between (states of) timed automata. The behavioural relations studied in this work are timed (bi)similarity, timed ready simulation, faster-than bisimilarity and timed trace inclusion. The characteristic formulae delivered by our constructions have size which is linear in that of the timed automaton they logically describe. This also applies to the characteristic formula for...
Page 1