Relating may and must testing semantics for discrete timed process algebras

DOI10.1007/3-540-46674-6_8MaRDI QIDQ4501573zbMATH OpenFDO

Authors Luis F. Llana-Díaz, David de Frutos Escrig

Publication date 26 April 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-46674-6_8

zbMATH Keywords

must semanticsmust testing semantics

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)

Recommendations

• Testing semantics for urgent timed process algebras
• Timed testing of concurrent systems
• scientific article; zbMATH DE number 2060758
• scientific article; zbMATH DE number 1515281
• Timed testing of concurrent systems

Cited in

(2)

• Testing semantics for urgent timed process algebras
• Divergence in testing and readiness semantics

This page was built for publication: Relating may and must testing semantics for discrete timed process algebras

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