Behavioural equivalence for a graph rewriting model of concurrent programs Online publication date: Wed, 31-Mar-2010
by Masaki Murakami
World Review of Science, Technology and Sustainable Development (WRSTSD), Vol. 7, No. 1/2, 2010
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 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.
Online publication date: Wed, 31-Mar-2010
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the World Review of Science, Technology and Sustainable Development (WRSTSD):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com