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 - Dec 1 2008
Event5th International Conference on Information Technology and Applications, ICITA 2008 - Cairns, QLD, Australia
Duration: Jun 23 2008Jun 26 2008

Publication series

Name5th International Conference on Information Technology and Applications, ICITA 2008

Other

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

Keywords

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

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Congruence results of behavioral equivalence for a graph rewriting model of concurrent programs'. Together they form a unique fingerprint.

  • 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). (5th International Conference on Information Technology and Applications, ICITA 2008).