Antichains, Partial Well Order and Atomicity
Maximal Antichains of Isomorphic Subgraphs of the Rado Graph
... the partial order hR(R), ⊂i, where R(R) is the set of all isomorphic copies of R contained in R, that is the set of all subsets A of R such that hA, E ∩ [A] 2 i is a countable random ...non-atomic ...
5
Restricted permutations, antichains, atomic classes and stack sorting
... list of closed class constructions and decompositions. The partial order of involvement contains infinite antichains. We develop.. the concept of a fundamental antichain. We c[r] ...
377
Well-partial-orderings and the big Veblen number
... Introduction Well-quasi-orders are common (and sometimes reinvented [6]) ordering structures which play a prominent role ...logic. Well-partial-orders are well- quasi-orders which are in ...
37
Antichains of monomial ideals are finite
... infinite antichains, and that it satisfies the descending chain ...as well- ...infinite antichains or infinite descending chains such that the poset of dual order ideals under containment ...
7
Atomicity in Electronic Commerce
... Digicash uses an anonymous digital cash protocol. As discussed in Section 2.2, digital cash protocols are not money atomic; indeed, in the event of communication failure, they can fail to be anonymous as well. ...
19
Partial Order Reduction for PINS
... 25 return dfs.state_matched (s); Algorithm 6: Couvreur’s algorithm for GSEA framework 4.6.3 Combining POR with LTL Using the partial order reduction wrapper works well for deadlocks. For LTL extra ...
62
Hardware atomicity for compiler-directed control speculation
... performing well in the atomic+aggressive inlining configuration, the jython benchmark incurs a slowdown in the atomic ...the partial inliner in the atomic ...
172
Well quasi order in combinatorics : embeddings and homomorphisms
... of partial well order (pwo), or its mild generalisation well quasi-order (wqo), can then serve to distinguish between the ‘tame’ and ‘wild’ such ...
34
GPU implementation of partial order reduction
... Catch Them Young (OWCTY) algorithm to find these cycles. This results in a speed-up over both multi-core DIVINE and multi-core LTSmin. Edelkamp and Sulewski [19] perform successor generation on the GPU and apply delayed ...
55
Partial order infinitary term rewriting
... or partial orders [7, 6], were mainly considered to pursue quite specific purposes and have not seen nearly as much attention as the metric ...of partial terms ...the partial order model of ...
53
Atomicity and Normalization
... checking atomicity with the domain expert by asking whether a sentence of the specified kind can be equivalent to a conjunction of smaller sentences (using concrete ...ensuring atomicity at the front end, ...
15
Atomicity in Mobile Networks
... relaxing atomicity or consistency is not harmful? Think, for example, of a rescue operation that has blocked resources but does not reach a commit ...relaxing atomicity would mean that other transactions ...
5
A note on operators of deletion and contraction for antichains
... ANDREY O. MATVEEV Received 16 August 2001 and in revised form 28 March 2002 The operators of deletion and contraction for clutters are generalized to those for an- tichains of finite bounded posets. A generalization of ...
5
A Type and Effect System for Atomicity
... and atomicity anno- tations required by the type checker are embedded in spe- cial Java comments that start with the character “#”, thus preserving compatibility with existing Java compilers and other ...default ...
12
Monitoring Atomicity in Concurrent Programs
... of atomicity stems from the concept of serializability studied in database concurrency control, and the idea of using the notion of atomicity as a generic specification for concurrent programs (running on ...
13
A well-quasi-order for tournaments
... This is not sufficient to deduce that the first tournament is immersed in the second, however; we have to provide edge-disjoint directed paths of the second tournament linking the appropriate pairs of vertices. This is ...
7
Extended blocker, deletion, and contraction maps on antichains
... Families of maps on the lattice of all antichains of a finite bounded poset that extend the blocker, deletion, and contraction maps on clutters are considered.. Influence of the parameters[r] ...
10
CiteSeerX — A type and effect system for atomicity
... and atomicity anno- tations required by the type checker are embedded in spe- cial Java comments that start with the character “#”, thus preserving compatibility with existing Java compilers and other ...default ...
12
Atomicity Strong need consistency 6
... Questions (variable number of answers) Answers (variable number of resource records) Authority (variable number of resource records) Additional Info (variable number of resource records)[r] ...
10
Partial-Order Planning Algorithms
... Let’s just briefly review the parts of a partially ordered plan. There are the steps, or actions we plan to take. There are ordering constraints that say which steps have to be before which other ones. They need to be ...
83