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
Communication and concurrency
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
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
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
Simulations Between Specifications of Distributed Systems
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Fully Abstract Characterizations of Testing Preorders 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
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
Remarks on Testing Probabilistic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Scalar outcomes suffice for finitary probabilistic testing
ESOP'07 Proceedings of the 16th European conference on Programming
Characterising probabilistic processes logically
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
The earlier the better: a theory of timed actor interfaces
Proceedings of the 14th international conference on Hybrid systems: computation and control
Linear-time and may-testing in a probabilistic reactive setting
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Retaining the probabilities in probabilistic testing theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 5.23 |
Transition systems are well established as a semantic model for distributed systems. There are several preorders that serve as criteria for refinement of an abstract transition system to a more concrete one. To reason about probabilistic phenomena such as failures and randomization, we need to extend models and methods that have proven successful for nonprobabilistic systems to a probabilistic setting. In this paper, we develop a refinement preorder for a probabilistic extension of the transition systems model. The preorder is based on a notion of testing, where refinement corresponds to an improvement in the "worst-case" behavior of a process. The main result of the paper is that this preorder can be described by a notion of probabilistic simulation, which generalizes the standard simulation preorder for ordinary transition system. To our knowledge, this simulation preorder has not been previously described in the literature, and is strictly weaker than previously proposed simulations for probabilistic transition systems.