An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
We present two algorithms that can be used to check whether a given holomorphic foliation of the projective plane has an algebraic solution, and discuss the performance of their im...
While symmetry reduction has been established to be an important technique for reducing the search space in model checking, its application in concurrent software verification is ...
Abstract. This paper provides a novel mechanism to check whether business processes are compliant with business rules regulating them. The key point is that compliance is a relatio...
Synchronous systems can immediately react to the inputs of their environment which may lead to so-called causality cycles between actions and their trigger conditions. Systems wit...