Fair must testing for I/O automata

DOI10.1007/978-3-031-15629-8_30zbMath1524.68178arXiv2212.11248MaRDI QIDQ6163902

Robert J. 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Testing equivalences for processes
• Quiescence, fairness, testing, and the notion of implementation
• Justness. A completeness criterion for capturing liveness properties (extended abstract)
• Characterising Testing Preorders for Finite Probabilistic Processes
• Divergence and fair testing
• Testing probabilistic automata

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