نتایج جستجو برای: preorder
تعداد نتایج: 684 فیلتر نتایج به سال:
Abstract Given a commutative semiring with compatible preorder satisfying version of the Archimedean property, asymptotic spectrum, as introduced by Strassen (J. reine angew. Math. 1988), is an essentially unique compact Hausdorff space together map from to ring continuous functions. Strassen’s theorem characterizes relaxation that asymptotically compares large powers elements up subexponential...
This paper describes a technique for generating diagnostic information for the timed bisimulation equivalence and the timed simulation preorder. More precisely, given two (parallel) networks of regular real–time processes, the technique will provide a logical formula that differentiates them in case they are not timed (bi)similar. Our method may be seen as an extension of the algorithm by Čerān...
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
A new preorder relation is introduced that orders states of a Markov process with an additional reward structure according to the reward gained over any interval of finite or infinite length. The relation allows the comparison of different Markov processes and includes as special cases monotone and lumpable Markov processes.
This paper studies the interplay between functional application and nondeterministic choice in the context of untyped -calculus. We introduce an operational semantics which is based on the idea of must preorder, coming from the theory of process algebras. To characterize this relation, we build a model using the classical inverse limit construction, and we prove it fully abstract using a genera...
in this paper we investigate generalized topologies generated by a subbase ofpreorder relators and consider its application in the concept of the complement. we introducethe notion of principal generalized topologies obtained from the new type of open sets andstudy some of their important properties.
In this paper we investigate generalized topologies generated by a subbase of preorder relators and consider its application in the concept of the complement. We introduce the notion of principal generalized topologies obtained from the new type of open sets and study some of their important properties.
A topology τ on a fixed nonempty set X is said to satisfy the weakly continuous representation property if every weakly continuous not necessarily total preorder on the topological space (X, τ) admits a continuous order preserving function. Such a property generalizes the well known continuous representation property of a topology τ on a set X (according to which every continuous total preorder...
I will discuss the two problems of how to define identity between logics and how to define identity between proofs. For the identity of logics, I propose to simply use the notion of preorder equivalence. This might be considered to be folklore, but is exactly what is needed from the viewpoint of the problem of the identity of proofs: If the proofs are considered to be part of the logic, then pr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید