Hypergraph construction and its application to the static analysis of concurrent systemst

Mathematical Structures in Computer Science

Volumn 12, Issue 2, 2002, Pages 149-175

  Konig, Barbara ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84885691474     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129501003486     Document Type: Article

References (19)

1. Bauderon, M. and Courcelle, B. (1987) Graph expressions and graph rewritings. Mathematical Systems Theory 20 83–127.
2. Corradini, A., Montanari U. and Rossi, F. (1996) Graph processes. Fundamenta Informaticae 26 (3 4) 241–265.
3. Crole, R. L. (1993) Categories for Types, Cambridge University Press.
4. Ehrig, H. (1979) Introduction to the algebraic theory of graphs. In: Proc. 1st International Workshop on Graph Grammars. Springer-Verlag Lecture Notes in Computer Science 73 1–69.
5. Ehrig, H., Pfender, M. and Schneider, H. (1973) Graph grammars: An algebraic approach. In: Proc. 14th IEEE Symp. on Switching and Automata Theory 167–180.
6. Engelfriet, J. and Vereijken, J. J. (1997) Context-free graph grammars and concatenation of graphs. Acta Informatica 34 773–803.
7. Gadducci, F. and Heckel, R. (1997) An inductive view of graph transformation. In: Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT'97. Springer-Verlag Lecture Notes in Computer Science 1376 223–237.
8. Gardner, P. (1998) Closed action calculi. Theoretical Computer Science (in association with the conference on Mathematical Foundations in Programming Semantics).
9. Habel, A. (1992) Hyperedge Replacement: Grammars and Languages. Springer-Verlag Lecture Notes in Computer Science 643.
10. Heckel, R. (1998) Open Graph Transformation Systems, Ph. D. thesis, Technische Universitat Berlin.
11. Konig, B. (1999) Generating type systems for process graphs. In: Proc. of CONCUR ’99. Springer-Verlag Lecture Notes in Computer Science 1664 352–367.
12. Konig, B. (2000) A graph rewriting semantics for the polyadic pi-calculus. In: Workshop on Graph Transformation and Visual Modeling Techniques (Geneva, Switzerland), ICALP Workshops'00 Carleton Scientific 451–458.
13. Kreowski, H.-J. (1980) A comparison between Petri-nets and graph grammars. In: Noltemeier, H. (ed.) Graphtheoretic Concepts in Computer Science. Springer-Verlag Lecture Notes in Computer Science 100 306–317.
14. Lowe, M., Korff, M. and Wagner, A. (1993) An algebraic framework for the transformation of attributed graphs. In: Sleep, M., Plasmeijer, M. and van Eekelen, M. (eds.) Term Graph Rewriting, Wiley, Chapter 14 185–199.
15. Mac Lane, S. (1971) Categories for the Working Mathematician, Springer-Verlag.
16. Meseguer, J. and Montanari, U. (1990) Petri nets are monoids. Information and Computation 88 (2) 105–155. Milner, R. (1993) The polyadic π-calculus: a tutorial. In: Hamer, F.L., Brauer, W. and Schwicht-enberg, H. (eds.) Logic and Algebra of Specification, Springer-Verlag.
17. Pierce, B. and Sangiorgi, D. (1993) Typing and subtyping for mobile processes. In: Proc. of LICS'93 376–385.
18. Turner, D. (1995) The Polymorphic Pi-Calculus: Theory and Implementation, Ph. D. thesis, University of Edinburgh. (ECS-LFCS-96-345.)
19. Yoshida, N. (1994) Graph notation for concurrent combinators. In: Proc. of TPPP ’94. Springer-Verlag Lecture Notes in Computer Science 907.