A testing scenario for probabilistic processes
TLDR
It is proved that the notion of observational equivalence coincides with the trace distribution equivalence proposed by Segala, which gives an explicit characterization of the set of probabilistic generalize the Approximation Induction Principle.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 generalize the Approximation Induction Principle by defining an also prove limit and convex closure properties of trace distributions in an appropriate metric space.read more
Citations
More filters
Proceedings ArticleDOI
On Probabilistic Automata in Continuous Time
TL;DR: A compositional behavioural model is developed that integrates a variation of probabilistic automata into a conservative extension of interactive Markov chains, rich enough to embody the semantics of generalised stochastic Petri nets.
Journal ArticleDOI
Real and Complex Analysis. By W. Rudin. Pp. 412. 84s. 1966. (McGraw-Hill, New York.)
TL;DR: In this paper, the Riesz representation theorem is used to describe the regularity properties of Borel measures and their relation to the Radon-Nikodym theorem of continuous functions.
Proceedings ArticleDOI
Abstract probabilistic automata
Benoît Delahaye,Joost-Pieter Katoen,Kim Guldstrand Larsen,Axel Legay,Mikkel L. Pedersen,Falak Sher,Andrzej Wasowski +6 more
TL;DR: This paper has developed a complete abstraction theory for PAs, and also proposes the first specification theory for them, which supports both satisfaction and refinement operators, together with classical stepwise design operators.
Book ChapterDOI
Concurrency and composition in a stochastic world
TL;DR: This work gives a detailled account of the concept of relations on distributions, and discusses how this can generalise known notions of weak simulation and bisimulation, such as to fuse sequences of internal transitions.
References
More filters
Book
Real and complex analysis
TL;DR: In this paper, the Riesz representation theorem is used to describe the regularity properties of Borel measures and their relation to the Radon-Nikodym theorem of continuous functions.
Book
A calculus of communicating systems
TL;DR: A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0.
Book
Introduction to lattices and order
TL;DR: The Stone Representation Theorem for Boolean algebras and its application to lattices in algebra can be found in this article, where the structure of finite distributive lattices and finite Boolean algebraic structures are discussed.
Book
Probability and Statistics With Reliability, Queuing and Computer Science Applications
TL;DR: Probability and Statistics with Reliability, Queuing and Computer Science Applications, Second Edition as discussed by the authors is a comprehensive introduction to probabiliby, stochastic processes, and statistics for students of computer science, electrical and computer engineering, and applied mathematics.