Abstract Let N be a zero-symmetric (right) nearring with identity. We introduce partial order in the matrix corresponding to (defined by Pilz Near-rings: theory and its applications, North Holland, Amsterdam, 1983) . A positive cone is defined characterization theorem obtained. For convex ideal I , we prove that $${I^*}$$ <mml...

Abstract Existing dynamic partial order reduction (DPOR) algorithms scale poorly on concurrent data structure benchmarks because they visit a huge number of blocked executions due to spinloops. In response, we develop Awamoche , sound, complete, and strongly optimal DPOR algorithm that avoids exploring any useless in programs with await confirmation-CAS loops. Consequently, it outperforms the s...

Rule based specifications are popular for specifying protocols, e.g., cache coherence protocols specified in TLA+ [12], Murphi [7], or the BlueSpec language [1]. Specifications in these notations are a collection of unordered rules of the form guard(state) → atomic updates. There is no notion of a sequential process with local scopes or channels, and each rule tends to update multiple fields of...

The paper deals with veriication of untimed branching time properties of Time Petri Nets. The atomic variant of the geometric region method for preserving properties of CTL and ACTL is improved. Then, it is shown, for the rst time, how to apply the partial order reduction method to deal with next-time free branching properties of Time Petri Nets. The above two results are combined ooering an ee...

To access the efficient inventory system, managers should consider all the situations that have happened in reality. One of these situations is the presence of the defective items in each received lot and the other situation is being the group of customers that do not wait to fulfill their requirements from the vendor and choose another one to get their orders so the proportion of the backorder...

1 I n t r o d u c t i o n One c o m m o n me thod for dealing with the intrinsically intractable computa t iona l complexi ty of model-checking asynchronous systems is partial order reduction. This reduct ion technique exploits the c o m m o n practice of model ing concurrent events in asynchronous systems as an interleaving of the events in all possible execution orders. An impor t an t observ...

Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semantics that reduces the amount of nondeterminism in concurrent programs by delaying unnecessary context switches. Using this semantics, we construct a novel dynamic partial-order reduction algorithm. The cartesian semant...