Final semantics for decorated traces
Autor(a) principal: | |
---|---|
Data de Publicação: | 2012 |
Outros Autores: | , , , |
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: | https://hdl.handle.net/1822/37862 |
Resumo: | In concurrency theory, various semantic equivalences on la- belled transition systems are based on traces enriched or decorated with some additional observations. They are generally referred to as decorated traces, and examples include ready, failure, trace and complete trace equivalence. Using the generalized powerset construction, recently introduced by a subset of the authors (FSTTCS’10), we give a coalgebraic presentation of decorated trace semantics. This yields a uniform notion of canonical, minimal representatives for the various decorated trace equivalences, in terms of final Moore automata. As a consequence, proofs of decorated trace equivalence can be given by coinduction, using different types of (Moore-) bisimulation, which is helpful for automation. |
id |
RCAP_7e24a3458014e3a6343b6e458e073164 |
---|---|
oai_identifier_str |
oai:repositorium.sdum.uminho.pt:1822/37862 |
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 |
Final semantics for decorated tracesLabelled transition systemsDecorated tracesCoalgebrasFinal Moore automataScience & TechnologyIn concurrency theory, various semantic equivalences on la- belled transition systems are based on traces enriched or decorated with some additional observations. They are generally referred to as decorated traces, and examples include ready, failure, trace and complete trace equivalence. Using the generalized powerset construction, recently introduced by a subset of the authors (FSTTCS’10), we give a coalgebraic presentation of decorated trace semantics. This yields a uniform notion of canonical, minimal representatives for the various decorated trace equivalences, in terms of final Moore automata. As a consequence, proofs of decorated trace equivalence can be given by coinduction, using different types of (Moore-) bisimulation, which is helpful for automation.(100014021)ElsevierUniversidade do MinhoBonchi, FilippoBonsangue, MarcelloCaltais, GeorgianaRutten, JanSilva, Alexandra20122012-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/1822/37862engBonchi, F., Bonsangue, M., Caltais, G., Rutten, J., & Silva, A. (2012, September). Final Semantics for Decorated Traces. Electronic Notes in Theoretical Computer Science. Elsevier BV. http://doi.org/10.1016/j.entcs.2012.08.0061571-066110.1016/j.entcs.2012.08.006info: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:RCAAP2024-07-27T01:22:58Zoai:repositorium.sdum.uminho.pt:1822/37862Portal AgregadorONGhttps://www.rcaap.pt/oai/openairemluisa.alvim@gmail.comopendoar:71602024-07-27T01:22:58Repositó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 |
Final semantics for decorated traces |
title |
Final semantics for decorated traces |
spellingShingle |
Final semantics for decorated traces Bonchi, Filippo Labelled transition systems Decorated traces Coalgebras Final Moore automata Science & Technology |
title_short |
Final semantics for decorated traces |
title_full |
Final semantics for decorated traces |
title_fullStr |
Final semantics for decorated traces |
title_full_unstemmed |
Final semantics for decorated traces |
title_sort |
Final semantics for decorated traces |
author |
Bonchi, Filippo |
author_facet |
Bonchi, Filippo Bonsangue, Marcello Caltais, Georgiana Rutten, Jan Silva, Alexandra |
author_role |
author |
author2 |
Bonsangue, Marcello Caltais, Georgiana Rutten, Jan Silva, Alexandra |
author2_role |
author author author author |
dc.contributor.none.fl_str_mv |
Universidade do Minho |
dc.contributor.author.fl_str_mv |
Bonchi, Filippo Bonsangue, Marcello Caltais, Georgiana Rutten, Jan Silva, Alexandra |
dc.subject.por.fl_str_mv |
Labelled transition systems Decorated traces Coalgebras Final Moore automata Science & Technology |
topic |
Labelled transition systems Decorated traces Coalgebras Final Moore automata Science & Technology |
description |
In concurrency theory, various semantic equivalences on la- belled transition systems are based on traces enriched or decorated with some additional observations. They are generally referred to as decorated traces, and examples include ready, failure, trace and complete trace equivalence. Using the generalized powerset construction, recently introduced by a subset of the authors (FSTTCS’10), we give a coalgebraic presentation of decorated trace semantics. This yields a uniform notion of canonical, minimal representatives for the various decorated trace equivalences, in terms of final Moore automata. As a consequence, proofs of decorated trace equivalence can be given by coinduction, using different types of (Moore-) bisimulation, which is helpful for automation. |
publishDate |
2012 |
dc.date.none.fl_str_mv |
2012 2012-01-01T00:00:00Z |
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 |
https://hdl.handle.net/1822/37862 |
url |
https://hdl.handle.net/1822/37862 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Bonchi, F., Bonsangue, M., Caltais, G., Rutten, J., & Silva, A. (2012, September). Final Semantics for Decorated Traces. Electronic Notes in Theoretical Computer Science. Elsevier BV. http://doi.org/10.1016/j.entcs.2012.08.006 1571-0661 10.1016/j.entcs.2012.08.006 |
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.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
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 |
mluisa.alvim@gmail.com |
_version_ |
1817544852214120448 |