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...

T paper studies the preorder strategy that a seller may use to sell a perishable product in an uncertain market with heterogeneous consumers. By accepting preorders, the seller is able to obtain advance demand information for inventory planning and price discriminate the consumers. Given the preorder option, the consumers react strategically by optimizing the timing of purchase. We find that ac...

We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of contextual preorder for a CCS-like process calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The argument makes use of other standard notions in process algebra, namely simulation and labeled transition systems. This result establishes a connection...

Two formalisms for concurrency, the Input Output automaton model and the theory of testing, are compared and are shown to have common foundations. The relationship between the fair and quiescent preorders of I O automata is investigated and the two preorders are shown to coincide subject to some restrictions. I O automata are encoded into the theory of testing and the reversed must preorder is ...

Imposing certain restrictions on the transition system that deenes the behaviour of a process allows us to characterize the readiness semantics of OH86] by means of black{box testing experiments, or more precisely by lighted button testing experiments BM92]. As divergence is considered we give the semantics as a preorder, the readiness preorder, which kernel coincides with the readiness equival...

Transition systems are well-established as a semantic model for distributed systems with preorders that serve as criteria for reene-ment of a more abstract transition system to a more concrete one. To reason about probabilistic phenomena such as failure rates, we need to extend models and methods that have proven successful for non-probabilistic systems to a probabilistic setting. In this paper...