Verification of an alternating bit protocol by means of process algebra
Proceedings of the International Spring School on Mathematical method of specification and synthesis of software systems '85
On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
Testing equivalences and fully abstract models for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Testing preorders for probabilistic processes
Information and Computation
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Testing Probabilistic Automata
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Specification, testing and implementation relations for symbolic-probabilistic systems
Theoretical Computer Science
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science - Components and objects
A testing scenario for probabilistic processes
Journal of the ACM (JACM)
A Hierarchy of Equivalences for Probabilistic Processes
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Scalar outcomes suffice for finitary probabilistic testing
ESOP'07 Proceedings of the 16th European conference on Programming
Formal testing of systems presenting soft and hard deadlines
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Customized testing for probabilistic systems
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Implementation relations for stochastic finite state machines
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Derivation of a suitable finite test suite for customized probabilistic systems
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Testing of symbolic-probabilistic systems
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
| Hi-index | 0.00 |
Recently, a large number of equivalences for probabilistic automata has been proposed in the literature. Except for the probabilistic bisimulation of Larsen & Skou, none of these equivalences has been characterized in terms of an intuitive testing scenario. In our view, this is an undesirable situation: in the end, the behavior of an automaton is what an external observer perceives. In this paper, we propose a simple and intuitive testing scenario for probabilistic automata and we prove that the equivalence induced by this scenario coincides with the trace distribution equivalence proposed by Segala.