Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
We present an algorithm for the linearization of hybrid processes modeled in hybrid process algebra (HyPA) and prove its correctness. HyPA is a formalism that is suitable for the ...
P. C. W. den Brand van, Michel A. Reniers, Pieter ...
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
We present a formal model for qualitative spatial reasoning with cardinal directions utilizing a co-ordinate system. Then, we study the problem of checking the consistency of a se...