Abstract
This paper presents a formal model of concurrent systems to represent scopes of communication channel names precisely. The model presented here is an extension of a multiset rewriting system. A bipartite directed acyclic graph represents a concurrent system consisting of a number of processes and messages. Each process or message corresponds to a source node of the graph. Names used for 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 extrusions of scopes of names.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
