Related papers: On the k-synchronizability of systems
Communication is an essential element of modern software, yet programming and analysing communicating systems are difficult tasks. A reason for this difficulty is the lack of compositional mechanisms that preserve relevant communication…
Suitable reachability conditions can make two different fixed point semantics of a transition system coincide. For instance, the total and partial expected reward semantics on Markov chains (MCs) coincide whenever the MC at hand is almost…
Deterministic synchronous systems consisting of two finite automata running in opposite directions on a shared read-only input are studied with respect to their ability to perform reversible computations, which means that the automata are…
In this report, we develop a semistability analysis framework for nonlinear systems with bounded time-varying delays with applications to stability analysis of multiagent dynamic networks with consensus protocols in the presence of unknown…
This paper considers the problem of designing a dynamical system to solve constrained optimization problems in a distributed way and in an anytime fashion (i.e., such that the feasible set is forward invariant). For problems with separable…
For k>=1, we consider the graph dynamical system known as a k-reversible process. In such process, each vertex in the graph has one of two possible states at each discrete time. Each vertex changes its state between the present time and the…
An interesting problem in synchronization is the study of coupled oscillators, wherein oscillators with different natural frequencies synchronize to a common frequency and equilibrium phase difference. In this paper, we investigate the…
Synchronization is a phenomenon where interacting particles lock their motion and display non-trivial dynamics. Despite intense efforts studying synchronization in systems without clear classical limits, no comprehensive theory has been…
We consider the problem of exact synchronization of two rankings at remote locations connected by a two-way channel. Such synchronization problems arise when items in the data are distinguishable, as is the case for playlists, tasklists,…
We treat synchronization for iterated function systems generated by diffeomorphisms on compact manifolds. Synchronization here means the convergence of orbits starting at different initial conditions when iterated by the same sequence of…
Multi-stack pushdown systems are a well-studied model of concurrent computation using threads with first-order procedure calls. While, in general, reachability is undecidable, there are numerous restrictions on stack behaviour that lead to…
Using elementary rigorous methods we prove the existence of a clustered phase in the random $K$-SAT problem, for $K\geq 8$. In this phase the solutions are grouped into clusters which are far away from each other. The results are in…
Two chaotic systems which interact by mutually exchanging a signal built from their delayed internal variables, can synchronize. A third unit may be able to record and to manipulate the exchanged signal. Can the third unit synchronize to…
Communicating finite-state machines (CFMs) are a Turing powerful model of asynchronous message-passing distributed systems. In weakly synchronous systems, processes communicate through phases in which messages are first sent and then…
In this paper, the relationship between notions of observability for continuous-time nonlinear system related to distinguishability, observability rank condition and K-function has been investigated. It is proved that an autonomous…
This article studies the synchronization problem of complex dynamical networks. The impulsive control method is considered with a novel event-triggered pinning algorithm. Sufficient conditions on the network topology are obtained to ensure…
In this paper, we study asynchronous consensus problems of continuous-time multi-agent systems with discontinuous information transmission. The proposed consensus control strategy is implemented only based on the state information at some…
We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over unbounded FIFO channels. Each automaton can only access its…
Coordinating the motion of multiple agents in constrained environments is a fundamental challenge in robotics, motion planning, and scheduling. A motivating example involves $n$ robotic arms, each represented as a line segment. The…
We consider the model of parametrized asynchronous shared-memory pushdown systems, as introduced in [Hague'11]. In a series of recent papers it has been shown that reachability in this model is PSPACE-complete [Esparza, Ganty, Majumdar'13]…