In previous work we have proposed a correct-by-construction approach for building
deadlock-free CSP models. It contains a comprehensive set of composition rules that …

Nowadays, multi-threaded programs are quite common and so are concurrency-related
errors. Many works devoted to detection of concurrency errors have been published in …

In a process algebra with hiding and recursion it is possible to create processes which
compute internally without ever communicating with their environment. Such processes are …

Self-stabilization is a property of a distributed system such that, regardless of the legitimacy
of its current state, the system behavior shall eventually reach a legitimate state and shall …

In a process algebra with hiding and recursion it is possible to create processes which
compute internally without ever communicating with their environment. Such processes are …

The execution of a reactive system amounts to the repetitions of executions of control flow
cycles in the component processes of the system. The way in which cycle executions are …

In this paper we present algorithms to statically detect livelocks in Ada multitasking
programs. Although the algorithms' worst-case execution time is exponential, they can be …

Asynchronous reactive systems form the basis of a wide range of software systems, for
instance in the telecommunications domain. It is highly desirable to rigorously show that …

V dnešní době jsou vícevláknové programy běžné as nimi i chyby v souběžnosti. Během
posledních let bylo vytvořeno mnoho technik pro detekci takovýchto chyb, ai přesto mají …

Model checking is an automatic formal verification technique for establishing correctness of
systems. It has been widely used in industry for analysing and verifying complex safety …