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

An important application of sequential mining technique is maximal frequent traversal pattern mining, since users’ traversal pattern and motivation are latent in session sequence at some time segment. In this paper, a Frequent Traversal Pattern Tree structure with dwell time (FTP-Tree) is designed to store, compress the session database, and simplify the configuration of dwell time thresholds d...

This paper presents a unified approach to parsing, in which top-down, bot tomup and left-corner parsers m:e related to preorder, postorder and inorder tree traversals. It is shown that the simplest bo t tom-up and left-corner parsers are left recursive and must be converted using an extended Greibach normal form. With further partial execution, the bo t tom-up and left-corner parsers collapse t...

The heap is a very fundamental data structure used in many application programs as well as in system software. In this paper, we propose a heap traversal algorithm which visits the nodes of a binary heap in ascending order of the key values stored in the nodes. We demonstrate two implementations of the heap traversal algorithm, using a binary search tree or a binary heap as the auxiliary struct...

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.