Toyama's Theorem states that connuence is a modular property of disjoint term rewriting systems. This theorem does not generalize to combined systems with shared constructors. Thus the question arises naturally whether there are suucient conditions which ensure the modu-larity of connuence in the presence of shared constructors. In particular, Kurihara and Krishna Rao posed the problem whether ...

The coinductive λ-calculus Λ arises by a coinductive interpretation of the grammar of the standard λ-calculus Λ and contains non-wellfounded λ-terms. An appropriate notion of reduction is analyzed and proven to be confluent by means of a detailed analysis of the usual Tait/MartinLöf style development argument. This yields bounds for the lengths of those joining reduction sequences that are guar...

PURPOSE To evaluate fibroblast proliferation activity of the Tenon capsule from primary and recurrent pterygia. METHODS A randomized prospective study was performed with 43 surgical samples from 30 primary and 13 recurrent pterygia, and samples of normal Tenon capsule from the same pterygium patients. Proliferation, migration, and confluence rate, and patient age, lesion location and type (fl...

We prove that fully-extended, orthogonal infinitary combinatory reduction systems with finite right-hand sides are confluent modulo identification of hypercollapsing subterms. This provides the first general confluence result for infinitary higher-order rewriting.

Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are required properties. Only under these two conditions, existence and uniqueness of the outcoming model is ensured. Verifying confluence of a graph transformation system is equivalent to checking both local confluence and termination. A graph transformation ...

The notion of τ -confluence provides a form of partial order reduction of Labelled Transition Systems (Ltss), by enabling to identify the τ -transitions, whose execution does not alter the observable behaviour of the system. Several forms of τ -confluence adequate with branching bisimulation were studied in the literature, ranging from strong to weak forms according to the length of τ -transiti...

To improve the efficiency of model checking in general, and probabilistic model checking in particular, several reduction techniques have been introduced. Two of these, confluence reduction and partial-order reduction by means of ample sets, are based on similar principles, and both preserve branching-time properties for probabilistic models. Confluence reduction has been introduced for probabi...

Numerous natural and artificial streams, including those for irrigation ditches, wastewater treatment facilities, conveyance structures fish movement, have open channel confluences. The flow dynamics at around the junction are intricate; in particular, immediately downstream of junction, creates a zone separation on inner wall along with secondary recirculation patterns. structure this complica...

In the abstract operational semantics of Constraint Handling Rules (CHR), propagation rules, i.e. rules that only add information, can be applied again and again. This trivial non-termination is typically avoided by a propagation history. A more declarative approach are persistent constraints. Constraints that are introduced by propagation rules are made persistent and cannot be removed. Now a ...