Nonsequential automata semantics for a concurrent object-based language
Autor(a) principal: | |
---|---|
Data de Publicação: | 1995 |
Outros Autores: | , |
Tipo de documento: | Relatório |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFRGS |
Texto Completo: | http://hdl.handle.net/10183/126660 |
Resumo: | Nonsequential automata constitute a categoria! semantic domain based on labeled transition system with full concurrency, where synchronization and hiding are functorial anda class of morphisms stands for reification. It is, for our knowledge, the first model for concurrency which satisfies the diagonal compositionality requirement, i. e., reifications compose (vertical) and distribute over combinators (horizontal). To experiment with the proposed semantic domain, a semantics for a concurrent, object-based language is given. 1t is a simplified and revised version of the object-oriented specification language GNOME, introducing some special features inspired by the semantic domain such as reification and aggregation. The diagonal compositionality is an essential property to give semantics in this context. |
id |
UFRGS-2_1ff84dd7135e1ffdcd8aa8d0478c6cbf |
---|---|
oai_identifier_str |
oai:www.lume.ufrgs.br:10183/126660 |
network_acronym_str |
UFRGS-2 |
network_name_str |
Repositório Institucional da UFRGS |
repository_id_str |
|
spelling |
Menezes, Paulo Fernando BlauthSernadas, Amilcar dos Santos CostaCosta, J. Felix2015-09-14T15:58:05Z1995http://hdl.handle.net/10183/126660000264651Nonsequential automata constitute a categoria! semantic domain based on labeled transition system with full concurrency, where synchronization and hiding are functorial anda class of morphisms stands for reification. It is, for our knowledge, the first model for concurrency which satisfies the diagonal compositionality requirement, i. e., reifications compose (vertical) and distribute over combinators (horizontal). To experiment with the proposed semantic domain, a semantics for a concurrent, object-based language is given. 1t is a simplified and revised version of the object-oriented specification language GNOME, introducing some special features inspired by the semantic domain such as reification and aggregation. The diagonal compositionality is an essential property to give semantics in this context.application/pdfengInstituto Superior Tecnico. Departamento de MatematicaTeoria : Ciência : ComputaçãoLinguagens orientadas : ObjetosNonsequential automata semantics for a concurrent object-based languageinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/reportinfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFRGSinstname:Universidade Federal do Rio Grande do Sul (UFRGS)instacron:UFRGSTEXT000264651.pdf.txt000264651.pdf.txtExtracted Texttext/plain52194http://www.lume.ufrgs.br/bitstream/10183/126660/2/000264651.pdf.txtd8f4b6be6c9730b29ce9c7155b8a491fMD52ORIGINAL000264651.pdf000264651.pdfTexto completoapplication/pdf6861232http://www.lume.ufrgs.br/bitstream/10183/126660/1/000264651.pdfe1c95073f69b2849c7ee372244cdf223MD51THUMBNAIL000264651.pdf.jpg000264651.pdf.jpgGenerated Thumbnailimage/jpeg1008http://www.lume.ufrgs.br/bitstream/10183/126660/3/000264651.pdf.jpg99b173d9490ec889dbc7465c87f99848MD5310183/1266602018-10-23 08:51:44.365oai:www.lume.ufrgs.br:10183/126660Repositório de PublicaçõesPUBhttps://lume.ufrgs.br/oai/requestopendoar:2018-10-23T11:51:44Repositório Institucional da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)false |
dc.title.pt_BR.fl_str_mv |
Nonsequential automata semantics for a concurrent object-based language |
title |
Nonsequential automata semantics for a concurrent object-based language |
spellingShingle |
Nonsequential automata semantics for a concurrent object-based language Menezes, Paulo Fernando Blauth Teoria : Ciência : Computação Linguagens orientadas : Objetos |
title_short |
Nonsequential automata semantics for a concurrent object-based language |
title_full |
Nonsequential automata semantics for a concurrent object-based language |
title_fullStr |
Nonsequential automata semantics for a concurrent object-based language |
title_full_unstemmed |
Nonsequential automata semantics for a concurrent object-based language |
title_sort |
Nonsequential automata semantics for a concurrent object-based language |
author |
Menezes, Paulo Fernando Blauth |
author_facet |
Menezes, Paulo Fernando Blauth Sernadas, Amilcar dos Santos Costa Costa, J. Felix |
author_role |
author |
author2 |
Sernadas, Amilcar dos Santos Costa Costa, J. Felix |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Menezes, Paulo Fernando Blauth Sernadas, Amilcar dos Santos Costa Costa, J. Felix |
dc.subject.por.fl_str_mv |
Teoria : Ciência : Computação Linguagens orientadas : Objetos |
topic |
Teoria : Ciência : Computação Linguagens orientadas : Objetos |
description |
Nonsequential automata constitute a categoria! semantic domain based on labeled transition system with full concurrency, where synchronization and hiding are functorial anda class of morphisms stands for reification. It is, for our knowledge, the first model for concurrency which satisfies the diagonal compositionality requirement, i. e., reifications compose (vertical) and distribute over combinators (horizontal). To experiment with the proposed semantic domain, a semantics for a concurrent, object-based language is given. 1t is a simplified and revised version of the object-oriented specification language GNOME, introducing some special features inspired by the semantic domain such as reification and aggregation. The diagonal compositionality is an essential property to give semantics in this context. |
publishDate |
1995 |
dc.date.issued.fl_str_mv |
1995 |
dc.date.accessioned.fl_str_mv |
2015-09-14T15:58:05Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/report |
format |
report |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10183/126660 |
dc.identifier.nrb.pt_BR.fl_str_mv |
000264651 |
url |
http://hdl.handle.net/10183/126660 |
identifier_str_mv |
000264651 |
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.publisher.none.fl_str_mv |
Instituto Superior Tecnico. Departamento de Matematica |
publisher.none.fl_str_mv |
Instituto Superior Tecnico. Departamento de Matematica |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFRGS instname:Universidade Federal do Rio Grande do Sul (UFRGS) instacron:UFRGS |
instname_str |
Universidade Federal do Rio Grande do Sul (UFRGS) |
instacron_str |
UFRGS |
institution |
UFRGS |
reponame_str |
Repositório Institucional da UFRGS |
collection |
Repositório Institucional da UFRGS |
bitstream.url.fl_str_mv |
http://www.lume.ufrgs.br/bitstream/10183/126660/2/000264651.pdf.txt http://www.lume.ufrgs.br/bitstream/10183/126660/1/000264651.pdf http://www.lume.ufrgs.br/bitstream/10183/126660/3/000264651.pdf.jpg |
bitstream.checksum.fl_str_mv |
d8f4b6be6c9730b29ce9c7155b8a491f e1c95073f69b2849c7ee372244cdf223 99b173d9490ec889dbc7465c87f99848 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS) |
repository.mail.fl_str_mv |
|
_version_ |
1815447152330014720 |