de.learnlib.algorithms.adt.api.SubtreeReplacer Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of learnlib-adt Show documentation

This artifact provides the implementation of the ADT learning algorithm as described in the Master thesis "Active Automata Learning with Adaptive Distinguishing Sequences" (http://arxiv.org/abs/1902.01139) by Markus Frohme.

There is a newer version: 0.18.0

Show newest version

/* Copyright (C) 2013-2018 TU Dortmund
 * This file is part of LearnLib, http://www.learnlib.de/.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package de.learnlib.algorithms.adt.api;

import java.util.Set;

import javax.annotation.ParametersAreNonnullByDefault;

import de.learnlib.algorithms.adt.adt.ADT;
import de.learnlib.algorithms.adt.model.ReplacementResult;
import net.automatalib.automata.transout.MealyMachine;
import net.automatalib.words.Alphabet;

/**
 * Interface for configuration objects that specify how nodes of the current ADT should be replaced.
 *
 * @author frohme
 */
@ParametersAreNonnullByDefault
public interface SubtreeReplacer {

    /**
     * Compute how certain nodes of the ADT should be replaced. It is assumed, the replacements are well-defined (i.e.
     * each replaced node belongs to a distinct subtree).
     * 
     * Currently only replacements in the form of an ADS (i.e. no reset nodes) are supported.
     *
     * @param hypothesis
     *         the current hypothesis (without any undefined transitions)
     * @param inputs
     *         the input alphabet
     * @param adt
     *         the current adaptive discrimination tree
     * @param 
     *         (hypothesis) state type
     * @param 
     *         input alphabet type
     * @param 
     *         output alphabet type
     *
     * @return A {@link Set} of proposed replacements
     */
     Set> computeReplacements(MealyMachine hypothesis,
                                                                  Alphabet inputs,
                                                                  ADT adt);

}