Checking for CFFD-preorder with tester processes

DOI10.1007/3-540-46419-0_20MaRDI QIDQ4518900zbMATH OpenFDO

Authors Juhana Helovuo, Antti Valmari

Publication date 20 May 2001

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

Full work available at URL https://doi.org/10.1007/3-540-46419-0_20

zbMATH Keywords

labelled transition systemstester process

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• All congruences below stability-preserving fair testing or CFFD
• Testing equivalence as a bisimulation equivalence
• Testing preorders for probabilistic processes.
• Testing preorders for probabilistic processes
• Composition and abstraction

Cited in

(1)

• Multiparty testing preorders

This page was built for publication: Checking for CFFD-preorder with tester processes

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