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

Imposing certain restrictions on the transition system that defines 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 equi...

We present a theoretical framework which allows to define in a uniform way coinductive characterisations of nearly any semantic preorder or equivalence between processes, by means of simulations up-to and bisimulations up-to. In particular, all the semantics in the linear time-branching time spectrum are covered. Constrained simulations, that generalise plain simulations by including a constrai...

I this paper, we investigate the integrated information and pricing strategy 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 stage when consumers are less certain about their valuations. We find that the optimal pricing strategy may be highly dependent on the amount of information available at pre...

Abs t rac t . Two different formalisms for concurrency are compared and are shown to have common foundations. The Input/Output automaton model and the theory of testing are analyzed in the framework of transition systems. The relationship between the fair and quiescent preorders of I/O automata is investigated and the two preorders are shown to coincide on a large class of automata. I/O automat...

Two diierent formalisms for concurrency are compared and are shown to have common foundations. The Input/Output automaton model and the theory of testing are analyzed in the framework of transition systems. The relationship between the fair and quiescent preorders of I/O automata is investigated and the two preorders are shown to coincide on a large class of automata. I/O automata are encoded i...

This paper presents a testing-based semantic preorder for reasoning about the predictability of realtime systems specified using the process description language TPL. The predictability of the systems is measured in terms of the amount of variability present in their “activity-completion times”. The semantic preorder is shown to coincide with an already existing, well-investigated implementatio...