Baldan, Paolo; Corradini, Andrea; König, Barbara:
Verifying Finite-State Graph Grammars: an Unfolding-Based Approach
In: CONCUR 2004 - Concurrency theory : 15th international conference ; proceedings - 15th International Conference on Concurrency Theory (CONCUR), August 31 - September 3, 2004 , London, UK - Berlin: Springer, 2004 - (Lecture notes in computer science ; 3170), pp. 83 - 98
2004book article/chapter in Proceedings
Computer ScienceFaculty of Engineering » Computer Science and Applied Cognitive Science
Title in English:
Verifying Finite-State Graph Grammars: an Unfolding-Based Approach
Author:
Baldan, Paolo;Corradini, Andrea;König, BarbaraUDE
GND
1050396502
LSF ID
15982
ORCID
0000-0002-4193-2889ORCID iD
Other
connected with university
Scopus ID
Language of text:
English