A logic for n-dimensional hierarchical refinement

Detalhes bibliográficos
Autor(a) principal: Alexandre Castro Madeira
Data de Publicação: 2015
Outros Autores: Martins,MA, Luís Soares Barbosa
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://repositorio.inesctec.pt/handle/123456789/6312
http://dx.doi.org/10.4204/eptcs.209.4
Resumo: Hierarchical transition systems provide a popular mathematical structure to represent state-based software applications in which different layers of abstraction are represented by inter-related state machines. The decomposition of high level states into inner sub-states, and of their transitions into inner sub-transitions is common refinement procedure adopted in a number of specification formalisms. This paper introduces a hybrid modal logic for k-layered transition systems, its first-order standard translation, a notion of bisimulation, and a modal invariance result. Layered and hierarchical notions of refinement are also discussed in this setting.
id RCAP_d88495f468100760d4cb8bcb56fcf59f
oai_identifier_str oai:repositorio.inesctec.pt:123456789/6312
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A logic for n-dimensional hierarchical refinementHierarchical transition systems provide a popular mathematical structure to represent state-based software applications in which different layers of abstraction are represented by inter-related state machines. The decomposition of high level states into inner sub-states, and of their transitions into inner sub-transitions is common refinement procedure adopted in a number of specification formalisms. This paper introduces a hybrid modal logic for k-layered transition systems, its first-order standard translation, a notion of bisimulation, and a modal invariance result. Layered and hierarchical notions of refinement are also discussed in this setting.2018-01-16T11:03:02Z2015-01-01T00:00:00Z2015info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/6312http://dx.doi.org/10.4204/eptcs.209.4engAlexandre Castro MadeiraMartins,MALuís Soares Barbosainfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-05-15T10:20:13Zoai:repositorio.inesctec.pt:123456789/6312Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:52:50.354181Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A logic for n-dimensional hierarchical refinement
title A logic for n-dimensional hierarchical refinement
spellingShingle A logic for n-dimensional hierarchical refinement
Alexandre Castro Madeira
title_short A logic for n-dimensional hierarchical refinement
title_full A logic for n-dimensional hierarchical refinement
title_fullStr A logic for n-dimensional hierarchical refinement
title_full_unstemmed A logic for n-dimensional hierarchical refinement
title_sort A logic for n-dimensional hierarchical refinement
author Alexandre Castro Madeira
author_facet Alexandre Castro Madeira
Martins,MA
Luís Soares Barbosa
author_role author
author2 Martins,MA
Luís Soares Barbosa
author2_role author
author
dc.contributor.author.fl_str_mv Alexandre Castro Madeira
Martins,MA
Luís Soares Barbosa
description Hierarchical transition systems provide a popular mathematical structure to represent state-based software applications in which different layers of abstraction are represented by inter-related state machines. The decomposition of high level states into inner sub-states, and of their transitions into inner sub-transitions is common refinement procedure adopted in a number of specification formalisms. This paper introduces a hybrid modal logic for k-layered transition systems, its first-order standard translation, a notion of bisimulation, and a modal invariance result. Layered and hierarchical notions of refinement are also discussed in this setting.
publishDate 2015
dc.date.none.fl_str_mv 2015-01-01T00:00:00Z
2015
2018-01-16T11:03:02Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://repositorio.inesctec.pt/handle/123456789/6312
http://dx.doi.org/10.4204/eptcs.209.4
url http://repositorio.inesctec.pt/handle/123456789/6312
http://dx.doi.org/10.4204/eptcs.209.4
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799131604099006464

Registros relacionados