A categorical framework for concurrent, anticipatory systems
Autor(a) principal: | |
---|---|
Data de Publicação: | 1998 |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFRGS |
Texto Completo: | http://hdl.handle.net/10183/256159 |
Resumo: | A categorical semantic domain is constructed for Petri nets which satisfies the diagonal compositionality requirement with respect to anticipations, i.e., Petri nets are equipped with a compositional anticipation mechanism (vertical compositionality) that distributes through net combinators (horizontal compositionality). The anticipation mechanism is based on graph transformations (single pushout approach). A finitely bicomplete category of partial Petri nets and partial morphisms is introduced. Classes of transformations stand for anticipations. The composition of anticipations (i.e., composition of pushouts) is defined, leading to a category of nets and anticipations which is also complete and cocomplete. Since the anticipation operation composes, the vertical compositionality requirement of Petri nets is achieved. Then, it is proven that the anticipation also satisfies the horizontal compositionality requirement. A specification grammar stands for a system specification and the corresponding induced subcategory of nets and anticipation's stands for ali possible dynamic anticipation's ofthe system (objects) and their relationship (morphims). |
id |
UFRGS-2_23d405de45f84ce2c451ea04a1d98395 |
---|---|
oai_identifier_str |
oai:www.lume.ufrgs.br:10183/256159 |
network_acronym_str |
UFRGS-2 |
network_name_str |
Repositório Institucional da UFRGS |
repository_id_str |
|
spelling |
Menezes, Paulo Fernando Blauth2023-03-22T03:24:29Z19980103-4308http://hdl.handle.net/10183/256159000101514A categorical semantic domain is constructed for Petri nets which satisfies the diagonal compositionality requirement with respect to anticipations, i.e., Petri nets are equipped with a compositional anticipation mechanism (vertical compositionality) that distributes through net combinators (horizontal compositionality). The anticipation mechanism is based on graph transformations (single pushout approach). A finitely bicomplete category of partial Petri nets and partial morphisms is introduced. Classes of transformations stand for anticipations. The composition of anticipations (i.e., composition of pushouts) is defined, leading to a category of nets and anticipations which is also complete and cocomplete. Since the anticipation operation composes, the vertical compositionality requirement of Petri nets is achieved. Then, it is proven that the anticipation also satisfies the horizontal compositionality requirement. A specification grammar stands for a system specification and the corresponding induced subcategory of nets and anticipation's stands for ali possible dynamic anticipation's ofthe system (objects) and their relationship (morphims).application/pdfengRevista de Informatica Teorica e Aplicada. Porto Alegre. Vol. 5, n. 2 (dez. 1998), p. 91-113Teoria : Ciência : ComputaçãoTeoria : CategoriasConcorrênciaanticipatory systems category theory.concurrencycompositionalitygraph transformationcategory theoryA categorical framework for concurrent, anticipatory systemsinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/otherinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFRGSinstname:Universidade Federal do Rio Grande do Sul (UFRGS)instacron:UFRGSTEXT000101514.pdf.txt000101514.pdf.txtExtracted Texttext/plain39397http://www.lume.ufrgs.br/bitstream/10183/256159/2/000101514.pdf.txt12dab728976ea74fbc2bb2ca7a6d1e52MD52ORIGINAL000101514.pdfTexto completo (inglês)application/pdf6676337http://www.lume.ufrgs.br/bitstream/10183/256159/1/000101514.pdf9f6de3ee0bb576ba2fd08601b6be6d9aMD5110183/2561592023-03-23 03:24:29.252331oai:www.lume.ufrgs.br:10183/256159Repositório de PublicaçõesPUBhttps://lume.ufrgs.br/oai/requestopendoar:2023-03-23T06:24:29Repositório Institucional da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)false |
dc.title.pt_BR.fl_str_mv |
A categorical framework for concurrent, anticipatory systems |
title |
A categorical framework for concurrent, anticipatory systems |
spellingShingle |
A categorical framework for concurrent, anticipatory systems Menezes, Paulo Fernando Blauth Teoria : Ciência : Computação Teoria : Categorias Concorrência anticipatory systems category theory. concurrency compositionality graph transformation category theory |
title_short |
A categorical framework for concurrent, anticipatory systems |
title_full |
A categorical framework for concurrent, anticipatory systems |
title_fullStr |
A categorical framework for concurrent, anticipatory systems |
title_full_unstemmed |
A categorical framework for concurrent, anticipatory systems |
title_sort |
A categorical framework for concurrent, anticipatory systems |
author |
Menezes, Paulo Fernando Blauth |
author_facet |
Menezes, Paulo Fernando Blauth |
author_role |
author |
dc.contributor.author.fl_str_mv |
Menezes, Paulo Fernando Blauth |
dc.subject.por.fl_str_mv |
Teoria : Ciência : Computação Teoria : Categorias Concorrência |
topic |
Teoria : Ciência : Computação Teoria : Categorias Concorrência anticipatory systems category theory. concurrency compositionality graph transformation category theory |
dc.subject.eng.fl_str_mv |
anticipatory systems category theory. concurrency compositionality graph transformation category theory |
description |
A categorical semantic domain is constructed for Petri nets which satisfies the diagonal compositionality requirement with respect to anticipations, i.e., Petri nets are equipped with a compositional anticipation mechanism (vertical compositionality) that distributes through net combinators (horizontal compositionality). The anticipation mechanism is based on graph transformations (single pushout approach). A finitely bicomplete category of partial Petri nets and partial morphisms is introduced. Classes of transformations stand for anticipations. The composition of anticipations (i.e., composition of pushouts) is defined, leading to a category of nets and anticipations which is also complete and cocomplete. Since the anticipation operation composes, the vertical compositionality requirement of Petri nets is achieved. Then, it is proven that the anticipation also satisfies the horizontal compositionality requirement. A specification grammar stands for a system specification and the corresponding induced subcategory of nets and anticipation's stands for ali possible dynamic anticipation's ofthe system (objects) and their relationship (morphims). |
publishDate |
1998 |
dc.date.issued.fl_str_mv |
1998 |
dc.date.accessioned.fl_str_mv |
2023-03-22T03:24:29Z |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/other |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10183/256159 |
dc.identifier.issn.pt_BR.fl_str_mv |
0103-4308 |
dc.identifier.nrb.pt_BR.fl_str_mv |
000101514 |
identifier_str_mv |
0103-4308 000101514 |
url |
http://hdl.handle.net/10183/256159 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.ispartof.pt_BR.fl_str_mv |
Revista de Informatica Teorica e Aplicada. Porto Alegre. Vol. 5, n. 2 (dez. 1998), p. 91-113 |
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 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/256159/2/000101514.pdf.txt http://www.lume.ufrgs.br/bitstream/10183/256159/1/000101514.pdf |
bitstream.checksum.fl_str_mv |
12dab728976ea74fbc2bb2ca7a6d1e52 9f6de3ee0bb576ba2fd08601b6be6d9a |
bitstream.checksumAlgorithm.fl_str_mv |
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_ |
1815447823542386688 |