Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...

In this report we review the current state of concurrency theory with respect to its industrial impact. This review is both retrospective and prospective, and naturally encompasses process calculi, which are a major vector for spreading concurrency theory concepts. Considering the achievements, but also the failures, we try to identify the causes that, so far, prevented a larger dissemination o...

The classical theory of transaction management contains two different aspects, namely concurrency control and recovery, which ensure serializability and atomicity of transaction executions, respectively. Although concurrency control and recovery are not independent of each other, the criteria for these two aspects were developed orthogonally and as a result, in most cases these criteria are inc...

The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic reenement, Lolli 15], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) 2] pr...

The veriication of multi agent systems is an important and diicult task. Though much work is spent on veriication in concurrency theory only few results and tools are used in multi-agent systems. In this paper, we investigate how CCS, the calculus for concurrent systems, may contribute to the veriication of multi-agent systems. We review an architecture for a diagnosis agent and show how the to...

The veriication of multi agent systems is an important and diicult task. Though much work is spent on veriication in concurrency theory only few results and tools are used in multi-agent systems. In this paper, we investigate how CCS, the calculus for concurrent systems, may contribute to the veriication of multi-agent systems. We review an architecture for a diagnosis agent and show how the to...

The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic re nement, Lolli [13], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2] ...

This paper describes how concurrency, distribution and object orientation can be expressed in map theory, using a subset of the Emerald language as an example. In particular the paper covers parallelism in which a created process can continue to run after the creating process halts. The semantics is presented in a continuation passing style in map theory. Map theory is a foundation of mathemati...