We introduce the concept of an operating guideline for an arbitrary finite-state service P , extending the work of [1, 2] which was restricted to acyclic services. An operating guideline gives complete information about how to correctly (in this paper: deadlock-free) communicate with P . It can further be executed or used for service discovery. An operating guideline for P is a particular servi...

This paper develops the theoretical background for the design of deadlock-free adaptive routing algorithms for virtual cut-through and store-and-forward switching. This theory is valid for networks using either central buffers or edge buffers. Some basic definitions and three theorems are proposed, developing conditions to verify that an adaptive algorithm is deadlock-free, even when there are ...

The connguration programming approach has been successfully applied to model parallel and distributed systems in terms of their component processes and relationships, separated from the functional aspects of the components' behaviour. This approach promotes the construction of modular and exible systems but the lack of information about the components' behaviour prevents us verifying important ...

In this paper we consider the problem of creating minimal, deadlock-free routing algorithms, where a routing algorithm is said to be minimal if it uses only shortest paths. In particular, we examine the possibility of creating scalable algorithms that use only a constant number of buuers per node. Minimal, scalable, deadlock-free routing algorithms are known for many important networks includin...

Reasoning about concurrent programs is challenging, especially if data shared among threads. Program correctness can be violated by the presence of races—whose prevention has been a topic concern both in research and practice. The Rust programming language prime example, putting slogan fearless concurrency practice not only employing an ownership-based type system for memory management, but als...