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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2006
Materias:
Fork algebras
Interpretability
Software verification
Temporal logics
Computer software
Formal logic
Mathematical programming
Theorem proving
Algebra
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15678326_v66_n2_p161_Frias
http://hdl.handle.net/20.500.12110/paper_15678326_v66_n2_p161_Frias
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paper:paper_15678326_v66_n2_p161_Frias
record_format dspace
spelling paper:paper_15678326_v66_n2_p161_Frias2023-06-08T16:24:08Z Interpretability of first-order linear temporal logics in fork algebras 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. 2006 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15678326_v66_n2_p161_Frias 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
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.
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
publishDate 2006
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15678326_v66_n2_p161_Frias
http://hdl.handle.net/20.500.12110/paper_15678326_v66_n2_p161_Frias
_version_ 1768544337437655040

Ejemplares similares