Subject
General Computer Science,Theoretical Computer Science
Reference292 articles.
1. Graph transformation for specification and programming;Andries;Science of Computer Programming,1999
2. Z.M. Ariola, J.W. Klop, and D. Plump. Confluent rewriting of bisimilar term graphs. In Proc. Fourth Workshop on Expressiveness in Concurrency, volume 7 of Electronic Notes in TCS. Elsevier Science, 1997. 6.1
3. Bisimilarity in term graph rewriting;Ariola;Inform. and Comput,2000
4. Paolo Baldan. Modelling concurrent computations: from contextual Petri nets to graph grammars. PhD thesis, Department of Computer Science, University of Pisa, 2000. Available as technical report n. TD-1/00. 5.1
5. Paolo Baldan. Concurrency for graph grammars (in a Petri net shell). In Bauderon and Corradini [BC02]. This volume. 5.1
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Connectivity Games over Dynamic Networks;Electronic Proceedings in Theoretical Computer Science;2011-06-04