Interpretability of first-order linear temporal logics in fork algebras
In this paper we prove theorems on the interpretability of the first-order temporal logics LTL and TL into Fork Algebras. This result is part of a research project on the interpretability of logics in Fork Algebras, and has important applications towards the relational specification of properties of...
Guardado en:
Autores principales: | , |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_15678326_v66_n2_p161_Frias |
Aporte de: |
id |
todo:paper_15678326_v66_n2_p161_Frias |
---|---|
record_format |
dspace |
spelling |
todo:paper_15678326_v66_n2_p161_Frias2023-10-03T16:26:42Z Interpretability of first-order linear temporal logics in fork algebras Frias, M.F. Pombo, C.G.L. Fork algebras Interpretability Software verification Temporal logics Fork algebras Interpretability Software verification Temporal logics Computer software Formal logic Mathematical programming Theorem proving Algebra In this paper we prove theorems on the interpretability of the first-order temporal logics LTL and TL into Fork Algebras. This result is part of a research project on the interpretability of logics in Fork Algebras, and has important applications towards the relational specification of properties of systems within the Ar gentum tool. © 2005 Elsevier Inc. All rights reserved. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_15678326_v66_n2_p161_Frias |
institution |
Universidad de Buenos Aires |
institution_str |
I-28 |
repository_str |
R-134 |
collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
topic |
Fork algebras Interpretability Software verification Temporal logics Fork algebras Interpretability Software verification Temporal logics Computer software Formal logic Mathematical programming Theorem proving Algebra |
spellingShingle |
Fork algebras Interpretability Software verification Temporal logics Fork algebras Interpretability Software verification Temporal logics Computer software Formal logic Mathematical programming Theorem proving Algebra Frias, M.F. Pombo, C.G.L. Interpretability of first-order linear temporal logics in fork algebras |
topic_facet |
Fork algebras Interpretability Software verification Temporal logics Fork algebras Interpretability Software verification Temporal logics Computer software Formal logic Mathematical programming Theorem proving Algebra |
description |
In this paper we prove theorems on the interpretability of the first-order temporal logics LTL and TL into Fork Algebras. This result is part of a research project on the interpretability of logics in Fork Algebras, and has important applications towards the relational specification of properties of systems within the Ar gentum tool. © 2005 Elsevier Inc. All rights reserved. |
format |
JOUR |
author |
Frias, M.F. Pombo, C.G.L. |
author_facet |
Frias, M.F. Pombo, C.G.L. |
author_sort |
Frias, M.F. |
title |
Interpretability of first-order linear temporal logics in fork algebras |
title_short |
Interpretability of first-order linear temporal logics in fork algebras |
title_full |
Interpretability of first-order linear temporal logics in fork algebras |
title_fullStr |
Interpretability of first-order linear temporal logics in fork algebras |
title_full_unstemmed |
Interpretability of first-order linear temporal logics in fork algebras |
title_sort |
interpretability of first-order linear temporal logics in fork algebras |
url |
http://hdl.handle.net/20.500.12110/paper_15678326_v66_n2_p161_Frias |
work_keys_str_mv |
AT friasmf interpretabilityoffirstorderlineartemporallogicsinforkalgebras AT pombocgl interpretabilityoffirstorderlineartemporallogicsinforkalgebras |
_version_ |
1782024556524863488 |