A key problem in mixing operational (e.g., process-algebraic) and declarative (e.g., logical) styles of specification is how to deal with inconsistencies arising when composing processes under conjunction. This article introduces a conjunction operator on labelled transition systems capturing the basic intuition of “a and b = false”, and considers a naive preorder that demands that an inconsist...

The uniform verification problem for parameterized systems is to determine whether a temporal property is true for every instance of the system which is composed of an arbitrary number of homogeneous processes. We consider some aspects of the inductionbased technique which assumes the construction of finite invariants of such systems. An invariant process is one which is greater (with respect t...

In order to address this problem, our algorithm uses the rst element of preorder node sequence to nd the root of tree, and locate the root in the inorder node sequence. Then, in inorder sequence, everything on the left side of the root element is the inorder node sequence of the left subtree and everything on the right side of of the root element is the inorder node sequence of the right tree. ...

This paper studies T -preorders than can be generated in a natural way by a single fuzzy subset. These T -preorders are called one-dimensional and are of great importance, since every T -preorder can be generated by combining onedimensional ones. In the paper, the relation between fuzzy subsets generating the same T -preorder is given and one-dimensional T -preorders are characterized in two di...

If ≤ is a preorder on a set P and p0 ≤ p1, we say that p1 is an extension of p0. Recall that a preorder is separative if and only if whenever p1 is not an extension of p0 there is an extension of p1 which is incompatible with p0. We say that P = (P,≤) is a forcing notion (also forcing poset) if ≤ is a separative preorder with minimal element 0P. Note that if P is separative and p1 p̌0 ∈ Ġ then p...

The finite satisfiability problem of two-variable logic extended by a linear order successor and a preorder successor is shown to be undecidable. The decidability of the finite satisfiability problem of two-variable logic extended by orders and preorders as well as their corresponding successor relations has been currently investigated by several papers [2, 5, 3]. This short note extends [3] wh...

We implement belief revision in SNePS based on a user-supplied epistemic ordering of propositions. We provide a decision procedure that performs revision completely automatically when given a well preorder. We also provide a decision procedure for revision that, when given a total preorder, simulates a well preorder by making a minimal number of queries to the user when multiple propositions wi...

This paper proposes a way to effectively compare the potential of processes to cause conflict. In discrete event systems theory, two concurrent systems are said to be in conflict if they can get trapped in a situation where they are both waiting or running endlessly, forever unable to complete their common task. The conflict preorder is a process-algebraic pre-congruence that compares two proce...

In the standard testing theory of DeNicola-Hennessy one process is considered to be a refinement of another if every test guaranteed by the former is also guaranteed by the latter. In the domain of web services this has been recast, with processes viewed as servers and tests as clients. In this way the standard refinement preorder between servers is determined by their ability to satisfy client...

In this paper we consider Milner's calculus CCS enriched by a probabilistic choice operator. The calculus is given operational semantics based on probabilistic transition systems. We deene operational notions of preorder and equivalence as prob-abilistic extensions of the simulation preorder and the bisimulation equivalence respectively. We extend existing category-theoretic techniques for solv...