Open AccessCharacteristic Formulae for Timed Automata
Author(s) -
Luca Aceto,
Anna Ingólfsdóttir,
Mikkel L. Pedersen,
Jan Struckmann Poulsen
Publication year - 2000
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v7i23.20150
Subject(s) - automaton , equivalence (formal languages) , mathematics , bisimulation , timed automaton , discrete mathematics , trace (psycholinguistics) , exponential function , arithmetic , computer science , algebra over a field , pure mathematics , theoretical computer science , mathematical analysis , linguistics , philosophy
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.