Mostrar registro simples

dc.contributor.authorMenezes, Paulo Fernando Blauthpt_BR
dc.contributor.authorCosta, J. Felixpt_BR
dc.contributor.authorSernadas, Amilcar dos Santos Costapt_BR
dc.date.accessioned2015-09-14T15:58:11Zpt_BR
dc.date.issued1994pt_BR
dc.identifier.urihttp://hdl.handle.net/10183/126663pt_BR
dc.description.abstractA categoria! semantic domain for general (discrete event) systems based on labeled transition systems with full concurrency is constructed, where synchronization and hiding are functorial. Moreover, we claim that, within the proposed framework, a class of mappings stands for refinement. 1l1en we prove that refinement satisfies the diagonal compositionality requirement, i.e. , refinements compose (vertical) and distribute over system composition (horizontal).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.subjectTeoria : Sistemaspt_BR
dc.titleRefinement mapping for general (discrete event) systems theorypt_BR
dc.typeRelatório técnico e de pesquisapt_BR
dc.identifier.nrb000104246pt_BR


Thumbnail
   

Este item está licenciado na Creative Commons License

Mostrar registro simples