Barbara König  Home/Search
Context
Related
| flop.informatik.tu...raphpifull.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wwwbrauer.informatik.tumue...all (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We give a hypergraph rewriting semantics for the polyadic -calculus, based on rewriting rules equivalent to those in the double-pushout approach. The structural congruence of the -calculus is replaced by hypergraph isomorphism. The correctness of the encoding from the graph-based notation into -calculus can be shown by using an intermediate notation, so-called name-based graph terms, which form a bridge from graphs with explicit connections (by fusing nodes) to process calculi with implicit ... (Update)
Similar documents (at the sentence level):
21.1%: A Graph Rewriting Semantics for the Polyadic pi-Calculus - König (2000) (Correct)
7.0%: Hypergraph Construction and Its Application to the Compositional.. - König (2000) (Correct)
Active bibliography (related documents): More All
0.8: A General Framework for Types in Graph Rewriting - König (2000) (Correct)
0.2: Description and Verification of Mobile Processes with Graph.. - König (Correct)
0.2: Deriving Bisimulation Congruences in the DPO Approach to Graph .. - Ehrig, König (2004) (Correct)
Similar documents based on text: More All
0.4: Observational Equivalence for Synchronized Graph Rewriting.. - König, Montanari (2001) (Correct)
0.3: Sahlqvist Formulas in Hybrid Polyadic Modal Logics - Goranko, Vakarelov (2000) (Correct)
0.3: Graph Types For Monadic Mobile Processes - Yoshida (1996) (Correct)
BibTeX entry: (Update)
@misc{ nig-graph,
author = "Barbara König",
title = "A Graph Rewriting Semantics for the Polyadic π-Calculus (Extended Version)",
url = "citeseer.ist.psu.edu/273630.html" }
Citations (may not include all citations):254 Theoretical Computer Science (context) - erard, erard et al. - 1992 ACM
197 Barbed bisimulation - Milner, Sangiorgi - 1992 ACM DBLP
149 calculus: a tutorial (context) - Milner - 1993
64 Cambridge University Press (context) - Crole, Types - 1993
61 The fusion calculus: Expressiveness and symmetry in mobile p.. - Parrow, orn - 1998 DBLP
43 Hyperedge Replacement: Grammars and Languages (context) - Habel - 1992
26 Mathematical Systems Theory (context) - Bauderon, Courcelle et al. - 1987 ACM
24 Communicating and Mobile Systems: the -Calculus (context) - Milner - 1999
22 Graph notation for concurrent combinators - Yoshida - 1994 ACM DBLP
19 Information and Computation (context) - Lafont - 1997 DBLP
17 Graph rewriting and constraint solving for modelling distrib.. - Montanari, Rossi - 1996
13 Theoretical Computer Science (context) - Gardner, calculi - 1998 ACM
10 Introduction to the algebraic theory of graphs (context) - Ehrig - 1979
8 Generating type systems for process graphs - onig - 1999 ACM DBLP
6 Hypergraph construction and its application to the compositi.. - onig - 2000
5 Electronic Notes in Theoretical Computer Science (context) - Montanari, Pistore et al. - 1995
3 A graph rewriting semantics for the polyadic pi-calculus (context) - onig - 2000
Documents on the same site (http://wwwbrauer.informatik.tu-muenchen.de/gruppen/theorie/publications/all.html): More
Analysing Input/Output-Capabilities of Mobile Processes with a.. - König (Correct)
New Worst-Case Upper Bounds for MAX-2-SAT with.. - Gramm, Hirsch.. (2000) (Correct)
Efficient Algorithms for Model Checking Pushdown Systems - Esparza, Hansel.. (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC