A formal model of concurrent systems based on bipartite directed acyclic graph

Authors:
Masaki Murakami
Affiliations:
Department of Information and Communication Systems, Graduate School of Natural Science and Technology, Okayama University, Okayama, Japan
Venue:
Science of Computer Programming - Special issue on quality system and software architectures
Year:
2006

Citing 6
Cited 1

The chemical abstract machine

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interaction nets

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
A Calculus of Mobile Agents

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A model of runtime transformation for distributed systems based on directed acyclic graph model

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Adaptable system/Software architectures

Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

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.