Hennessy–Milner logic with time
Lists
Only you see this
Abstract
In Sections 11.1 and 11.2, we introduced some notions of behavioural equivalence over real-time systems specified by means of timed automata. These equivalences are based on various adaptations to the timed setting of the classic notions of trace equivalence and bisimilarity over LTSs – as presented in Sections 3.2 and 3.3 of this book – and may be used to perform implementation verification for real-time systems. This is useful because, at least in principle, a formalism like that of timed automata can be used to describe both actual systems and their specifications and, as we saw in Section 11.6, these notions of behavioural equivalence are decidable over (networks) of timed automata, with the notable exception of timed trace equivalence.
BibTeX
@inproceedings{aceto2007hennessymilner,
author = {Luca Aceto and Anna Ingólfsdóttir and Kim G. Larsen and Jiřı́ Srba},
title = {{Hennessy–Milner logic with time}},
booktitle = {Cambridge},
year = {2007},
doi = {10.1017/cbo9780511814105.013},
}Loading related content...