Approximate testing equivalence based on time, probability, and observed behavior

MaRDI QIDQ5151030zbMATH OpenFDO

Authors Alessandro Aldini

Publication date 16 February 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?QAPL2010.1

Mathematics Subject Classification ID

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

• Approximating Markovian testing equivalence
• A testing scenario for probabilistic processes
• Quantitative relations and approximate process equivalences.
• Testing Probabilistic Equivalence Through Reinforcement Learning
• scientific article; zbMATH DE number 1696897

Cited in

(5)

• Approximate testing and its relationship to learning
• Approximate testing with error relative to input size.
• Testing probabilistic equivalence through reinforcement learning
• Testing Probabilistic Equivalence Through Reinforcement Learning
• Approximating Markovian testing equivalence

This page was built for publication: Approximate testing equivalence based on time, probability, and observed behavior

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