Scalar Outcomes Suffice for Finitary Probabilistic Testing

DOI10.1007/978-3-540-71316-6_25MaRDI QIDQ5756507zbMATH OpenOpenAlexFDO

Authors Yuxin Deng, Chenyi Zhang, Rob van Glabbeek, Carroll Morgan

Publication date 4 September 2007

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71316-6_25

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• A testing scenario for probabilistic processes
• Probabilistic bisimilarity as testing equivalence
• scientific article; zbMATH DE number 7311343
• Remarks on testing probabilistic processes
• Testing Finitary Probabilistic Processes

Cited in

(8)

• \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
• Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
• Towards general axiomatizations for bisimilarity and trace semantics
• Real-reward testing for probabilistic processes
• Testing Finitary Probabilistic Processes
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• On real reward testing
• Preface

This page was built for publication: Scalar Outcomes Suffice for Finitary Probabilistic Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756507)