On characteristic formulae for Event-Recording Automata
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 47 (2013) no. 1, pp. 69-96.

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 (ERA), a subclass of timed automata in which clocks are associated with actions and that enjoys very good closure properties. We first study the problem of expressing characteristic formulae for ERA in Event-Recording Logic (ERL ), a logic introduced by Sorea to express event-based timed specifications. We prove that the construction proposed by Sorea for ERA without invariants is incorrect. More generally, we prove that timed bisimilarity cannot in general be expressed in ERL for the class of ERA , and study under which conditions on ERA it can be. Then, we introduce the logic WTμ , a new logic for event-based timed specifications closer to the timed logic ℒν that was introduced by Laroussinie, Larsen and Weise. We prove that it is strictly more expressive than ERL , and that its model-checking problem against ERA is EXPTIME -complete. Finally, we provide characteristic formulae constructions in WTμ for characterizing the general class of ERA up to timed (bi)similarity and study the complexity issues.

DOI : https://doi.org/10.1051/ita/2012029
Classification : 03B44,  68Q60
Mots clés : timed logic, bisimulation, event-clock automata
@article{ITA_2013__47_1_69_0,
author = {Nguena Timo, Omer Landry and Reynier, Pierre-Alain},
title = {On characteristic formulae for {Event-Recording} {Automata}},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {69--96},
publisher = {EDP-Sciences},
volume = {47},
number = {1},
year = {2013},
doi = {10.1051/ita/2012029},
mrnumber = {3072311},
language = {en},
url = {http://www.numdam.org/articles/10.1051/ita/2012029/}
}
TY  - JOUR
AU  - Nguena Timo, Omer Landry
AU  - Reynier, Pierre-Alain
TI  - On characteristic formulae for Event-Recording Automata
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2013
DA  - 2013///
SP  - 69
EP  - 96
VL  - 47
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ita/2012029/
UR  - https://www.ams.org/mathscinet-getitem?mr=3072311
UR  - https://doi.org/10.1051/ita/2012029
DO  - 10.1051/ita/2012029
LA  - en
ID  - ITA_2013__47_1_69_0
ER  - 
Nguena Timo, Omer Landry; Reynier, Pierre-Alain. On characteristic formulae for Event-Recording Automata. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 47 (2013) no. 1, pp. 69-96. doi : 10.1051/ita/2012029. http://www.numdam.org/articles/10.1051/ita/2012029/

[1] L. Aceto, A. Ingólfsdóttir, M.L. Pedersen and J. Poulsen, Characteristic formulae for timed automata. Theor. Inf. Appl. 34 (2000) 565-584. | Numdam | MR 1844719 | Zbl 0974.68121

[2] L. Aceto and F. Laroussinie, Is your model-checker on time? On the complexity of model checking for timed modal logics. J. Log. Algebr. Program. 52-53 (2002) 7-51. | MR 1943502 | Zbl 1008.68030

[3] R. Alur and D. Dill, A theory of timed automata, Theor. Comput. Sci. 126 (1994) 183-235. | MR 1271580 | Zbl 0803.68071

[4] R. Alur, L. Fix and T.A. Henzinger, Event-clock automata: A determinizable class of timed automata. Theor. Comput. Sci. 211 (1999) 253-273. | MR 1663893 | Zbl 0912.68132

[5] H. Bekić, Definable operation in general algebras, and the theory of automata and flowcharts, in Programming Languages and Their Definition, edited by C.B. Jones. Springer. Lect. Notes Comput. Sci. 177 (1984) 30-55. | Zbl 0548.68004

[6] P. Bouyer, F. Cassez and F. Laroussinie, Timed modal logics for real-time systems: Specification, verification and control. J. Logic Lang. Inform. 20 (2011) 169-203. | MR 2782114 | Zbl 1216.68158

[7] A.K. Chandra, D. Kozen and L.J. Stockmeyer, Alternation. J. ACM 28 (1981) 114-133. | MR 603186 | Zbl 0473.68043

[8] R. Cleaveland and B. Steffen, A linear-time model-checking algorithm for the alternation-free modal mu-calculus. Form. Method Syst. Design 2 (1993) 121-147. | MR 1236233 | Zbl 0772.68038

[9] D. D'Souza, A logical characterisation of event clock automata. Int. J. Found. Comput. Sci. 14 (2003) 625-640. | MR 2010588 | Zbl 1101.68647

[10] T.A. Henzinger, X. Nicollin, J. Sifakis and S. Yovine, Symbolic model-checking for real-time systems. Inf. Comput. 111 (1994) 193-244. | MR 1276749 | Zbl 0806.68080

[11] F. Laroussinie and K.G. Larsen, CMC : A tool for compositional model-checking of real-time systems, in Proc. of IFIP TC6 WG6.1 Joint Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols, FORTE XI, and Protocol Specification, Testing and Verification, PSTV XVIII (Paris, Nov. 1998), edited by S. Budkowski, A.R. Cavalli and E. Najm, Kluwer, IFIP Conference Proceedings 135 (1998) 439-456.

[12] F. Laroussinie, K.G. Larsen and C. Weise, From timed automata to logic - and back, in Proc. of 20th Int. Symp. on Mathematical Foundations of Computer Science, MFCS '95 (Prague, Aug./Sept. 1995), edited by J. Wiedermann and P. Hájek, Springer. Lect. Notes Comput. Sci. 969 (1995) 529-539. | MR 1467280 | Zbl 1193.03069

[13] O.L. Nguena Timo, Synthesis for a Weak Real-Time Logic, Ph.D. thesis, Université Bordeaux 1 (2009).

[14] O.L. Nguena Timo and P.-A. Reynier, On characteristic formulae for event-recording automata, in Proc. of 6th Workshop on Fixed Points in Computer Science, FICS '09 (Coimbra, Sept. 2009), edited by R. Matthes and T. Uustalu. Inst. of Cybernetics, Tallinn (2009) 70-78.

[15] J.-F. Raskin and P.-Y. Schobbens, The logic of event clocks - decidability, complexity and expressiveness. J. Autom. Lang. Comb. 4 (1999) 247-286. | MR 1719363 | Zbl 0978.03015

[16] D. Sangiorgi, Bisimulation : From the origins to today, in Proc. of 19th Ann. IEEE Symp. on Logic in Computer Science, LICS '04 (Turku, July 2004). IEEE CS Press (2004) 298-302.

[17] M. Sorea, A decidable fixpoint logic for time-outs, in Proc. of 13th Int. Conf. on Concurrency Theory, CONCUR 2002 (Brno, Aug. 2002), edited by L. Brim, P. Jancar, M. Křetínský and A. Kučera, Springer. Lect. Notes Comput. Sci. 2421 (2002) 255-271. | MR 2053810 | Zbl 1012.03042

[18] M. Sorea, Verification of Real-Time Systems through Lazy Approximations, Ph.D. thesis, Universität Ulm (2004).

[19] W. Thomas, Languages, automata and logic, in Handbook of Formal Languages, Beyond Words, edited by G. Rozenberg and A. Salomaa. Springer 3 (1997) 389-455. | MR 1470024 | Zbl 0866.68057

Cité par Sources :