Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems-Reference-Cited by-同舟云学术

Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems

Published: Issue: Volume: Page:214-226
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Joshi Salil,König Barbara

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70545-1_21.pdf

Reference9 articles.

1. Lecture Notes in Computer Science;P.A. Abdulla,1998

2. Lecture Notes in Computer Science;P. Baldan,2001

3. Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation—part II: Single pushout approach and comparison with double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, ch. 4, vol. 1: Foundations, World Scientific, Singapore (1997)

4. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256(1–2), 63–92 (2001)

5. Löwe, M.: Algebraic approach to single-pushout graph transformation. Theoretical Computer Science 109, 181–224 (1993)

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

1. Liveness in broadcast networks;Computing;2021-08-10

2. Liveness in Broadcast Networks;Networked Systems;2019

3. A unified view of parameterized verification of abstract models of broadcast communication;International Journal on Software Tools for Technology Transfer;2016-01-25

4. Uncover: Using Coverability Analysis for Verifying Graph Transformation Systems;Graph Transformation;2015

5. Model Checking Paxos in Spin;Electronic Proceedings in Theoretical Computer Science;2014-08-24