We consider the distributed control problem in the setting of Zielonka asynchronous
automata. Such automata are compositions of finite processes communicating via shared …

We consider information dissemination over a network of gossiping agents. In this model, a
source keeps the most up-to-date information about a time-varying binary state of the world …

The distributed synthesis problem is about constructing cor-rect distributed systems, ie,
systems that satisfy a given specification. We consider a slightly more general problem of …

In this paper we have attempted an overview of linear time temporal logics interpreted over
traces. We have mainly concentrated on the satisfiability and model checking problems as …

We propose a local, past-oriented fragment of propositional dynamic logic to reason about
concurrent scenarios modelled as Mazurkiewicz traces, and prove it to be expressively …

Synthesis is a particularly challenging problem for concurrent programs. At the same time it
is a very promising approach, since concurrent programs are difficult to get right, or to …

Eventual consistency is a relaxation of strong consistency that guarantees that if no new
updates are made to a replicated data object, then all replicas will converge. The conflict …

Asynchronous automata are parallel compositions of finite-state processes synchronizing
over shared variables. A deep theorem due to Zielonka says that every regular trace …

This thesis has two main objects of study, closely related to each other. On the one hand, we
provide and study models for asynchronous transmission and reception of messages. To do …

We introduce and study a PDL-style logic for reasoning about protocols, or plans, under
imperfect information. Our paper touches on a number of issues surrounding the relationship …