de.learnlib.algorithm.dhc.mealy.MealyDHCState Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of learnlib-dhc Show documentation
Show all versions of learnlib-dhc Show documentation
This artifact provides the implementation of the DHC learning algorithm as described in the paper "Automata
Learning with on-the-Fly Direct Hypothesis Construction" (https://doi.org/10.1007/978-3-642-34781-8_19) by Maik
Merten, Falk Howar, Bernhard Steffen, and Tiziana Margaria.
The newest version!
/* Copyright (C) 2013-2023 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.algorithm.dhc.mealy;
import java.util.Map;
import java.util.Set;
import com.google.common.collect.Maps;
import net.automatalib.automaton.transducer.CompactMealy;
import net.automatalib.common.util.mapping.MutableMapping;
import net.automatalib.word.Word;
/**
* Class that contains all data that represent the internal state of the {@link MealyDHC} learner.
*
* @param
* The input alphabet type.
* @param
* The output alphabet type.
*/
public class MealyDHCState {
private final Set> splitters;
private final CompactMealy hypothesis;
private final Map> accessSequences;
MealyDHCState(Set> splitters,
CompactMealy hypothesis,
MutableMapping> accessSequences) {
this.splitters = splitters;
this.hypothesis = hypothesis;
this.accessSequences = Maps.newHashMapWithExpectedSize(hypothesis.size());
for (Integer s : hypothesis.getStates()) {
final MealyDHC.QueueElement elem = accessSequences.get(s);
if (elem != null) {
this.accessSequences.put(s, elem);
}
}
}
Set> getSplitters() {
return splitters;
}
CompactMealy getHypothesis() {
return hypothesis;
}
Map> getAccessSequences() {
return accessSequences;
}
}