Communicating sequential processes
Communicating sequential processes
Verification of multiprocess probabilistic protocols
Distributed Computing
Reasoning About Probabilistic Behavior in Concurrent Systems
IEEE Transactions on Software Engineering
Observation equivalence as a testing equivalence
Theoretical Computer Science
Bisimulation through probabilistic testing
Information and Computation
Communication and Concurrency
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Testing Preorders for Probabilistic Processes
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Testing Equivalences and Fully Abstract Models for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Algebraic Reasoning for Real-Time Probabilistic Processes with Uncertain Information
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Testing and Refinement for Nondeterministic and Probabilistic Processes
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
The anchored version of the temporal framework
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Composition and Behaviors of Probabilistic I/O Automata
CONCUR '94 Proceedings of the Concurrency Theory
Compositional Testing Preorders for Probabilistic Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Probabilistic temporal logics for finite and bounded models
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Performance Analysis Using Stochastic Petri Nets
IEEE Transactions on Computers
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
In this paper, to develop a refinement relation for probabilistic and nondeterministic systems, we study a notion of probabilistic testing, that extends the testing framework of de Nicola and Hennessy for nondeterministic processes to the probabilistic setting. We present a model of probabilistic computation trees, which corresponds to the classic trace model for non-probabilistic systems. Our main contribution is a fully abstract characterization of the may-testing preorder which is essential for the probabilistic setting. The characterization is given based on convex closures of probabilistic computation trees.