Related papers: Synchrony vs Causality in the Asynchronous Pi-Calc…
An analysis of transition from chaotic to nonchaotic behavior and synchronization in an ensemble of systems driven by identical random forces is presented. The synchronization phenomenon is investigated in the ensemble of particles moving…
In this paper we propose an algebra of synchronous scheduling interfaces which combines the expressiveness of Boolean algebra for logical and functional behaviour with the min-max-plus arithmetic for quantifying the non-functional aspects…
Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies.…
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components, as well as communications between these components. Moreover, to model concurrent and…
Identifying causal relationships is a challenging yet crucial problem in many fields of science like epidemiology, climatology, ecology, genomics, economics and neuroscience, to mention only a few. Recent studies have demonstrated that…
We introduce a novel approach to studying properties of processes in the {\pi}-calculus based on a processes-as-formulas interpretation, by establishing a correspondence between specific sequent calculus derivations and computation trees in…
The mechanism of phase synchronization between uncoupled limit-cycle oscillators induced by common external impulsive forcing is analyzed. By reducing the dynamics of the oscillator to a random phase map, it is shown that phase…
Coupled oscillator networks often display transitions between qualitatively different phase-locked solutions -- such as synchrony and rotating wave solutions -- following perturbation or parameter variation. In the limit of weak coupling,…
Synchronization is studied in an array of identical oscillators undergoing small vibrations. The overall coupling is described by a pair of matrix-weighted Laplacian matrices; one representing the dissipative, the other the restorative…
Probabilistic couplings are the foundation for many probabilistic relational program logics and arise when relating random sampling statements across two programs. In relational program logics, this manifests as dedicated coupling rules…
Dynamic techniques are a scalable and effective way to analyze concurrent programs. Instead of analyzing all behaviors of a program, these techniques detect errors by focusing on a single program execution. Often a crucial step in these…
In this work, we investigate the synchronization in oscillators with conjugate coupling in which oscillators interact via dissimilar variables. The synchronous dynamics and its stability are investigated theoretically and numerically. We…
Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a…
In nature, instances of synchronisation abound across a diverse range of environments. In the quantum regime, however, synchronisation is typically observed by identifying an appropriate parameter regime in a specific system. In this work…
This work is devoted to the problem of synchronization of two Morris-Lecar neuron models. The Morris-Lecar model is a second-order system of differential equations, which describes an uneasy relationship between the membrane potential and…
Detecting deadlocks in MPI synchronization communication programs is very difficult and need building program models. All complex models are based on sequential models. The sequential model is mapped into a set of character strings and its…
We investigate a transition from chaotic to nonchaotic behavior and synchronization in an ensemble of systems driven by identical random forces. We analyze the synchronization phenomenon in the ensemble of particles moving with friction in…
There are three key factors of a system of coupled oscillators that characterize the interaction among them: coupling (how to affect), delay (when to affect) and topology (whom to affect). For each of them, the existing work has mainly…
The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized by the final morphism in some category of coalgebras. Since…
We introduce a new criterion, replacement freeness, to discern the relative expressiveness of process calculi. Intuitively, a calculus is strongly replacement free if replacing, within an enclosing context, a process that cannot perform any…