Characteristic Formulae for Timed Automata

Luca Aceto, Anna Ingólfsdóttir, Mikkel Lykke Pedersen, Jan Poulsen
2000 RAIRO - Theoretical Informatics and Applications  
This paper offers characteristic formula constructions in the realtime logic L ν 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 timed
more » ... isimulation equivalence, for which an exponential space construction was previously offered by Laroussinie, Larsen and Weise.
doi:10.1051/ita:2000131 fatcat:ld3hgzf3hjdcpl5zwrpbv4eplq