Using matrix graph grammars for the analysis of behavioural specifications: Sequential and parallel independence

Biblos-e Archivo/Manakin Repository

Show simple item record

dc.contributor.author Pérez Velasco, Pedro Pablo
dc.contributor.author Lara, Juan de
dc.contributor.other UAM. Departamento de Ingeniería Informática es_ES
dc.date.accessioned 2015-05-29T17:41:57Z
dc.date.available 2015-05-29T17:41:57Z
dc.date.issued 2008-04
dc.identifier.citation Electronic Notes in Theoretical Computer Science 206 (2008): 133-152 en_US
dc.identifier.issn 1571-0661
dc.identifier.uri http://hdl.handle.net/10486/666498
dc.description Proceedings of the Seventh Spanish Conference on Programming and Computer Languages (PROLE 2007) en_US
dc.description.abstract In this paper we present a new approach for the analysis of rule-based specification of system dynamics. We model system states as simple digraphs, which can be represented with boolean matrices. Rules modelling the different state changes of the system can also be represented with boolean matrices, and therefore the rewriting is expressed using boolean operations only. The conditions for sequential independence between pair of rules are well-known in the categorical approaches to graph transformation (e.g. single and double pushout). These conditions state when two rules can be applied in any order yielding the same result. In this paper, we study the concept of sequential independence in our framework, and extend it in order to consider derivations of arbitrary finite length. Instead of studying one-step rule advances, we study independence of rule permutations in sequences of arbitrary finite length. We also analyse the conditions under which a sequence is applicable to a given host graph. We introduce rule composition and give some preliminary results regarding parallel independence. Moreover, we improve our framework making explicit the elements which, if present, disable the application of a rule or a sequence. en_US
dc.description.sponsorship Work sponsored by Spanish Ministry of Science and Education, project MOSAIC (TSI2005-08225-C07-06). en_US
dc.format.extent 20 pág. es_ES
dc.format.mimetype application/pdf en
dc.language.iso eng en
dc.publisher Elsevier BV
dc.relation.ispartof Electronic Notes in Theoretical Computer Science en_US
dc.rights © 2008 Elsevier B.V. Open access under CC BY-NC-ND license en_US
dc.subject.other Graph Transformation en_US
dc.subject.other Matrix Graph Grammars en_US
dc.subject.other Parallelism en_US
dc.subject.other Sequential Independence en_US
dc.title Using matrix graph grammars for the analysis of behavioural specifications: Sequential and parallel independence en_US
dc.type article en_US
dc.type conferenceObject en
dc.subject.eciencia Informática es_ES
dc.relation.publisherversion http://dx.doi.org/10.1016/j.entcs.2008.03.079
dc.identifier.doi 10.1016/j.entcs.2008.03.079
dc.identifier.publicationfirstpage 133
dc.identifier.publicationlastpage 152
dc.identifier.publicationvolume 206
dc.relation.eventdate September 12-14, 2007 en_US
dc.relation.eventnumber 7
dc.relation.eventplace Zaragoza (Spain) en_US
dc.relation.eventtitle Seventh Spanish Conference on Programming and Computer Languages, PROLE 2007 en_US
dc.type.version info:eu-repo/semantics/publishedVersion en
dc.contributor.group Herramientas Interactivas Avanzadas (ING EPS-003) es_ES
dc.rights.cc Reconocimiento – NoComercial – SinObraDerivada es_ES
dc.rights.accessRights openAccess en
dc.authorUAM Lara Jaramillo, Juan De (259157)


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record