This paper studies the interaction of pre x iteration x with the silent step in the setting of branching bisimulation That is we present a nite equational axiomatization for Basic Process Algebra with deadlock empty process and the silent step extended with pre x iteration and prove that this axiomatization is complete with respect to rooted branching bisimulation equivalence

In this paper, we consider an iteration process for approximating common fixed points of two asymptotically quasinonexpansive mappings and we prove some strong and weak convergence theorems for such mappings in uniformly convex Banach spaces. Keywords—Asypmtotically quasi-nonexpansive mappings, Common fixed point, Strong and weak convergence, Iteration process.

Bergstra, Bethke and Ponse proposed an axiomatization for Basic Process Algebra extended with (binary) iteration. In this paper, we prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we will set up a term rewriting system, based on the axioms, and prove that this term rewriting system is terminating, and that bisimilar normal forms...

In this paper, under the framework of Banach space with uniformly Gateaux differentiable norm and uniform normal structure, we use the existence theorem of fixed points of Li and Sims to investigate the convergence of the implicit iteration process and the explicit iteration process for asymptotically nonexpansive mappings. We get the convergence theorems.

In this paper, under the framework of Banach space with uniformly Gateauxdifferentiable norm and uniform normal structure, we use the existence theorem of fixed points of Gang Li and Sims to investigate the convergence of the implicit iteration process and the explicit iteration process for asymptotically nonexpansive semigroup. We get the convergence theorems.

This paper studies the interaction of prefix iteration with the silent step in the setting of branching bisimulation. We present a finite equational axiomatization for Basic Process Algebra with deadlock, empty process and the silent step, extended with prefix iteration, and prove that this axiomatization is complete with respect to rooted branching bisimulation equivalence.

This paper deals with computational algorithms for obtaining the optimal stationary policy and the minimum cost of a discounted semi-Markov decision process. Van Nunen [23) has proposed a modified policy iteration algorithm with a suboptimality test of MacQueen type, where the modified policy iteration algorithm is policy iteration method with the policy evaluation routine by a finite number of...

If iteration is the rule in modern software development practices, this is more the case in game development. While the secret recipe for fun in games remains hidden, game development will remain a highly iterative trial-and-error design process. In this paper we present a semi-automatic process that, through FCA, can assist in the software design of modern videogames. Through FCA we can identi...

Lower searching cost and access to large amounts of information on the Internet are making a consumer’s search more iterative. Through a synthesis of literature from consumer behaviour and information science, we propose a process model of online consumer search in which a consumer may move forward in the process towards a final product selection, but also is likely to backtrack to an earlier s...

We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...