Scalar Outcomes Suffice for Finitary Probabilistic Testing

DOI10.1007/978-3-540-71316-6_25zbMath1187.68148OpenAlexW1805999688MaRDI QIDQ5756507

Chenyi Zhang, Yu-xin Deng, Carroll Morgan, Robert J. van Glabbeek

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

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

Related Items (8)

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

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