Fair must testing for I/O automata

DOI10.1007/978-3-031-15629-8_30MaRDI QIDQ6163902zbMATH OpenFDO

Authors Rob van Glabbeek

Publication date 26 July 2023

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

Full work available at URL https://arxiv.org/abs/2212.11248

zbMATH Keywords

fairnessI/O automatamust testing

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Abstract: The concept of must testing is naturally parametrised with a chosen completeness criterion or fairness assumption. When taking weak fairness as used in I/O automata, I show that it characterises exactly the fair preorder on I/O automata as defined by Lynch & Tuttle.

Recommendations

• A note on fairness in I/O automata
• Quiescence, fairness, testing, and the notion of implementation
• Publication:4942011
• Fair testing
• Explicit fairness in testing semantics

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 4110131 (Why is no real title available?)
• Characterising Testing Preorders for Finite Probabilistic Processes
• Divergence and fair testing
• Justness. A completeness criterion for capturing liveness properties (extended abstract)
• Quiescence, fairness, testing, and the notion of implementation
• Testing equivalences for processes
• Testing probabilistic automata

This page was built for publication: Fair must testing for I/O automata

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