Abstract: Over the last thirty years, numerous consistency conditions for replicated data have been proposed and implemented. Popular examples of such conditions include linearizability (or atomicity), sequential consistency, causal consistency, and eventual consistency. These consistency conditions are usually defined independently from the computing entities (nodes) that manipulate the replic...

We provide non-operational characterizations of Java memory consistency model (Java Consistency, or simply Java). The work is based on the operational definition of the Java memory consistency as given in the Java Language Specification [6]. We study the relation of Java memory behavior to that of some well known models, proving that Java is incomparable with PRAM Consistency and with both vari...

To verify fixed-time constraints in grid workflow systems, the consistency and inconsistency conditions have been defined in the conventional work. However, in this paper, we argue that although the conventional consistency condition is reasonable, the conventional inconsistency condition is too rigorous and covers several different situations. These situations which are handled conventionally ...

in this paper, we consider first-order fuzzy differential equations with initial value conditions. the convergence, consistency and stability of difference method for approximating the solution of fuzzy differential equations involving generalized h-differentiability, are studied. then the local truncation error is defined and sufficient conditions for convergence, consistency and stability of ...

When distributed clients query or update shared data, eventual consistency can provide better availability than strong consistency models. However, programming and implementing such systems can be difficult unless we establish a reasonable consistency model, i.e. some minimal guarantees that programmers can understand and systems can provide effectively. To this end, we propose a novel consiste...

In a replicated database, the consistency level defines whether and how the values of the replicas of a logical object may diverge in the presence of updates. Eventual consistency is the weakest consistency level that guarantees convergence. Informally, it requires that all replicas of an object will eventually reach the same, correct, final value, assuming that no new updates are submitted to ...

Proper consistency is defined by the properties that each player takes all opponent strategies into account (is cautious) and deems one opponent strategy to be infinitely more likely than another if the opponent prefers the one to the other (respects preferences). When there is common certain belief of proper consistency, a most preferred strategy is properly rationalizable. Any strategy used w...

The fact that “natural” theories, i.e. theories which have something like an “idea” to them, are almost always linearly ordered with regard to logical strength has been called one of the great mysteries of the foundation of mathematics. However, one easily establishes the existence of theories with incomparable logical strengths using self-reference (Rosser-style). As a result, PA + Con(PA) is ...

We introduce the notion of self-consistency checking, a new methodology for applying formal methods in the debugging process. Intuitively , self-consistency checks functional consistency of a circuit in two diierent modes or environments. Self-consistency can (1) simplify property veriication and (2) enable the use of symbolic simulation in the absence of a concrete speciication. We present a c...

Although best known for his work in symbolic logic, George Boole made seminal contributions in the logic of probabilities. He solved the probabilistic inference problem with a projection method, leading to the insight that inference (as well as optimization) is essentially a projection problem. This unifying perspective has applications in constraint programming, because consistency maintenance...