Architectures depict design principles: paradigms that can be understood by all, allow
thinking on a higher plane and avoiding low-level mistakes. They provide means for …

We build upon established techniques of deadlock analysis by formulating a new sound but
incomplete framework for deadlock freedom analysis that tackles some sources of …

Distributed systems often rely on token structures to avoid undesired states and behave
correctly. While conservative token structures ensure that a fixed number of tokens exist at …

This article investigates how the use of approximations can make the formal verification of
concurrent systems scalable. We propose the idea of synchronisation analysis to …

We present two methods for synthesizing large concurrent programs from temporal logic
specifications. The first method deals with finite-state concurrent programs that are static, ie …

We combine a prior incomplete deadlock-freedom-checking approach with two new
reachability techniques to create a more precise deadlock-freedom-checking framework for …

We present a criterion for checking local and global deadlock freedom of finite state systems
expressed in BIP: a component-based framework for constructing complex distributed …

Many disciplines have adopted component-based principles to avail themselves of the many
advantages they bring, especially component reusability. In a short time, the component …

Local analysis has long been recognised as an effective tool to combat the state-space
explosion problem. In this work, we propose a method that systematises the use of local …

Many distributed systems rely on token structures for their correct operation. Often, these
structures make sure that a fixed number of tokens exists at all times, or perhaps that tokens …