The amoebot model abstracts active programmable matter as a collection of simple computational elements called amoebots that interact locally to collectively achieve tasks coordination and movement. Since its introduction at SPAA 2014, growing body literature has adapted assumptions for variety problems; however, without standardized hierarchy assumptions, precise systematic comparison results ...

Various concurrency control algorithms have been proposed for use in distributed database systems. But, the number of algorithms available for the distributed concurrency control, come into one of three basic classes: locking algorithms, Timestamp algorithms and optimistic (or certification) algorithms. In this paper we are presenting a Distributed Transaction Processing Model and an approach f...

PRCS is an attempt to provide a version-control system for collections of les with a simple operational model, a clean user interface, and high performance. PRCS is characterized by the use of project description les to input most commands, instead of a point-and-click or a line-oriented interface. It employs optimistic concurrency control and encourages operations on the entire project rather ...

the large number of applications manages time varying data. existing databasetechnology seldom supports temporal database, tdb, according to time aspects.these intrinsic temporal database applications rely on such database which storesand retrieves time referenced data. moreover, applications need to be managed oncommon data items access simultaneously and to be precluded from inconsistencyas s...

This study proposes DC-ROLL, a new approach to concurrency control in a distributed environment based on the Request Order Linked List (ROLL) [P91] and the Datacycle architecture [H+87]. DC-ROLL allows for more flexibility in levels of concurrency and avoids certain performance bottlenecks of the traditional two-phase locking. Unlike the original Datacycle architecture where the entire database...

Coalgebra is used to generalize notions and techniques from concurrency theory, in order to apply them to problems concerning the supervisory control of discrete event systems. The main ingredients of this approach are the characterization of controllability in terms of (a variant of) the notion of bisimulation, and the observation that the family of (partial) languages carries a final coalgebr...