“…For each σ ∈ Σ o , each 0 ≤ i ≤ num o and each k ≥ 0, let ((m σ , i), k) denote the multi-set that consists of k copies of (m σ , i). We define |((m σ , i), k)| = k, obs ∪Σ out obs ∪{tick})×Q obs can be defined, in a way that is similar to the partial transition function of [16] for FIFO observation channels. The observation channel automaton is then given by G obs = (Q obs , Σ in obs ∪ Σ out obs ∪ {tick}, δ obs , q {} ), where q {} ∈ Q obs is the initial state that corresponds to the empty observation channel.…”