A proof of the interpretability of P/PML in a relational setting
- Autores
- Baum, Gabriel Alfredo; Frias, Marcelo F.
- Año de publicación
- 2001
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- 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.
Eje: Teoría
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Proof of the Interpretability
P/PML
Relational Setting
Interoperability - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/23524
Ver los metadatos del registro completo
| id |
SEDICI_16d92a5d734c8cac63feca73d54167aa |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/23524 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
A proof of the interpretability of P/PML in a relational settingBaum, Gabriel AlfredoFrias, Marcelo F.Ciencias InformáticasProof of the InterpretabilityP/PMLRelational SettingInteroperabilityIn [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.Eje: TeoríaRed de Universidades con Carreras en Informática (RedUNCI)2001-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23524enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T10:48:05Zoai:sedici.unlp.edu.ar:10915/23524Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 10:48:05.877SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
A proof of the interpretability of P/PML in a relational setting |
| title |
A proof of the interpretability of P/PML in a relational setting |
| spellingShingle |
A proof of the interpretability of P/PML in a relational setting Baum, Gabriel Alfredo Ciencias Informáticas Proof of the Interpretability P/PML Relational Setting Interoperability |
| 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 |
A proof of the interpretability of P/PML in a relational setting |
| dc.creator.none.fl_str_mv |
Baum, Gabriel Alfredo Frias, Marcelo F. |
| author |
Baum, Gabriel Alfredo |
| author_facet |
Baum, Gabriel Alfredo Frias, Marcelo F. |
| author_role |
author |
| author2 |
Frias, Marcelo F. |
| author2_role |
author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas Proof of the Interpretability P/PML Relational Setting Interoperability |
| topic |
Ciencias Informáticas Proof of the Interpretability P/PML Relational Setting Interoperability |
| dc.description.none.fl_txt_mv |
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. Eje: Teoría Red de Universidades con Carreras en Informática (RedUNCI) |
| 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. |
| publishDate |
2001 |
| dc.date.none.fl_str_mv |
2001-10 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
| format |
conferenceObject |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/23524 |
| url |
http://sedici.unlp.edu.ar/handle/10915/23524 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
| dc.format.none.fl_str_mv |
application/pdf |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1846063908356358144 |
| score |
13.22299 |