We present an original method for generating monitors that capture the occurrence of events, specified by logical and temporal properties under the form of assertions in declarati...
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
We present an algorithm for finding uniform strategies in multi-agent systems with incomplete information. The algorithm finds all maximal uniform strategies for agents with incomp...
Jan Calta, Dmitry Shkatov, Bernd-Holger Schlinglof...
: Secure distributed systems rely on secure information flow between different hosts, thus placing a heavy requirement on the underlying security protocols. In this paper, we use S...