Testing semantics for unbounded nondeterminism

DOI10.1007/BFB0002780MaRDI QIDQ4536988zbMATH OpenFDO

Authors Luis Fdo. Llana Díaz, Manuel Núñez

Publication date 6 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0002780

zbMATH Keywords

CSPoperational semanticsprocess algebratesting semanticsunbounded nondeterminism

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computing methodologies and applications (68U99)

Recommendations

• Characterising Testing Preorders for Finite Probabilistic Processes
• Unbounded nondeterminism in CSP
• Testing Finitary Probabilistic Processes
• Concurrent testing of processes
• Unbounded Non-determinism in CSP

Cited in

(6)

• An invitation to friendly testing
• Semi-decidability of may, must and probabilistic testing in a higher-type setting
• Semantical proofs of correctness for programs performing non-deterministic tests on real numbers
• scientific article; zbMATH DE number 1324657 (Why is no real title available?)
• scientific article; zbMATH DE number 6125212 (Why is no real title available?)
• Extensional and intensional semantics of bounded and unbounded nondeterminism

This page was built for publication: Testing semantics for unbounded nondeterminism

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