Recently we have presented dynamic condition response structures (DCR) as a declarative process model conservatively generalizing labelled event structures to allow for finite specifications of repeated, possibly infinite behavior and acceptance conditions for infinite runs. The key ideas are to split the causality relation of event structures in two dual relations: the condition relation and t...

Starting from a suitable fixed point relation, we derive higher order iterative methods for the simultaneous inclusion of polynomial multiple zeros in circular complex interval arithmetic. Each of the resulting disks contain one and only one zero in every iteration. This convenient inclusion property, together with very fast convergence, ranks these methods among the most powerful iterative met...

Although during recent years in the field of special education there has been much debate regarding inclusion and people’s beliefs around disability, it is suggested that what has been lacking in many of the discussions is any coherent guiding philosophy that helps direct research in this area. The paper proposes that critical realism, developed by philosopher Roy Bhaskar, may provide such a fr...

usd7 is one of the steel products of isfahan steel company. it is cast in continuous casting moulds and rolled up to a rod of 5 mm diameter. finally, it is wire drawn up to 3 mm and used as welding electrodes. this steel contains 0.05 to 0.09 wt. % carbon. the acceptable limit of the aluminium in this class of steel is less than 0.003 wt%. therefore, it is categorized as rimmed steel. during fo...

in this paper, we use the concept of graph convergence of h(.,.)-co-accretive mapping introduced by [r. ahmad, m. akram, m. dilshad, graph convergence for the h(.,.)-co-accretive mapping with an application, bull. malays. math. sci. soc., doi: 10.1007/s40840-014-0103-z, 2014$] and define an over-relaxed proximal point method to obtain the solution of a generalized variational inclusion problem ...

The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e., language inclusion) is ptime-hard, even for finite acyclic labelled transition systems. This reproves and substantially extends the result of Balcázar, Gabarró and Sántha (1992) for bisimilarity.

6 Exactness in the middle term 35 6.1 The moduli space on V × R . . . . . . . . . . . . . . . . . . . 36 6.2 Admissible elements in M̂V×R(a∞) . . . . . . . . . . . . . . . 41 6.3 Assembling the geometric limits . . . . . . . . . . . . . . . . . 43 6.4 The relation w0 ∗ ◦ w 1 ∗ = 0 . . . . . . . . . . . . . . . . . . . . . 51 6.5 The inclusion Ker(w0 ∗) ⊂ Im(w 1 ∗) . . . . . . . . . . . . . . . . 56

Making use of a linear operator, which is defined here by means of the Hadamard product (or convolution), we introduce a class Qp(a, c;h) of analytic and multivalent functions in the open unit disk. An inclusion relation and a convolution property for the class Qp(a, c;h) are presented. Some integral-preserving properties are also given.

We study an instance of the inclusion problem for rational relations over words. In this paper we show how to check if a one generator submonoid {w}∗ ⊆ (Σ∗) is included in the prefix closure of a rational relation R ⊆ (Σ∗) given by a multi-tape finite automaton.