Busque entre los 168506 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2012-11-02T13:24:05Z | |
dc.date.available | 2012-11-02T13:24:05Z | |
dc.date.issued | 1999-10 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/23524 | |
dc.description.abstract | 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. | en |
dc.language | en | es |
dc.subject | Proof of the Interpretability | en |
dc.subject | Interoperability | es |
dc.subject | P/PML | en |
dc.subject | Relational Setting | en |
dc.title | A proof of the interpretability of P/PML in a relational setting | en |
dc.type | Objeto de conferencia | es |
sedici.creator.person | Baum, Gabriel Alfredo | es |
sedici.creator.person | Frias, Marcelo F. | es |
sedici.description.note | Eje: Teoría | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Red de Universidades con Carreras en Informática (RedUNCI) | es |
sedici.subtype | Objeto de conferencia | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
sedici.date.exposure | 2001-10 | |
sedici.relation.event | V Congreso Argentino de Ciencias de la Computación | es |
sedici.description.peerReview | peer-review | es |