All Downloads are FREE. Search and download functionalities are using the official Maven repository.

de.learnlib.algorithms.lstar.closing.ClosingStrategy Maven / Gradle / Ivy

Go to download

This artifact provides the implementation of the L* learning algorithm described in the paper "Learning Regular Sets from Queries and Counterexamples" (https://doi.org/10.1016/0890-5401(87)90052-6) by Dana Angluin including variations and optimizations thereof such as the versions based on "On the Learnability of Infinitary Regular Sets" (https://dx.doi.org/10.1006/inco.1995.1070) by Oded Maler and Amir Pnueli or "Inference of finite automata using homing sequences" (http://dx.doi.org/10.1006/inco.1993.1021) by Ronald L. Rivest and Robert E. Schapire.

There is a newer version: 0.17.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.lstar.closing;

import java.util.List;

import de.learnlib.api.oracle.MembershipOracle;
import de.learnlib.datastructure.observationtable.ObservationTable;
import de.learnlib.datastructure.observationtable.Row;

/**
 * A closing strategy, determining how to proceed when an observation table needs to be closed.
 *
 * @param 
 *         type variable for input symbol upper bound.
 * @param 
 *         type variable for output symbol upper bound.
 *
 * @author Malte Isberner
 */
public interface ClosingStrategy {

    /**
     * Given a list of row equivalence classes, this method selects for each of the classes one (representative) row
     * which is being closed. This corresponds to selecting one of several long prefixes (i.e., transitions reaching an
     * unknown state) to be an access sequence.
     * 

* By contract, the size of the the returned list must equal the size of the {@code unclosedClasses} * argument. * * @param unclosedClasses * the list of row equivalence classes * @param table * the observation table * @param oracle * the membership oracle * * @return a selection of representative rows to be closed. */ List> selectClosingRows(List>> unclosedClasses, ObservationTable table, MembershipOracle oracle); }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy