Synopsis. In a cartesian closed category with an initial object and a dominance that classiies it, an intensional notion of approximation between maps |the path relation (c.f. link relation)| is deened. It is shown that if such a category admits strict/upper-closed factorisations then it preorder-enriches (as a cartesian closed category) with respect to the path relation. By imposing further ax...

We prove that testing preorder of De Nicola and Hennessy is preserved by all De Simone process operators. Based on this result we propose an algorithm for generating axiomatisations of testing preorder for arbitrary De Simone process languages. The axiom systems produced by our algorithm are nite and complete for processes with nite behaviour. In order to achieve completeness for a subclass of ...

We consider equivalence relations and preorders complete for various levels of the arithmetical hierarchy under computable, component-wise reducibility. We show that implication in first order logic is a complete preorder for Σ1, the ≤m relation on EXPTIME sets for Σ2 and the embeddability of computable subgroups of (Q,+) for Σ3. In all cases, the symmetric fragment of the preorder is complete ...

This paper studies conflicts from a process-algebraic point of view and shows how they are related to the testing theory of fair testing. Conflicts have been introduced in the context of discrete event systems, where two concurrent systems are said to be in conflict if they can get trapped in a situation where they are waiting or running endlessly, forever unable to complete their common task. ...

We extend the trace semantics for labeled transition systems to a ran-domized model of concurrent computation. The main objective is to obtain a com-positional semantics. The role of a trace in the randomized model is played by a probability distribution over traces, called a trace distribution. We show that the preorder based on trace distribution inclusion is not a precongruence, and we build...

We propose a probabilistic, energy-aware, broadcast calculus for the analysis of mobile ad-hoc networks. The semantics of our model is expressed in terms of Segala’s probabilistic automata driven by schedulers to resolve the nondeterministic choice among the probability distributions over target states. We develop a probabilistic observational congruence and a energy-aware preorder semantics. T...

Decision making amounts to define a preorder (usually a complete one) on a set of options. Argumentation has been introduced in decision making analysis. In particular, an argument-based decision system has been proposed recently by Amgoud et al. The system is a variant of Dung’s abstract framework. It takes as input a set of options, different arguments and a defeat relation among them, and re...

The zonoid of a d-dimensional random vector is used as a tool for measuring linear dependence among its components. A preorder of linear dependence is defined through inclusion of the zonoids. The zonoid of a random vector does not characterize its distribution, but it characterizes the size biased distribution of its compositional variables. This fact will allow a characterization of our linea...

Bochum, Germany, pages 899 904, 1996. Con uent Preorder Parser As A Finite State Automata HO, Kei Shiu Edward CHAN, Lai Wan Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong email: [email protected], [email protected] Abstract. We present the Con uent Preorder Parser (CPP) in which syntactic parsing is achieved via a holistic tra...

We develop an abstraction-based framework to check probabilistic specifications of Markov Decision Processes (MDPs) using the stochastic two-player game abstractions (i.e. “games”) developed by Kwiatkowska et al. as a foundation. We define an abstraction preorder for these game abstractions which enables us to identify many new game abstractions for each MDP — ranging from compact and imprecise...