The unification type of an equational theory is defined using a preorder on substitutions, called the instantiation preorder, whose scope is either restricted to the variables occurring in the unification problem, or unrestricted such that all variables are considered. It is known that the unification type of an equational theory may vary, depending on which instantiation preorder is used. More...

Should testing preorder was proposed as a liveness-preserving precongruence for a process algebra except for nondeterministic choice operator [22]. However, this precongruce result cannot be generalized to other languages before carefully proved. In this paper, we show that τDes format is a precongruence format for should testing preorder. A precongruence format guarantees the precongruence of ...

Binary trees are essential structures in Computer Science. The leaf (leaves) of a binary tree is one of the most significant aspects of it. In this study, we prove that the order of a leaf (leaves) of a binary tree is the same in the main tree traversals; preorder, inorder, and postorder. Then, we prove that given the preorder and postorder traversals of a binary tree, the leaf (leaves) of a bi...

The exact unification type of an equational theory is based on a new preorder on substitutions, called the exactness preorder, which is tailored towards transferring decidability results for unification to disunification. We show that two important results regarding the unification type of commutative theories hold not only for the usual instantiation preorder, but also for the exactness preord...

It is well known that lattice-valued rough sets are important branches of fuzzy sets. The axiomatic characterization and related topology the main research directions For L=(L,⊛), a complete co-residuated lattice (CCRL), Qiao recently defined an L-fuzzy lower approximation operator (LFLAO) on basis relation. In this article, we give further study Qiao’s LFLAO around induced L-topology. Firstly,...

The-calculus with multiplicities is a reenement of the lazy-calculus where the argument in an application comes with a multiplicity, which is an upper bound to the number of its uses. This introduces potential deadlocks in the evaluation. We study the discriminating power of this calculus over the usual-terms. We prove in particular that the observational equivalence induced by contexts with mu...

This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over the language BCCSP induced by variations on the classic simulation preorder and equivalence that abstract from internal steps in process behaviours. In particular, the article focuses on the (pre)congruences associated with the weak simulation, the weak complete simulation and the weak ready sim...

This paper deals with probabilistic and nondeterministic processes represented by a variant of labelled transition systems where any outgoing transition of a state s is augmented with probabilities for the possible successor states. Our main contribution are algorithms for computing the bisimulation equivalence classes as introduced by Larsen & Skou [44] and the simulation preorder a la Segala ...

We establish that on the domain of probabilistic automata, the trace distribution preorder coincides with the simulation preorder.