Cherkasova, L.A., and V.E. Kotov, An algebra of concurrent nondeterminstic processes, Theoretical Computer Science 90 (1991) 151-170. This paper illustrates how early ideas and simple naive concepts of concurrency theory of the 1960s have now turned into complex and subtle problems of modern calculi of concurrent processes. An algebra of finite processes AFP, is discussed as an example of resea...

This thesis shows how the mathematical tbeory of Timed Communicating Sequen­ tial Processes (Timed CSP) developed by Reed and Roscoe may be applied to the specification and proof of complex real-time systems. A number of substantial additions are made to the theory, producing a powerful tool for the analysis and implementation of timing requirements and concurrency. The syntax and semantics of ...

This paper studies algebraic models for concurrency, in light of recent work on Concurrent Kleene Algebra and Separation Logic. It establishes a strong connection between the Concurrency and Frame Rules of Separation Logic and a variant of the exchange law of Category Theory. We investigate two standard models: one uses sets of traces, and the other is state-based, using assertions and weakest ...

We study probabilistic safe Petri nets, a probabilistic extension of safe Petri nets interpreted under the true-concurrent semantics. In particular, the likelihood of processes is defined on partial orders, not on firing sequences. We focus on memoryless probabilistic nets: we give a definition for such systems, that we call Markov nets, and we study their properties. We show that several tools...

We consider whether techniques from concurrency theory can be applied in the area of Cognitive Neuroscience. We focus on two potential applications. The first of these explores structural decomposition, which is effectively assumed by the localisation of function metaphor that so dominates current Cognitive Neuroscience. We take concurrency theory methods, especially Process Calculi, as canonic...

An important characteristic of concurrency control mechanisms is the level of concurrency that they support. In this paper, we study this problem in the context of non-two-phase locking protocols which are defined for data bases in which a directed acyclic graph structure is superimposed on the data items. A new lock mode is introduced called INV, with properties fundamentally different from lo...

Transaction management in shared databases is generally viewed as a combination of two problems, concurrency control and recovery, which have been considered as orthogonal problems. Consequently, the correctness criteria derived for these problems are incomparable. Recently a uniied theory of concurrency control and recovery has been introduced that is based on com-mutativity and performs trans...

Besides the features of a class-based object-oriented language, Java integrates concurrency via its thread-classes, allowing for a multithreaded flow of control. Besides that, the language offers a flexible exception mechanism for handling errors or exceptional program conditions. To reason about safety-properties of Java-programs and extending previous work on the proof theory for monitor sync...