Autonomous Units and Their Semantics - The Parallel Case

Abstract

Communities of autonomous units are rule-based and graph-transformational devices to model data-processing systems that may consist of distributed and mobile components. The components may communicate and interact with each other, they may link up to ad-hoc networks. In this paper, we introduce and investigate the parallel-process semantics of communities of autonomous units.

Graph Transformation Units – An Overview

“…In this sense, a graph transformation unit is a centralized computational entity. The concept of autonomuous units (see, e.g., [26][27][28]) is a generalization to a decentralized processing of graphs. The autonomuous units in a community act, interact, and communicate in a common environment, with each of them controling its own activities autonomuously.…”

Communities of Autonomous Units for Pickup and Delivery Vehicle Routing

“…In [4] a sequential semantics is given, but it is not fully adequate for the pickup and delivery problem because several trucks may move simultaneously and several packages may be loaded and reloaded at the same time. Hence, we adopt the parallel semantics introduced in [9]. But since private states and used transformation units were not considered in [9], we have to generalize the parallel semantics.…”

“…Hence, we adopt the parallel semantics introduced in [9]. But since private states and used transformation units were not considered in [9], we have to generalize the parallel semantics.…”

“…Every infinite transformation process is successful if it contains infinitely many states that satisfy the goal (see [9] for more details).…”

“…To keep the paper technically simple, we introduce autonomous units in a rather informal way. Formal descriptions can be found in [4,9]. Nevertheless, it is worth noting that autonomous units as presented in the following are more sophisticated than those of previous papers because private states have not been considered before.…”