. Transition systems are a basic semantic model for formal description, specification, and analysis of concurrent and distributed systems. In order to describe and analyze aspects of reliability, such as the likelihood of trace and failure, this model has been extended in various ways to handle probabilistic behavior. To use these models for specification and stepwise development of systems, it is important to develop appropriate refinement preorders. In the paper, we develop refinement preorders based on a framework of testing for a model that represents both nondeterministic and probabilistic choices as independent concepts [YL92]. Our main contribution is a notion of reward testing, and a denotational characterization of a testing preord...
AbstractWe consider the specification and testing of systems where probabilistic information is not ...
Labeled transition systems are typically used as behavioral models of concurrent processes. Their la...
Labeled transition systems are typically used as behavioral models of concurrent processes. Their la...
AbstractTransition systems are well established as a semantic model for distributed systems. There a...
Before we combine actions and probabilities two very obvious questions should be asked. Firstly, wha...
Abstract. Two of the most studied extensions of trace and testing equivalences to non-deterministic ...
AbstractWe propose a language for testing concurrent processes and examine its strength in terms of ...
Two of the most studied extensions of trace and testing equivalences to nondeterministic and probabi...
Before we combine actions and probabilities two very obvious questions should be asked. Firstly, wha...
AbstractWe consider a generalisation of Larsen and Skou's [19] reactive probabilistic transition sys...
We introduce a notion of real-valued reward testing for probabilistic processes by extending the tra...
We introduce a notion of real-valued reward testing for probabilistic processes by extending the tra...
We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems whi...
AbstractWe present a testing preorder for probabilistic processes based on a quantification of the p...
AbstractWe consider the specification and testing of systems where probabilistic information is not ...
Labeled transition systems are typically used as behavioral models of concurrent processes. Their la...
Labeled transition systems are typically used as behavioral models of concurrent processes. Their la...
AbstractTransition systems are well established as a semantic model for distributed systems. There a...
Before we combine actions and probabilities two very obvious questions should be asked. Firstly, wha...
Abstract. Two of the most studied extensions of trace and testing equivalences to non-deterministic ...
AbstractWe propose a language for testing concurrent processes and examine its strength in terms of ...
Two of the most studied extensions of trace and testing equivalences to nondeterministic and probabi...
Before we combine actions and probabilities two very obvious questions should be asked. Firstly, wha...
AbstractWe consider a generalisation of Larsen and Skou's [19] reactive probabilistic transition sys...
We introduce a notion of real-valued reward testing for probabilistic processes by extending the tra...
We introduce a notion of real-valued reward testing for probabilistic processes by extending the tra...
We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems whi...
AbstractWe present a testing preorder for probabilistic processes based on a quantification of the p...
AbstractWe consider the specification and testing of systems where probabilistic information is not ...
Labeled transition systems are typically used as behavioral models of concurrent processes. Their la...
Labeled transition systems are typically used as behavioral models of concurrent processes. Their la...