Results 1 - 10 of 18,565

Testing Reactive Probabilistic Processes

by Sonja Georgievska, Suzana Andova
"... We define a testing equivalence in the spirit of De Nicola and Hennessy for reactive probabilistic processes, i.e. for processes where the internal nondeterminism is due to random behaviour. We characterize the testing equivalence in terms of ready-traces. From the characterization it follows that t ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We define a testing equivalence in the spirit of De Nicola and Hennessy for reactive probabilistic processes, i.e. for processes where the internal nondeterminism is due to random behaviour. We characterize the testing equivalence in terms of ready-traces. From the characterization it follows

Metric semantics for reactive probabilistic processes

by Gethin Josiah Norman , 1997
"... In this thesis we present three mathematical frameworks for the modelling of reac-tive probabilistic communicating processes. We first introduce generalised labelled transition systems as a model of such processes and introduce an equivalence, coarser than probabilistic bisimulation, over these syst ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
In this thesis we present three mathematical frameworks for the modelling of reac-tive probabilistic communicating processes. We first introduce generalised labelled transition systems as a model of such processes and introduce an equivalence, coarser than probabilistic bisimulation, over

A Testing Equivalence for Reactive Probabilistic Processes

by M. Z. Kwiatkowska, G. J. Norman , 1998
"... We consider a generalisation of Larsen and Skou's [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, external (deterministic) and internal (non-deterministic) choice. We propose an operational preorder and equivalence for pro ..."
Abstract - Cited by 29 (1 self) - Add to MetaCart
We consider a generalisation of Larsen and Skou's [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, external (deterministic) and internal (non-deterministic) choice. We propose an operational preorder and equivalence

A Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes

by M. Z. Kwiatkowska, G. J. Norman - In Proc. COMPROX '98, Electronic Notes in TCS vol.13 , 1998
"... Metric-Space Denotational Semantics for Reactive Probabilistic Processes M.Z. Kwiatkowska and G.J. Norman School of Computer Science, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK Abstract We consider the calculus of Communicating Sequential Processes (CSP) [8] extended with act ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
Metric-Space Denotational Semantics for Reactive Probabilistic Processes M.Z. Kwiatkowska and G.J. Norman School of Computer Science, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK Abstract We consider the calculus of Communicating Sequential Processes (CSP) [8] extended

Discrete Time Generative-Reactive Probabilistic Processes with Different Advancing Speeds

by M. Bravetti, A. Aldini - Theor. Comput. Sci
"... We present a process algebra expressing probabilistic external/internal choices, multi-way synchronizations, and processes with dierent advancing speeds in the context of discrete time, i.e. where time is not continuous but is represented by a sequence of discrete steps as in Discrete Time Markov Ch ..."
Abstract - Cited by 9 (3 self) - Add to MetaCart
Chains (DTMCs). To this end, we introduce a variant of CSP that employs a probabilistic asynchronous parallel operator whose synchronization mechanism is based on a mixture of the classical generative and reactive models of probability. In particular, dierently from existing discrete time process

Abstract EXPRESS’98 to appear A Testing Equivalence for Reactive Probabilistic Processes

by M. Z. Kwiatkowska, G. J. Norman
"... We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, external (deterministic) and internal (non-deterministic) choice. We propose an operational preorder and equivalence for processe ..."
Abstract - Add to MetaCart
We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, external (deterministic) and internal (non-deterministic) choice. We propose an operational preorder and equivalence

This work is licensed under the Creative Commons Attribution License. Testing Reactive Probabilistic Processes

by C Sonja Georgievska, Suzana Andova, Sonja Georgievska, Suzana Andova
"... We define a testing equivalence in the spirit of De Nicola and Hennessy for reactive probabilistic processes, i.e. for processes where the internal nondeterminism is due to random behaviour. We characterize the testing equivalence in terms of ready-traces. From the characterization it follows that t ..."
Abstract - Add to MetaCart
We define a testing equivalence in the spirit of De Nicola and Hennessy for reactive probabilistic processes, i.e. for processes where the internal nondeterminism is due to random behaviour. We characterize the testing equivalence in terms of ready-traces. From the characterization it follows

Bisimulation through probabilistic testing

by Kim G. Larsen, Arne Skou - in “Conference Record of the 16th ACM Symposium on Principles of Programming Languages (POPL , 1989
"... We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm can distinguish, with a probability arbitrarily clos ..."
Abstract - Cited by 529 (14 self) - Add to MetaCart
We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm can distinguish, with a probability arbitrarily

Probabilistic Principal Component Analysis

by Michael E. Tipping, Chris M. Bishop - JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B , 1999
"... Principal component analysis (PCA) is a ubiquitous technique for data analysis and processing, but one which is not based upon a probability model. In this paper we demonstrate how the principal axes of a set of observed data vectors may be determined through maximum-likelihood estimation of paramet ..."
Abstract - Cited by 709 (5 self) - Add to MetaCart
Principal component analysis (PCA) is a ubiquitous technique for data analysis and processing, but one which is not based upon a probability model. In this paper we demonstrate how the principal axes of a set of observed data vectors may be determined through maximum-likelihood estimation

Probabilistic Latent Semantic Analysis

by Thomas Hofmann - In Proc. of Uncertainty in Artificial Intelligence, UAI’99 , 1999
"... Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two--mode and co-occurrence data, which has applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent Sema ..."
Abstract - Cited by 771 (9 self) - Add to MetaCart
Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two--mode and co-occurrence data, which has applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent
Results 1 - 10 of 18,565