Verifying Finite-State Graph Grammars: An Unfolding-Based Approach-Reference-Cited by-同舟云学术

Verifying Finite-State Graph Grammars: An Unfolding-Based Approach

Published:2004 Issue: Volume: Page:83-98
ISSN:0302-9743
Container-title:CONCUR 2004 - Concurrency Theory
language:
Short-container-title:

Author:

Baldan Paolo,Corradini Andrea,König Barbara

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-28644-8_6

Reference23 articles.

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

2. Baldan, P., Corradini, A., König, B.: An unfolding-based approach for the verification of finite-state graph grammars. Technical report, Dipartimento di Informatica, Università Ca’ Foscari di Venezia (to appear, 2004)

3. Lecture Notes in Computer Science;P. Baldan,1999

4. Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures and processes. Information and Computation 171(1), 1–49 (2001)

5. Lecture Notes in Computer Science;P. Baldan,2003

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

1. Finding the Fuzzy Set of Bases of Fuzzy Temporal Graph;Intelligent and Fuzzy Techniques for Emerging Conditions and Digital Transformation;2021-08-24

2. Fuzzy Clique Set Determination Method as an Example of Fuzzy Temporal Graph Invariant;Advances in Intelligent Systems and Computing;2021

3. Temporal Reachability in Fuzzy Graphs for Geographic Information Systems;Advances in Intelligent Systems and Computing;2020

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

5. Searching Method of Fuzzy Internally Stable Set as Fuzzy Temporal Graph Invariant;Communications in Computer and Information Science;2018