In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Verification that agent communication protocols have desirable properties or do not have undesirable properties is an important issue in agent systems where agents intend to commu...
Katie Atkinson, Roderic A. Girle, Peter McBurney, ...
CoMex (Coordination Mechanism) is a system to coordinate the execution of tasks accessing coordinable entities. It uses coordination rules to describe the temporal and logical orde...
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on ...