Congruence results of behavioral equivalence for a graph rewriting model of concurrent programs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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 the weak bisimulation equivalence relation that two systems are equivalent in their behavior. We show that the equivalence relation is a congruence relation wrt prefix, new-name, replication and composition.

Original languageEnglish
Title of host publication5th International Conference on Information Technology and Applications, ICITA 2008
Pages636-641
Number of pages6
Publication statusPublished - 2008
Event5th International Conference on Information Technology and Applications, ICITA 2008 - Cairns, QLD, Australia
Duration: Jun 23 2008Jun 26 2008

Other

Other5th International Conference on Information Technology and Applications, ICITA 2008
CountryAustralia
CityCairns, QLD
Period6/23/086/26/08

Fingerprint

Semantics
Chemical analysis

Keywords

  • π-calculus
  • Bisimilarity
  • Graph rewriting
  • Parallel And distributed computing
  • Theory of concurrency

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Information Systems
  • Software

Cite this

Murakami, M. (2008). Congruence results of behavioral equivalence for a graph rewriting model of concurrent programs. In 5th International Conference on Information Technology and Applications, ICITA 2008 (pp. 636-641)

Congruence results of behavioral equivalence for a graph rewriting model of concurrent programs. / Murakami, Masaki.

5th International Conference on Information Technology and Applications, ICITA 2008. 2008. p. 636-641.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Murakami, M 2008, Congruence results of behavioral equivalence for a graph rewriting model of concurrent programs. in 5th International Conference on Information Technology and Applications, ICITA 2008. pp. 636-641, 5th International Conference on Information Technology and Applications, ICITA 2008, Cairns, QLD, Australia, 6/23/08.
Murakami M. Congruence results of behavioral equivalence for a graph rewriting model of concurrent programs. In 5th International Conference on Information Technology and Applications, ICITA 2008. 2008. p. 636-641
Murakami, Masaki. / Congruence results of behavioral equivalence for a graph rewriting model of concurrent programs. 5th International Conference on Information Technology and Applications, ICITA 2008. 2008. pp. 636-641
@inproceedings{47bd5e6a2ebc443daac2f06e52e806aa,
title = "Congruence results of behavioral equivalence for a graph rewriting model of concurrent programs",
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 the weak bisimulation equivalence relation that two systems are equivalent in their behavior. We show that the equivalence relation is a congruence relation wrt prefix, new-name, replication and composition.",
keywords = "π-calculus, Bisimilarity, Graph rewriting, Parallel And distributed computing, Theory of concurrency",
author = "Masaki Murakami",
year = "2008",
language = "English",
isbn = "9780980326727",
pages = "636--641",
booktitle = "5th International Conference on Information Technology and Applications, ICITA 2008",

}

TY - GEN

T1 - Congruence results of behavioral 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 the weak bisimulation equivalence relation that two systems are equivalent in their behavior. 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 the weak bisimulation equivalence relation that two systems are equivalent in their behavior. We show that the equivalence relation is a congruence relation wrt prefix, new-name, replication and composition.

KW - π-calculus

KW - Bisimilarity

KW - Graph rewriting

KW - Parallel And distributed computing

KW - Theory of concurrency

UR - http://www.scopus.com/inward/record.url?scp=67649235970&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67649235970&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:67649235970

SN - 9780980326727

SP - 636

EP - 641

BT - 5th International Conference on Information Technology and Applications, ICITA 2008

ER -