Background: In the field of cellular therapy, the impact of confluence degreeonharvesting or differentiation of BMMSCs and the effect of cell-to-cell contact remain controversial. Therefore, the effect of confluence on properties of BMMSCs was studied and efficiency of confluence-associated osteogenic differentiation was identified. Materials andMethods: The impact of 20, 50, 70, 80 and 100% co...

Constraint Handling Rules (CHRs) are a powerful rule based language for specifying constraint solvers. Critical for any rule based language is the notion of confluence, and for terminating CHRs there is a decidable test for confluence. But many CHR programs that in practice are confluent fail this confluence test. The problem is that the states that illustrate non-confluence are not reachable i...

Graph transformation has been shown to be well suited as formal foundation for model transformations. While simple model changes may be specified by simple transformation rules, this is usually not sufficient for more complex changes. In these situations, the concept of amalgamated transformation has been increasingly often used to model for each loops of rule applications which coincide in com...

several studies suggest that invertebrate abundance and richness are disrupted and reset at confluences. thus, junctions contribute disproportionately to the overall aquatic biodiversity of the river. in general terms, authors have reported high abundance and diversity due to the major physical heterogeneity at junctions. however, data are still scarce and uncertainties are plentiful.the impact...

We present a novel proof of Toyama’s famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in that it factors through the decreasing diagrams technique for abstract rewriting systems, is constructive in that it gives a construction for the converging rewrite sequences given a pair of diverging rewrite sequences, and ...

[no abstract available]

[no abstract available]

We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and mathematically more realistic) look at cut-free proofs. We analyze which witnesses they choose for which quantifiers, or in other words: we only consider the Herbrand-d...

We investigate con uence properties for concurrent systems of message-passing processes, because such properties have proved to be useful for a variety of applications, ranging from reasoning about concurrent objects to mobile and high-speed telecommunication protocols. Roughly, con uence means that for every two computations starting from a common system state, it is possible to continue the c...

This paper describes the Conditional Confluence tool, a fully automatic confluence checker for first-order conditional term rewrite systems. The tool implements various confluence criteria that have been proposed in the literature. A simple technique is presented to test conditional critical pairs for infeasibility, which makes conditional confluence criteria more useful. Detailed experimental ...