Guardado en:
Detalles Bibliográficos
Autores principales: Cleaveland, Rance, Keiren, Jeroen J. A., Fontana, Peter
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:https://arxiv.org/abs/2310.04100
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866909725463937024
author Cleaveland, Rance
Keiren, Jeroen J. A.
Fontana, Peter
author_facet Cleaveland, Rance
Keiren, Jeroen J. A.
Fontana, Peter
contents This paper establishes relative expressiveness results for several modal mu-calculi interpreted over timed automata. These mu-calculi combine modalities for expressing passage of (real) time with a general framework for defining formulas recursively; several variants have been proposed in the literature. We show that one logic, which we call $L^{rel}_{ν,μ}$, is strictly more expressive than the other mu-calculi considered. It is also more expressive than the temporal logic TCTL, while the other mu-calculi are incomparable with TCTL in the setting of general timed automata.
format Preprint
id arxiv_https___arxiv_org_abs_2310_04100
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Expressiveness Results for Timed Modal Mu-Calculi
Cleaveland, Rance
Keiren, Jeroen J. A.
Fontana, Peter
Logic in Computer Science
This paper establishes relative expressiveness results for several modal mu-calculi interpreted over timed automata. These mu-calculi combine modalities for expressing passage of (real) time with a general framework for defining formulas recursively; several variants have been proposed in the literature. We show that one logic, which we call $L^{rel}_{ν,μ}$, is strictly more expressive than the other mu-calculi considered. It is also more expressive than the temporal logic TCTL, while the other mu-calculi are incomparable with TCTL in the setting of general timed automata.
title Expressiveness Results for Timed Modal Mu-Calculi
topic Logic in Computer Science
url https://arxiv.org/abs/2310.04100