Testing Finitary Probabilistic Processes

Authors:
Yuxin Deng;Rob Glabbeek;Matthew Hennessy;Carroll Morgan
Affiliations:
Shanghai Jiao Tong University, China;NICTA, Sydney, Australia and University of New South Wales, Sydney, Australia;Trinity College Dublin, Ireland;University of New South Wales, Sydney, Australia
Venue:
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Year:
2009

Citing 10
Cited 12

Communicating sequential processes

Communicating sequential processes
Communication and concurrency

Communication and concurrency
Probabilistic non-determinism

Probabilistic non-determinism
Testing Probabilistic and Nondeterministic Processes

Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Weak Bisimulation is Sound and Complete for PCTL*

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Testing Probabilistic Automata

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)

Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Remarks on Testing Probabilistic Processes

Electronic Notes in Theoretical Computer Science (ENTCS)
Observing Branching Structure through Probabilistic Contexts

SIAM Journal on Computing
Scalar outcomes suffice for finitary probabilistic testing

ESOP'07 Proceedings of the 16th European conference on Programming

Concurrency and composition in a stochastic world

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Characterising probabilistic processes logically

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
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
On the semantics of Markov automata

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Retaining the probabilities in probabilistic testing theory

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Compositional reasoning for markov decision processes

FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Modelling probabilistic wireless networks

FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Open bisimulation for quantum processes

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On the semantics of Markov automata

Information and Computation
A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences

Information and Computation
A semantics for every GSPN

PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Revisiting weak simulation for substochastic markov chains

QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide both modal- and relational characterisations of may- and must-testing preorders for recursive CSP processes with divergence, featuring probabilistic as well as nondeterministic choice. May testing is characterised in terms of simulation, and must testing in terms of failure simulation. To this end we develop weak transitions between probabilistic processes, elaborate their topological properties, and express divergence in terms of partial distributions.