Mostrar registro simples

dc.contributor.authorMenezes, Paulo Fernando Blauthpt_BR
dc.contributor.authorSernadas, Amilcar dos Santos Costapt_BR
dc.contributor.authorCosta, J. Felixpt_BR
dc.date.accessioned2015-09-14T15:58:05Zpt_BR
dc.date.issued1995pt_BR
dc.identifier.urihttp://hdl.handle.net/10183/126660pt_BR
dc.description.abstractNonsequential 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.en
dc.format.mimetypeapplication/pdf
dc.language.isoengpt_BR
dc.publisherInstituto Superior Tecnico. Departamento de Matematicapt_BR
dc.rightsOpen Accessen
dc.subjectTeoria : Ciência : Computaçãopt_BR
dc.subjectLinguagens orientadas : Objetospt_BR
dc.titleNonsequential automata semantics for a concurrent object-based languagept_BR
dc.typeRelatório técnico e de pesquisapt_BR
dc.identifier.nrb000264651pt_BR


Thumbnail
   

Este item está licenciado na Creative Commons License

Mostrar registro simples