Behavioural equivalence for a graph rewriting model of concurrent programs

Research output: Contribution to journalArticlepeer-review


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 labelled transition system. The model presented here makes it possible to represent local names that their scope is not nested. The author defines the weak bisimulation equivalence relation that two systems are equivalent in their behaviours. The author shows that the equivalence relation is a congruence relation wrt prefix, new-name, replication and composition.

Original languageEnglish
Pages (from-to)169-180
Number of pages12
JournalWorld Review of Science, Technology and Sustainable Development
Issue number1-2
Publication statusPublished - Mar 2010


  • Bisimilarity
  • Distributed computing
  • Graph rewriting
  • Theory of concurrency
  • π-calculus

ASJC Scopus subject areas

  • General


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

Cite this