Transcription factor Rho is a ring-shaped, homohexameric protein that causes transcript termination through actions on nascent RNAs that are coupled to ATP hydrolysis. The Rho polypeptide has a distinct RNA-binding domain (RNA-BD) of known structure as well as an ATP-binding domain (ATP-BD) for which a structure has been proposed based on homology modeling. A model is proposed in which Rho firs...

RyR2 (cardiac ryanodine receptor)-mediated Ca2+ release in cardiomyocytes terminates when the sarcoplasmic reticulum Ca2+ content depletes to a threshold level, known as the termination threshold. Despite its importance, little is known about the mechanism that regulates the termination threshold. CaM (calmodulin), by inhibiting RyR2, has been implicated in Ca2+-release termination, but whether...

In this paper we present a termination preserving transformation from Constraint Handling Rules to Prolog. The transformation is sound w.r.t. termination under the theoretical semantics of Constraint Handling Rules. It does not consider the presence of a propagation history. The transformation allows for the direct reuse of termination proof methods from Logic Programs and Term-Rewrite Systems,...

We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference generalizes termination analysis/checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, requiring user annotations. With te...

We study termination of LOTOS behaviors. In order to characterize termination, we rst deene a testing semantics for LOTOS in the classical way giving a fully abstract characterization in terms of acceptance sets. We show that this testing semantics does not properly capture termination. Then we modify the testing semantics by extending the class of admissible tests, to obtain a new equivalence ...

We define a transformation 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. For the class of left-linear TRSs the transformation is complete. Thereby state-of-the-art termination methods and automated termination provers for context-sensitive rewriting become available for provi...

We introduce two techniques for proving termination of graph transformation systems. We do not fix a single initial graph, but consider arbitrary initial graphs (uniform termination), but also certain sets of initial graphs (non-uniform termination). The first technique, which can also be used to show non-uniform termination, uses a weighted type graph to assign weights to graphs. The second te...

The framework of dependency pairs allows automated termination and innermost termination proofs for many TRSs where such proofs were not possible before. In this paper we present a reenement of this framework in order to prove termination in a modular way. Our mod-ularity results signiicantly increase the class of term rewriting systems where termination resp. innermost termination can be prove...

Termination of programs is known to be undecidable. However in the case of logic programs , where the only possible cause for non-termination is innnite recursion, termination can actually be proved automatically for a large class of programs. This paper describes an algorithm for automatically checking termination of queries to logic programs. Given a program and query the algorithm either ans...

The characterisation of termination using well-founded monotone algebras has been a milestone on the way to automated termination techniques, of which we have seen an extensive development over the past years. Both the semantic characterisation and most known termination methods are concerned with global termination, uniformly of all the terms of a term rewriting system (TRS). In this paper we ...