Processes for adhesive rewriting systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3921 LNCS, Issue , 2006, Pages 202-216

  Baldan, Paolo ^a   Corradini, Andrea ^b   Heindel, Tobias ^c   König, Barbara ^c   Sobociński, Pawel ^d  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

^c UNIVERSITY OF STUTTGART   (Germany)

^d UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONCURRENT ENGINEERING; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; PETRI NETS; SEMANTICS; TECHNICAL WRITING;

CONCURRENT SEMANTICS; GRAPH GRAMMARS; REWRITING SYSTEMS;

INFORMATION RETRIEVAL SYSTEMS;

EID: 33745802170     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11690634_14     Document Type: Conference Paper

References (14)

1. P. Baldan. Modelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars. PhD thesis, Dipartimento di Informatica, Università di Pisa, 2000.
2. P. Baldan, A. Corradini, and B. König. A static analysis technique for graph transformation systems. In Proc. of CONCUR '01, volume 2154 of LNCS, pages 381-395. Springer Verlag, 2001.
3. P. Baldan, A. Corradini, and B. König. Verifying finite-state graph grammars: an unfolding-based approach. In Proc. of CONCUR 2004, volume 3170 of LNCS, pages 83-98. Springer Verlag, 2004.
4. P. Baldan, A. Corradini, and U. Montanari. Concatenable graph processes: relating processes and derivation traces. In Proc. ICALP'98, volume 1443 of LNCS. Springer Verlag, 1998.
5. P. Baldan, A. Corradini, and U. Montanari. Unfolding and Event Structure Semantics for Graph Grammars. In Proc. of FoSSaCS '99, volume 1578 of LNCS, pages 73-89. Springer Verlag, 1999.
6. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26:241-265, 1996.
7. H. Ehrig. Introduction to the Algebraic Theory of Graph Grammars. In Proceedings of the 1st International Workshop on Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of LNCS, pages 1-69. Springer Verlag, 1979.
8. H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce. Parallelism and concurrency in high-level replacement systems. Mathematical Structures in Computer Science, 1:361-404, 1991.
9. H. Ehrig, A. Habel, J. Padberg, and U. Prange. Adhesive high-level replacement categories and systems. In Proc. of ICGT'04, volume 3256 of LNCS, pages 144-160. Springer Verlag, 2004.
10. J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan's unfolding algorithm. Formal Methods in System Design, 20(20):285-310, 2002.
11. U. Goltz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Control, 57:125-147, 1983.
12. A. Habel, J. Müller, and D. Plump. Double-pushout graph transformation revisited. Mathematical Structures in Computer Science, 11(5):637-688, 2001.
13. S. Lack and P. Sobociński. Adhesive and quasiadhesive categories. Theoretical Informatics and Applications, 39(2):511-546, 2005.
14. K.L. McMillan. Symbolic Model Checking. Kluwer, 1993.