A proof of the interpretability of P/PML in a relational setting

In [1] we presented the logic P=PML, a formalism suitable for the speci cation and construction of Real-Time systems. The main algebraic result, namely, the interpretability of P/PML into an equa- tional calculus based on w-closure fork algebras (which allows to reason about Real-Time systems in an...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Baum, Gabriel Alfredo, Frias, Marcelo F.
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2001
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23524
Aporte de:
id I19-R120-10915-23524
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Proof of the Interpretability
P/PML
Relational Setting
Interoperability
spellingShingle Ciencias Informáticas
Proof of the Interpretability
P/PML
Relational Setting
Interoperability
Baum, Gabriel Alfredo
Frias, Marcelo F.
A proof of the interpretability of P/PML in a relational setting
topic_facet Ciencias Informáticas
Proof of the Interpretability
P/PML
Relational Setting
Interoperability
description In [1] we presented the logic P=PML, a formalism suitable for the speci cation and construction of Real-Time systems. The main algebraic result, namely, the interpretability of P/PML into an equa- tional calculus based on w-closure fork algebras (which allows to reason about Real-Time systems in an equational calculus) was stated but not proved because of the lack of space. In this paper we present a detailed proof of the interpretability theorem, as well as the proof of the representation theorem for w-closure fork alge- bras which provides a very natural semantics based on binary relations for the equational calculus.
format Objeto de conferencia
Objeto de conferencia
author Baum, Gabriel Alfredo
Frias, Marcelo F.
author_facet Baum, Gabriel Alfredo
Frias, Marcelo F.
author_sort Baum, Gabriel Alfredo
title A proof of the interpretability of P/PML in a relational setting
title_short A proof of the interpretability of P/PML in a relational setting
title_full A proof of the interpretability of P/PML in a relational setting
title_fullStr A proof of the interpretability of P/PML in a relational setting
title_full_unstemmed A proof of the interpretability of P/PML in a relational setting
title_sort proof of the interpretability of p/pml in a relational setting
publishDate 2001
url http://sedici.unlp.edu.ar/handle/10915/23524
work_keys_str_mv AT baumgabrielalfredo aproofoftheinterpretabilityofppmlinarelationalsetting
AT friasmarcelof aproofoftheinterpretabilityofppmlinarelationalsetting
AT baumgabrielalfredo proofoftheinterpretabilityofppmlinarelationalsetting
AT friasmarcelof proofoftheinterpretabilityofppmlinarelationalsetting
bdutipo_str Repositorios
_version_ 1764820465749065728