Fuzzy order congruences play an important role in studying the categoricalproperties of fuzzy posets. In this paper, the correspondence between the fuzzyorder congruences and the fuzzy order-preserving maps is discussed. We focus onthe characterization of fuzzy order congruences on the fuzzy poset in terms ofthe fuzzy preorders containing the fuzzy partial order. At last, fuzzy completecongruen...

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...