Jörg Endrullis
Transforming Outermost into Context-Sensitive Rewriting.
Tue, 06/01/2010 - 15:02 — SomNambulAuthors: Jörg Endrullis, Dimitri Hendriks
Subjects: Logic in Computer Science
AbstractWe define two transformations from term rewriting systems (TRSs) to
context-sensitive TRSs in such a way that termination of the target system
implies outermost termination of the original system. In the transformation
based on 'context extension', each outermost rewrite step is modeled by exactly
one step in the transformed system. This transformation turns out to be
complete for the class of left-linear TRSs. The second transformation is called
`dynamic labeling' and results in smaller sized context-sensitive TRSs.Asynchronous Bounded Expected Delay Networks.
Thu, 03/11/2010 - 16:01 — SomNambulAuthors: Jun Pang, Wan Fokkink, Rena Bakhshi, Jörg Endrullis
Subjects: and Cluster Computing, Distributed, Parallel
AbstractThe commonly used asynchronous bounded delay (ABD) network models assume a
fixed bound on message delay. We propose a probabilistic network model, called
asynchronous bounded expected delay (ABE) model. Instead of a strict bound, the
ABE model requires only a bound on the expected message delay. While the
conditions of ABD networks restrict the set of possible executions, in ABE
networks all asynchronous executions are possible, but executions with
extremely long delays are less probable. In contrast to ABD networks, ABE
networks cannot be synchronised efficiently.
User login
