Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Abstract. We give a process calculus model that formalizes a wellknown algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failur...
Abstract— We consider networks of input-to-state dynamically stable (ISDS) systems and provide a small gain condition under which the entire network is again ISDS. A Lyapunov for...
Abstract. Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connect...