Specifications are a development process’ lifeblood. Capturing the designers’ intentions regarding functionality, interface, test targets, and other aspects, they establish the correct context in design communication, development, and verification amongst other steps like synthesis. A specification’s quality is thus a crucial factor. Recently we showed a way to exploit model-based diagnosis for...

We describe an efficient implementation of Edmonds’ algorithm for finding minimum directed spanning trees in directed graphs. 1 Minimum Directed Spanning Trees Let G = (V,E,w) be a weighted directed graph, where w : E → R is a cost (or weight) function defined on its edges. Let r ∈ V . A directed spanning tree (DST) of G rooted at r, is a subgraph T of G such that the undirected version of T is...

Quasi-alphabetic tree bimorphisms [Steinby and Tîrn uc : Syntax-Directed Translations and Quasi-Alphabetic Tree Bimorphisms. Proc. CIAA, LNCS 4783:265 276, 2007] are reconsidered. It is known that the class of (string) translations de ned by such bimorphisms coincides with the class of syntax-directed translations. This result is extended to a smaller class of tree bimorphisms namely (linear an...

In this paper, we propose to exploit the temporal dimension in dynamic QoS-based multicast routing to significantly improve the performance of previous spatial-oriented protocols while using less control overhead. We describe the design of a new protocol named TTBP (temporally correlated ticket-based probing), which is extended from a previous proposal TBP (ticket-based probing) protocol [IEEE ...