AI Chat AI Image Generator AI Video Text to Speech

Fair Must Testing for I/O Automata

12/21/2022

∙

by Rob van Glabbeek, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 12/17/2022

Just Testing

The concept of must testing is naturally parametrised with a chosen comp...

0 Rob van Glabbeek, et al. ∙

research

∙ 10/27/2017

The word and order problems for self-similar and automata groups

We prove that the word problem is undecidable in functionally recursive ...

0 Laurent Bartholdi, et al. ∙

research

∙ 10/22/2017

Timed Concurrent State Machines

Timed Concurrent State Machines are an application of Alur's Timed Autom...

0 Wiktor B. Daszczuk, et al. ∙

research

∙ 09/09/2019

Compositional Liveness-Preserving Conformance Testing of Timed I/O Automata -- Technical Report

I/O conformance testing theories (e.g., ioco) are concerned with formall...

0 Lars Luthmann, et al. ∙

research

∙ 10/19/2022

Transformers Learn Shortcuts to Automata

Algorithmic reasoning requires capabilities which are most naturally und...

0 Bingbin Liu, et al. ∙

research

∙ 03/02/2021

The KL-Divergence between a Graph Model and its Fair I-Projection as a Fairness Regularizer

Learning and reasoning over graphs is increasingly done by means of prob...

0 Maarten Buyl, et al. ∙

research

∙ 12/02/2020

Making Weak Memory Models Fair

We observe that the standard notion of thread fairness is insufficient f...

0 Ori Lahav, et al. ∙