Refinement mapping for general (discrete event) systems theory
dc.contributor.author | Menezes, Paulo Fernando Blauth | pt_BR |
dc.contributor.author | Costa, J. Felix | pt_BR |
dc.contributor.author | Sernadas, Amilcar dos Santos Costa | pt_BR |
dc.date.accessioned | 2015-09-14T15:58:11Z | pt_BR |
dc.date.issued | 1994 | pt_BR |
dc.identifier.uri | http://hdl.handle.net/10183/126663 | pt_BR |
dc.description.abstract | A 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.mimetype | application/pdf | |
dc.language.iso | eng | pt_BR |
dc.publisher | Instituto Superior Tecnico. Departamento de Matematica | pt_BR |
dc.rights | Open Access | en |
dc.subject | Teoria : Ciência : Computação | pt_BR |
dc.subject | Teoria : Sistemas | pt_BR |
dc.title | Refinement mapping for general (discrete event) systems theory | pt_BR |
dc.type | Relatório técnico e de pesquisa | pt_BR |
dc.identifier.nrb | 000104246 | pt_BR |
Este item está licenciado na Creative Commons License