### Abstract

We introduce a notion of finite testing, based on statistical hypothesis tests, via a variant of the well-known trace machine. Under this scenario, two processes are deemed observationally equivalent if they cannot be distinguished by any finite test. We consider processes modeled as image finite probabilistic automata and prove that our notion of observational equivalence coincides with the trace distribution equivalence proposed by Segala. Along the way, we give an explicit characterization
of the set of probabilistic executions of an arbitrary probabilistic automaton A and generalize the Approximation Induction Principle by defining an algebraic CPO structure on the set of trace distributions of A. We also prove limit and convex closure properties of trace distributions in an appropriate metric space.

Original language | English |
---|---|

Place of Publication | Nijmegen |

Publisher | Radboud University Nijmegen |

Number of pages | 49 |

Publication status | Published - Jan 2006 |

### Publication series

Name | ICIS Technical Report |
---|---|

Publisher | Radboud University Nijmegen |

No. | R06002 |

### Keywords

- CR-F.1.2
- CR-F.4.3
- CR-F.1.1
- MSC-68Q10
- MSC-68Q05
- MSC-68Q75
- MSC-68Q55

## Fingerprint Dive into the research topics of 'A Testing Scenario for Probabilistic Processes'. Together they form a unique fingerprint.

## Cite this

Cheung, L., Stoelinga, M., & Vaandrager, F. (2006).

*A Testing Scenario for Probabilistic Processes*. (ICIS Technical Report; No. R06002). Nijmegen: Radboud University Nijmegen.