The classical method for constructing the least fixedpoint of a recursive definition is to generate a sequence of functions whose initial element is the totally undefined function and which converges to the desired least fixedpoint. This method, due to Kleene, cannot be generalized to allow the construction of other fixedpoints. In this paper we present an alternate definition of convergence an...

We introduce a fixedpoint algorithm for verifying safety properties of hybrid systems with differential equations that have right-hand sides that are polynomials in the state variables. In order to verify non-trivial systems without solving their differential equations and without numerical errors, we use a continuous generalization of induction, for which our algorithm computes the required di...

In the present paper, we give a new approach to Caristi's fixed pointtheorem on non-Archimedean fuzzy metric spaces. For this we define anordinary metric $d$ using the non-Archimedean fuzzy metric $M$ on a nonemptyset $X$ and we establish some relationship between $(X,d)$ and $(X,M,ast )$%. Hence, we prove our result by considering the original Caristi's fixedpoint theorem.

We introduce Petruchio, a tool for computing Petri net translations of dynamic networks. To cater for unbounded architectures beyond the capabilities of existing implementations, the principle fixedpoint engine runs interleaved with coverability queries. We discuss algorithmic enhancements and provide experimental evidence that Petruchio copes with models of reasonable size.

Abstract: The paper deals with the approximate controllability of a semi-linear stochastic system with multiple delays in control in infinite dimensional spaces. Sufficient conditions for the approximate controllability of the semi-linear control system have been established. The results are obtained using the Banach fixedpoint theorem. An example is introduced to show the effectiveness of the ...

I show that the general implicit-function problem (or parametrized fixedpoint problem) in one complex variable has an explicit series solution given by a trivial generalization of the Lagrange inversion formula. I give versions of this formula for both analytic functions and formal power series.

In this paper, we introduce amodifiedMann iterative process for approximating a common fixedpoint of a finite family of strict pseudo-contractions inHilbert spaces.We establish the strong convergence theorem of the general iteration scheme under some mild conditions. Our results extend and improve the recent ones announced by many others. © 2008 Elsevier Ltd. All rights reserved.

in this paper, we introduce the (g-$psi$) contraction in a metric space by using a graph.let $f,t$ be two multivalued mappings on $x.$ among other things, we obtain a common fixedpoint of the mappings $f,t$ in the metric space $x$ endowed with a graph $g.$

In this paperwe consider a linear scalar differential equationwith variable delays andgive conditions to ensure that the zero solution is asymptotically stable bymeans of fixedpoint theory.These conditions do not require the boundedness of delays, nor do they ask for a fixed sign on the coefficient functions. An asymptotic stability theorem with a necessary and sufficient condition is proved. 2...

In this paper, we study the existence of coupled coincidence andcoupled common fixed points for single-valued and fuzzy mappingsunder a contractive condition in metric space. Presented theoremsextend and improve the main results of Abbas and$acute{C}$iri$acute{c}$ {itshape et al.} [M. Abbas, L.$acute{C}$iri$acute{c}$, {itshape et al.}, Coupled coincidenceand common fixed point theorems for hybr...