A general class of languages for value-passing calculi based on the late semantic approach is defined and a concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. Three kinds of semantics are given for this language. First a Plotkin style operational semantics by means of an applicative labelled transition system is intr...

This paper presents a simulation preorder for continuoustime Markov chains (CTMCs). The simulation preorder is a conservative extension of a weak variant of probabilistic simulation on fully probabilistic systems, i.e., discrete-time Markov chains. The main result of the paper is that the simulation preorder preserves safety and liveness properties expressed in continuous stochastic logic (CSL)...

A framework of Plotkin and Turi’s, originally aimed at providing an abstract notion of bisimulation, is modified to cover other operational equivalences and preorders. Combined with bialgebraic methods, it yields a technique for the derivation of syntactic formats for transition system specifications which guarantee operational preorders to be precongruences. The technique is applied to the tra...

A difference preorder is a (possibly incomplete) preorder on a space of state changes (rather than the states themselves); it encodes information about preference intensity, in addition to ordinal preferences. We find necessary and sufficient conditions for a difference preorder to be representable by a family of cardinal utility functions which take values in linearly ordered abelian groups. T...

We consider the problem of simulation preorder/equivalence between infinitestate processes and finite-state ones. First, we describe a general method how to utilize the decidability of bisimulation problems to solve (certain instances of) the corresponding simulation problems. For certain process classes, the method allows to design effective reductions of simulation problems to their bisimulat...

A random preorder on n elements consists of linearly ordered equivalence classes called blocks. We investigate the block structure of a preorder chosen uniformly at random from all preorders on n elements as n→ ∞.

More than a decade ago, Moller and Tofts published their seminal work on relating processes, which are annotated with lower time bounds, with respect to speed. Their paper has left open many questions regarding the semantic theory for the suggested bisimulation– based faster–than preorder, the MT–preorder, which have not been addressed since. The encountered difficulties concern a general compo...

Many approaches to overcoming the problem of high space requirements in model checking are based on the simulation preorder. This preorder relates the system model to some reduced model, provided that the reduced model contains all the behaviors of the system model. Reduction techniques often add unrealistic behaviors to the reduced model. Fairness constraints can then be added to exclude these...