Fair must testing for I/O automata

DOI10.1007/978-3-031-15629-8_30zbMATH Open1524.68178arXiv2212.11248MaRDI QIDQ6163902FDOQ6163902

Authors: Rob van Glabbeek 

Publication date: 26 July 2023

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

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.

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

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

zbMATH Keywords

fairnessI/O automatamust testing

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Testing equivalences for processes
• Title not available (Why is that?)
• Characterising Testing Preorders for Finite Probabilistic Processes
• Testing probabilistic automata
• Quiescence, fairness, testing, and the notion of implementation
• Divergence and fair testing
• Justness. A completeness criterion for capturing liveness properties (extended abstract)

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)