Abstract
This paper presents a formal model of concurrent systems based on graph rewriting to represent scopes of communication channel names precisely. A bipartite directed acyclic graph represents a concurrent system consists of a number of processes and messages. Each process or message corresponds to a source node of the graph. Names of communication channel in the system are sink nodes. The edges of the graph represent the scopes of the names in the system. The operational semantics of the system is given as a labeled transition system. The model presented here makes it possible to represent local names that their scope are not nested. We define an equivalence relation that two systems are equivalent not only in their behavior but in extrusions of scopes of names. We show that the equivalence relation is a congruence relation wrt prefix, new-name, replication and composition.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 243-257 |
| Number of pages | 15 |
| Volume | 5160 LNCS |
| DOIs | |
| Publication status | Published - 2008 |
| Event | 5th International Colloquium on Theoretical Aspects of Computing, ICTAC 2008 - Istanbul, Turkey Duration: Sep 1 2008 → Sep 3 2008 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 5160 LNCS |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 5th International Colloquium on Theoretical Aspects of Computing, ICTAC 2008 |
|---|---|
| Country | Turkey |
| City | Istanbul |
| Period | 9/1/08 → 9/3/08 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Theoretical Computer Science
Cite this
Congruence results of scope equivalence for a graph rewriting model of concurrent programs. / Murakami, Masaki.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5160 LNCS 2008. p. 243-257 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5160 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Congruence results of scope equivalence for a graph rewriting model of concurrent programs
AU - Murakami, Masaki
PY - 2008
Y1 - 2008
N2 - This paper presents a formal model of concurrent systems based on graph rewriting to represent scopes of communication channel names precisely. A bipartite directed acyclic graph represents a concurrent system consists of a number of processes and messages. Each process or message corresponds to a source node of the graph. Names of communication channel in the system are sink nodes. The edges of the graph represent the scopes of the names in the system. The operational semantics of the system is given as a labeled transition system. The model presented here makes it possible to represent local names that their scope are not nested. We define an equivalence relation that two systems are equivalent not only in their behavior but in extrusions of scopes of names. We show that the equivalence relation is a congruence relation wrt prefix, new-name, replication and composition.
AB - This paper presents a formal model of concurrent systems based on graph rewriting to represent scopes of communication channel names precisely. A bipartite directed acyclic graph represents a concurrent system consists of a number of processes and messages. Each process or message corresponds to a source node of the graph. Names of communication channel in the system are sink nodes. The edges of the graph represent the scopes of the names in the system. The operational semantics of the system is given as a labeled transition system. The model presented here makes it possible to represent local names that their scope are not nested. We define an equivalence relation that two systems are equivalent not only in their behavior but in extrusions of scopes of names. We show that the equivalence relation is a congruence relation wrt prefix, new-name, replication and composition.
UR - http://www.scopus.com/inward/record.url?scp=51849169422&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51849169422&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-85762-4_17
DO - 10.1007/978-3-540-85762-4_17
M3 - Conference contribution
SN - 3540857613
SN - 9783540857617
VL - 5160 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 243
EP - 257
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -