Theoretical Computer Science
ACM SIGACT News
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
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Evolvable concurrent processes
Computer Standards & Interfaces - Special issue: Adaptable software architectures
A formal model of concurrent systems based on bipartite directed acyclic graph
Science of Computer Programming - Special issue on quality system and software architectures
Hi-index | 0.00 |
This paper presents a formal model of runtime program transformation to optimize concurrent processes during executions based on a new representation of the scopes of names in distributed systems. We represent a site in a distributed system and the scopes of the local names in the site using a directed acyclic graph. It is possible to represent local names that their scope are not nested in a site in the model. Local names with overlapping scopes make possible to formalize folding transformation of process definitions for runtime program transformation. Computations in the system are represented with inferences on multisets of formulas of linear logic. We define rewriting system of directed acyclic graphs as the operational semantics of our model based on inference rules for linear logic. Each of the steps for runtime transformations are also represented using a rewriting for directed acyclic graphs.