Toy models

Benchmark models

    print · login   

Toy models

Tag: toy

Description

This benchmark contains toy Mealy machine models from several papers:

  • The machine with 3 states and 2 inputs from Figure 5 of [LY96], used to illustrate that distinguishing sequences not always exist.
  • The machine with 6 states and 2 inputs from Figure 6 of [LY96], used to illustrate adaptive distinguishing sequences.
  • The machine with 4 states and 2 inputs from Figure 1 of [Naik97], used to illustrate an algorithm for construction of UIO sequences.
  • The machine with 3 states and 2 inputs from Figure 1 of [Vaa17], used to explain the L* algorithm.
  • The turnstile example with 2 states and 2 inputs from Figure 1 of [SPHY18], used to explain the SPYH conformance testing method.
  • A machine with 4 states and inputs {a, b} that outputs 1 if both the number of past a's and past b's is even, and 0 otherwise.
  • A coffee machine with 3 states and 3 inputs.