Results 1  10
of
89
An Efficiency Preorder for Processes
"... A simple efficiency preorder for CCS processes is introduced, in which p ! q means that q is at least as fast as p, or more generally, p uses at least as much resources as q. It is shown to be preserved by all CCS contexts except summation and it is used to analyse a nontrivial example: differe ..."
Abstract

Cited by 82 (12 self)
 Add to MetaCart
A simple efficiency preorder for CCS processes is introduced, in which p ! q means that q is at least as fast as p, or more generally, p uses at least as much resources as q. It is shown to be preserved by all CCS contexts except summation and it is used to analyse a nontrivial example
Iterated Forcing with ${}^{\omega}\omega$bounding and Semiproper Preorders
"... Assume the Continuum Hypothesis (CH) in the ground model. If we iteratively force with preorders which are $\omega\omega$bounding and semiproper taking suitable limits, then so is the final preorder constructed. Therefore we may show that the Cofinal Branch Principle (CBP) of [F] is strictly weaker ..."
Abstract
 Add to MetaCart
Assume the Continuum Hypothesis (CH) in the ground model. If we iteratively force with preorders which are $\omega\omega$bounding and semiproper taking suitable limits, then so is the final preorder constructed. Therefore we may show that the Cofinal Branch Principle (CBP) of [F] is strictly
Compliance and Testing Preorders Differ∗
"... Contracts play an essential role in the Service Oriented Computing, for which they need to be equiped with a subcontract relation. We compare two possible formulations, one based on compliance and the other on the testing theory of De Nicola and Hennessy. We show that if the language of contracts i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
languages. Finally we give one example of a contract language for which the clientbased subcontract relations coincide. 1
Simulation preorder on simple process algebras
 In Proceedings of ICALP'99, LNCS
, 1999
"... Abstract. We consider the problem of simulation preorder/equivalence between infinitestate processes and finitestate ones. We prove that simulation preorder (in both directions) and simulation equivalence are intractable between all major classes of infinitestate systems and finitestate ones. Th ..."
Abstract
 Add to MetaCart
results also hold for those PA and finitestate processes which are deterministic and normed, and thus immediately extend to trace preorder. Regularity (finiteness) w.r.t. simulation and trace equivalence is also shown to be undecidable for PA. Finally, we describe a way how to utilize decidability
Characterising testing preorders for finite probabilistic processes
 In LICS’07: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA
"... In 1992 Wang & Larsen extended the may and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout the years, namely to find complete axiomatisations and alternative cha ..."
Abstract

Cited by 30 (10 self)
 Add to MetaCart
characterisations for these preorders. This paper solves both problems for finite processes with silent moves. It characterises the may preorder in terms of simulation, and the must preorder in terms of failure simulation. It also gives a characterisation of both preorders using a modal logic. Finally
Simulation preorder over simple process algebras
 INFORMATION AND COMPUTATION
, 2002
"... We consider the problem of simulation preorder/equivalence between infinitestate processes and finitestate 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 c ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
to be undecidable for PA. Finally, we prove that simulation preorder (in both directions) and simulation equivalence are intractable between all classes of infinitestate systems (in the hierarchy of process rewrite systems) and finitestate ones. This result is obtained by showing that the problem whether a BPA
Optimal Preorder Discount and Information Release
, 2010
"... In this paper, we investigate the information release and pricing strategies for a seller who can take customer preorders before the release of a product. The preorder option enables the seller to sell a product at an early date when consumers ’ valuations are relatively homogeneous. We find that ..."
Abstract
 Add to MetaCart
release all information. Finally, under the optimal information release strategy and pricing strategy, the benefit of preorder is most pronounced when the seller can successfully position the product as a “massmarket ” product by withholding information.
Semantic Tableaux for a Logic with Preorders and Dynamic Sorts
, 1996
"... . In this paper we present a logic for dealing with preorders, where functions and predicates behave monotonically or antimonotonically in their arguments, and incorporating ordersorted relations into the syntax of the language. For this logic a ground tableaubased deduction method and a free varia ..."
Abstract
 Add to MetaCart
. In this paper we present a logic for dealing with preorders, where functions and predicates behave monotonically or antimonotonically in their arguments, and incorporating ordersorted relations into the syntax of the language. For this logic a ground tableaubased deduction method and a free
Mining Preorder Relation between Knowledge Units from Text
"... Preorder relation between Knowledge Units (KU) is the precondition for navigation learning. Although possible solutions, existing link mining methods lack the ability of mining preorder relation between knowledge units which are linearly arranged in text. Through the analysis of sample data, we disc ..."
Abstract
 Add to MetaCart
. Firstly, the associations between text documents are established according to the distribution asymmetry of domain terms. Secondly, candidate KUpairs are generated according to the locality of preorder relation. Finally, the preorder relations between KUpairs are identified by using classification
Symbolic Alternative Characterizations of Testing Preorders for Regular Timed Processes
 University
, 1996
"... This paper presents testing preorders for realtime communicating processes with "timeout" as the time constraint primitive where the time domain is the real numbers. The testing preorders presented here are a natural extension of De Nicola and Hennessy's for untimed communicating pr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
characterizations where we treat time intervals instead of time itself. For the regular class of realtime, since timeout points are finitely represented, these symbolic characterizations give a proof technique for the testing preorders. Finally, we illustrate our proof technique by some examples. 1 Introduction
Results 1  10
of
89