Graphical representation of covariant-contravariant modal formulae

Covariant-contravariant simulation is a combination of standard (covariant) simulation, its contravariant counterpart and bisimulation. We have previously studied its logical characterization by means of the covariant-contravariant modal logic. Moreover, we have investigated the relationships betwee...

Descripción completa

Detalles Bibliográficos
Autores: Aceto, Luca, Fábregas Alfaro, Ignacio, Frutos Escrig, David De, Ingolfsdottir, Anna, Palomino Tarjuelo, Miguel
Tipo de recurso: artículo
Fecha de publicación:2011
País:España
Institución:Universidad Complutense de Madrid (UCM)
Repositorio:Docta Complutense
Idioma:inglés
OAI Identifier:oai:docta.ucm.es:20.500.14352/43751
Acceso en línea:https://hdl.handle.net/20.500.14352/43751
Access Level:acceso abierto
Palabra clave:004
Informática (Informática)
1203.17 Informática
id ES_5513d9822f75c5bbb96fb3ef3f00cd2a
oai_identifier_str oai:docta.ucm.es:20.500.14352/43751
network_acronym_str ES
network_name_str España
repository_id_str
spelling Graphical representation of covariant-contravariant modal formulaeAceto, LucaFábregas Alfaro, IgnacioFrutos Escrig, David DeIngolfsdottir, AnnaPalomino Tarjuelo, Miguel004Informática (Informática)1203.17 InformáticaCovariant-contravariant simulation is a combination of standard (covariant) simulation, its contravariant counterpart and bisimulation. We have previously studied its logical characterization by means of the covariant-contravariant modal logic. Moreover, we have investigated the relationships between this model and that of modal transition systems, where two kinds of transitions (the so-called may and must transitions) were combined in order to obtain a simple framework to express a notion of refinement over state-transition models. In a classic paper, Boudol and Larsen established a precise connection between the graphical approach, by means of modal transition systems, and the logical approach, based on Hennessy-Milner logic without negation, to system specification. They obtained a (graphical) representation theorem proving that a formula can be represented by a term if, and only if, it is consistent and prime. We show in this paper that the formulae from the covariant-contravariant modal logic that admit a "graphical" representation by means of processes, modulo the covariant-contravariant simulation preorder, are also the consistent and prime ones. In order to obtain the desired graphical representation result, we first restrict ourselves to the case of covariant-contravariant systems without bivariant actions. Bivariant actions can be incorporated later by means of an encoding that splits each bivariant action into its covariant and its contravariant parts.EPTCSUniversidad Complutense de Madrid20112011-01-0120112011-01-01journal articlehttp://purl.org/coar/resource_type/c_6501info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/20.500.14352/43751reponame:Docta Complutenseinstname:Universidad Complutense de Madrid (UCM)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:docta.ucm.es:20.500.14352/437512026-06-02T12:44:21Z
dc.title.none.fl_str_mv Graphical representation of covariant-contravariant modal formulae
title Graphical representation of covariant-contravariant modal formulae
spellingShingle Graphical representation of covariant-contravariant modal formulae
Aceto, Luca
004
Informática (Informática)
1203.17 Informática
title_short Graphical representation of covariant-contravariant modal formulae
title_full Graphical representation of covariant-contravariant modal formulae
title_fullStr Graphical representation of covariant-contravariant modal formulae
title_full_unstemmed Graphical representation of covariant-contravariant modal formulae
title_sort Graphical representation of covariant-contravariant modal formulae
dc.creator.none.fl_str_mv Aceto, Luca
Fábregas Alfaro, Ignacio
Frutos Escrig, David De
Ingolfsdottir, Anna
Palomino Tarjuelo, Miguel
author Aceto, Luca
author_facet Aceto, Luca
Fábregas Alfaro, Ignacio
Frutos Escrig, David De
Ingolfsdottir, Anna
Palomino Tarjuelo, Miguel
author_role author
author2 Fábregas Alfaro, Ignacio
Frutos Escrig, David De
Ingolfsdottir, Anna
Palomino Tarjuelo, Miguel
author2_role author
author
author
author
dc.contributor.none.fl_str_mv Universidad Complutense de Madrid
dc.subject.none.fl_str_mv 004
Informática (Informática)
1203.17 Informática
topic 004
Informática (Informática)
1203.17 Informática
description Covariant-contravariant simulation is a combination of standard (covariant) simulation, its contravariant counterpart and bisimulation. We have previously studied its logical characterization by means of the covariant-contravariant modal logic. Moreover, we have investigated the relationships between this model and that of modal transition systems, where two kinds of transitions (the so-called may and must transitions) were combined in order to obtain a simple framework to express a notion of refinement over state-transition models. In a classic paper, Boudol and Larsen established a precise connection between the graphical approach, by means of modal transition systems, and the logical approach, based on Hennessy-Milner logic without negation, to system specification. They obtained a (graphical) representation theorem proving that a formula can be represented by a term if, and only if, it is consistent and prime. We show in this paper that the formulae from the covariant-contravariant modal logic that admit a "graphical" representation by means of processes, modulo the covariant-contravariant simulation preorder, are also the consistent and prime ones. In order to obtain the desired graphical representation result, we first restrict ourselves to the case of covariant-contravariant systems without bivariant actions. Bivariant actions can be incorporated later by means of an encoding that splits each bivariant action into its covariant and its contravariant parts.
publishDate 2011
dc.date.none.fl_str_mv 2011
2011-01-01
2011
2011-01-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/20.500.14352/43751
url https://hdl.handle.net/20.500.14352/43751
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv EPTCS
publisher.none.fl_str_mv EPTCS
dc.source.none.fl_str_mv reponame:Docta Complutense
instname:Universidad Complutense de Madrid (UCM)
instname_str Universidad Complutense de Madrid (UCM)
reponame_str Docta Complutense
collection Docta Complutense
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869408236847759360
score 15.300724

Similares en LA Referencia