Related papers: Formalization of Phase Ordering
We address the problem of statically checking safety properties (such as assertions or deadlocks) for parameterized phaser programs. Phasers embody a non-trivial and modern synchronization construct used to orchestrate executions of…
We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern…
Though the notion of phase synchronization has been well studied in chaotic dynamical systems without delay, it has not been realized yet in chaotic time-delay systems exhibiting non-phase coherent hyperchaotic attractors. In this article…
We study the effect of structured higher-order interactions on the collective behavior of coupled phase oscillators. By combining a hypergraph generative model with dimensionality reduction techniques, we obtain a reduced system of…
We investigate the processes of synchronization and phase ordering in a system of globally coupled maps possessing bistable, chaotic local dynamics. The stability boundaries of the synchronized states are determined on the space of…
We explore asynchronous programming with algebraic effects. We complement their conventional synchronous treatment by showing how to naturally also accommodate asynchrony within them, namely, by decoupling the execution of operation calls…
The scheduling of task graphs with communication delays has been extensively studied. Recently, new results for the common sub-case of fork-join shaped task graphs were published, including an EPTAS and polynomial algorithms for special…
Asynchronous programming has appeared as a programming style that overcomes undesired properties of concurrent programming. Typically in asynchronous models of programming, methods are posted into a post list for latter execution. The order…
We present an approach which enables to identify phase synchronization in coupled chaotic oscillators without having to explicitly measure the phase. We show that if one defines a typical event in one oscillator and then observes another…
We present a rigorous mathematical framework establishing the equivalence of four classical notions of synchronization full phase-locking, phase-locking, frequency synchronization, and order parameter synchronization in generalized Kuramoto…
Phase synchronization refers to a kind of collective phenomenon that the phase difference between two or more systems is locked, and it has widely been investigated between systems with the identical physical properties, such as the…
This paper surveys and describes the implementation of parallelization of the Mizar proof checking and of related Mizar utilities. The implementation makes use of Mizar's compiler-like division into several relatively independent passes,…
To design efficient parallel algorithms, some recent papers showed that many sequential iterative algorithms can be directly parallelized but there are still challenges in achieving work-efficiency and high-parallelism. Work-efficiency can…
Networks in which the processing of jobs occurs both sequentially and in parallel are prevalent in many application domains, such as computer systems, healthcare, manufacturing, and project management. The parallel processing of jobs gives…
In this paper we report for the first time on the necessity of the refinement of the concept of generalized chaotic synchronization. We show that the state vectors of the interacting chaotic systems being in the generalized synchronization…
In this article, we study some parallel processing algorithms for multiplication and modulo operations. We demonstrate that the state transitions that are formed under these algorithms satisfy lattice-linearity, where these algorithms…
Parallel computing has turned out to be the enabling technology to solve complex physical systems. However, the transition from shared memory, vector computers to massively parallel, distributed memory systems and, recently, to hybrid…
In this paper we study the notion of synchronization from the point of view of combinatorics. As a first step, we address the quantitative problem of counting the number of executions of simple processes interacting with synchronization…
Higher-order functions and imperative states are language features supported by many mainstream languages. Their combination is expressive and useful, but complicates specification and reasoning, due to the use of yet-to-be-instantiated…
The equivalence of the Rivier-Margenau-Hill and Born-Jordan-Shankara phase space formalisms to the conventional operator approach of quantum mechanics is demonstrated. It is shown that in spite of the presence of singular kernels the…