A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Extensional equivalence for transition systems
Acta Informatica
Algebraic theory of processes
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Compositional Methods for Probabilistic Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Testing Probabilistic Automata
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science - Components and objects
Basic Observables for Probabilistic May Testing
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
A testing scenario for probabilistic processes
Journal of the ACM (JACM)
Observing Branching Structure through Probabilistic Contexts
SIAM Journal on Computing
Testing Finitary Probabilistic Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the Expressive Power of Schedulers in Distributed Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Making random choices invisible to the scheduler
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Composing systems while preserving probabilities
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Time-bounded reachability in distributed input/output interactive probabilistic chains
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
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
Probabilistic CSP: preserving the laws via restricted schedulers
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing equivalence is too strong and distinguishes between processes that are observationally equivalent. The problem arises from the observation that the classical compose-and-schedule approach yields unrealistic overestimation of the probabilities, a phenomenon that has been recently well studied from the point of view of compositionality (de Alfaro/Henzinger/Jhala 2001, Cheung/Lynch/Segala/Vaandrager 2006), in the context of randomized protocols (Chatzikokolakis/Palamidessi 2007), and in probabilistic model checking (Giro/D'Argenio/Ferrer Fioriti 2009). To that end, we propose a new testing theory, aiming at preserving the probability information in a parallel context. The resulting testing equivalence is insensitive to the exact moment the internal and the probabilistic choices occur. We also give an alternative characterization of the testing preorder as a probabilistic ready-trace preorder.