Characteristic Formulae for Timed Automata
(asic esearch in omputer cience, Centre of the Danish
National Research Foundation),
Department of Computer Science, Aalborg University,
Fr. Bajersvej 7E, 9220 Aalborg Ø, Denmark.
Accepted: 14 March 2001
This paper offers characteristic formula constructions in the real-time 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 bisimulation equivalence, for which an exponential space construction was previously offered by Laroussinie, Larsen and Weise.
Mathematics Subject Classification: 68Q60 / 68Q10
© EDP Sciences, 2000