Show simple item record

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:57:57Zpt_BR
dc.date.issued1996pt_BR
dc.identifier.urihttp://hdl.handle.net/10183/126657pt_BR
dc.description.abstractNonsequential automata constitute a categoria! semantic domain based oo labeled transition system with full concurrency, where restriction and relabeling are functorial and a class oi morphisms stands for refinement. It is, for ou r knowledge, the first model for concurrency which satisfies the diagonal compositionality requirement, i.e., refinements compose (vertical) and distribute over combinators (horizontal). To experiment with the proposed semantic domain, a semantics for a concurrent, object-based language is given. lt is a simplified and revised version oi lhe object-oriented specification language GNOME, introducing sane special features inspired by lhe semantic domain such as refinement. The diagonal compositionality is an essential property to give semantics in this context.en
dc.format.mimetypeapplication/pdf
dc.language.isoengpt_BR
dc.publisherCPGCC da UFRGSpt_BR
dc.rightsOpen Accessen
dc.subjectTeoria : Processospt_BR
dc.subjectRedes : Petript_BR
dc.subjectLinguagens orientadas : Objetospt_BR
dc.subjectTeoria : Concorrenciapt_BR
dc.titleRefinement in a concurrent, object-based languagept_BR
dc.typeRelatório técnico e de pesquisapt_BR
dc.identifier.nrb000105636pt_BR


Files in this item

Thumbnail
   

This item is licensed under a Creative Commons License

Show simple item record