Mostra el registre d'ítem simple
NiMo syntax: part 1
dc.contributor.author | Clérici Martínez, Silvia Inés |
dc.contributor.author | Prestigiacomo, Guillermo |
dc.contributor.author | Zoltan Torres, Ana Cristina |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2017-01-17T12:56:06Z |
dc.date.available | 2017-01-17T12:56:06Z |
dc.date.issued | 2014 |
dc.identifier.citation | Clerici, S.I., Prestigiacomo, G., Zoltan, C. "NiMo syntax: part 1". 2014. |
dc.identifier.uri | http://hdl.handle.net/2117/99459 |
dc.description.abstract | Many formalisms for the specification for concurrent and distributed systems have emerged. In particular considering boxes and strings approaches. Examples are action calculi, rewriting logic and graph rewriting, bigraphs. The boxes and string metaphor is addressed with different levels of granularity. One of the approaches is to consider a process network as an hypergraph. Based in this general framework, we encode NiMo nets as a class of Annotated hypergraphs. This class is defined by giving the alphabet and the operations used to construct such programs. Therefore we treat only editing operations on labelled hypergraphs and afterwards how this editing operation affects the graph. Graph transformation (execution rules) is not covered here. |
dc.format.extent | 15 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-14-7-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Programació |
dc.subject.other | NiMo |
dc.subject.other | Hypergraphs |
dc.title | NiMo syntax: part 1 |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 19593435 |
dc.description.version | Postprint (published version) |
local.citation.author | Clerici, S.I.; Prestigiacomo, G.; Zoltan, C. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]