On characteristic formulae for Event-Recording Automata

Omer Landry Nguena Timo, Pierre-Alain Reynier
2013 RAIRO - Theoretical Informatics and Applications  
A standard bridge between automata theory and logic is provided by the notion of characteristic formula. This paper investigates this problem for the class of event-recording automata. An attempt to express in Event-recording logic (ERL) characteristic formula for timed simulation and bisimulation can be found in Sorea's thesis, but appears to be erroneous. We introduce an extension of the logic ERL, called WT µ . We prove it is strictly more expressive than ERL, and that its model-checking
more » ... lem against event-recording automata is EXPTIME-complete. We provide constructions for characterizing event-recording automata up to timed bisimilarity, and timed similarity. Finally, combining these two results we obtain decision procedures for checking timed similarity and timed bisimilarity for event-recording automata and we study the complexity issues.
doi:10.1051/ita/2012029 fatcat:75tb7yx7zbb3fafyn7gmhbtgse