We present lock-free and wait-free universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object state, which is impractical for large objects. Previous attempts to address this problem require programmers

This paper presents two classes of universal constructs that occur in distributed computations and explores their properties. It first examines a pair of universal constructs termed IO and OI intervals that occur at nodes in distributed computations. These universal constructs are used as building

Abstract. A universal construction is an algorithm which transforms any sequential implementation of an object into a concurrent implemen-tation of that same object in a linearizable and wait-free manner. Such constructions require underlying low-level universal shared objects such as compare

. This paper presents the overall structure, the design criteria, and the main features of the tool box Uppaal. It gives a detailed user guide which describes how to use the various tools of Uppaal version 2.02 to construct abstract models of a real-time system, to simulate its dynamical behavior

Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97

Abstract not found

-varying input that provides an alternative to paradigms based on Turing machines or attractor neural networks. It does not require a task-dependent construction of neural circuits. Instead it is based on principles of high dimensional dynamical systems in combination with statistical learning theory, and can

Modern umbral calculus is steadily approaching maturity, as applications develop in several areas of mathematics. To maximize this utility it is important to work in the most general (as opposed to the most abstract)

We present wait-free and lock-free universal constructions that allow operations to access multiple objects atomically. Such constructions provide functionality similar to nested critical sections in conventional, lockbased systems. In such a system, two critical sections might be nested

-species framework for construction of collective potentials that consist of flock-members, or α-agents, and virtual agents associated with α-agents called β- and γ-agents. We show that migration of flocks can be performed using a peer-to-peer network of agents, i.e. “flocks need no leaders.” A “universal