Unfolding semantics of graph transformation-Reference-Cited by-同舟云学术

Unfolding semantics of graph transformation

Published:2007-05 Issue:5 Volume:205 Page:733-782
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Baldan Paolo,Corradini Andrea,Montanari Ugo,Ribeiro Leila

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference40 articles.

1. P. Baldan, Modelling concurrent computations: from contextual Petri nets to graph grammars. Ph.D. thesis, Department of Computer Science, University of Pisa, 2000. Available as technical report n. TD-1/00.

2. Domain and event structure semantics for Petri nets with read and inhibitor arcs;Baldan;Theoretical Computer Science,2004

3. A static analysis technique for graph transformation systems;Baldan,2001

4. Verifying finite-state graph grammars: an unfolding-based approach;Baldan,2004

5. Concatenable graph processes: relating processes and derivation traces;Baldan,1998

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A generic framework for representing and analyzing model concurrency;Software and Systems Modeling;2023-01-09

2. Encoding Incremental NACs in Safe Graph Grammars using Complementation;Electronic Proceedings in Theoretical Computer Science;2020-12-03

3. Tracelets and Tracelet Analysis Of Compositional Rewriting Systems;Electronic Proceedings in Theoretical Computer Science;2020-09-15

4. Unfolding Symbolic Attributed Graph Grammars;Graph Transformation;2020

5. Unfolding Graph Grammars with Negative Application Conditions;Graph Transformation;2019