net.automatalib.util.automata.cover.IncrementalTransitionCoverIterator Maven / Gradle / Ivy
Show all versions of automata-util Show documentation
/* Copyright (C) 2013-2019 TU Dortmund
* This file is part of AutomataLib, http://www.automatalib.net/.
*
* 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 net.automatalib.util.automata.cover;
import java.util.ArrayDeque;
import java.util.Collection;
import java.util.Iterator;
import java.util.Queue;
import javax.annotation.ParametersAreNonnullByDefault;
import com.google.common.collect.AbstractIterator;
import com.google.common.collect.Sets;
import net.automatalib.automata.DeterministicAutomaton;
import net.automatalib.commons.util.mappings.MutableMapping;
import net.automatalib.words.Word;
/**
* An iterator for the transition cover of an automaton. Words are computed lazily (i.e. only when request by {@link
* #next()}.
*
* Supports incremental computation, i.e. given a set of cover traces, only sequences for transitions not covered by
* these traces are returned.
*
* @param
* automaton state type
* @param
* input symbol type
*
* @author frohme
* @see Covers#transitionCover(DeterministicAutomaton, Collection, Collection)
*/
@ParametersAreNonnullByDefault
class IncrementalTransitionCoverIterator extends AbstractIterator> {
private final DeterministicAutomaton automaton;
private final Collection inputs;
private final Collection> oldCover;
private final MutableMapping> reach;
private final Queue> bfsQueue;
private Iterator inputIterator;
private Record curr;
IncrementalTransitionCoverIterator(DeterministicAutomaton automaton,
Collection inputs,
Collection> oldCover) {
this.automaton = automaton;
this.inputs = inputs;
this.oldCover = oldCover;
this.reach = automaton.createStaticStateMapping();
this.bfsQueue = new ArrayDeque<>();
}
@Override
protected Word computeNext() {
// first invocation
if (inputIterator == null) {
initialize();
curr = bfsQueue.poll();
inputIterator = inputs.iterator();
}
while (curr != null) {
while (inputIterator.hasNext()) {
final I in = inputIterator.next();
if (curr.coveredInputs.add(in)) {
final S succ = automaton.getSuccessor(curr.state, in);
if (succ != null) {
final Word succAs = curr.accessSequence.append(in);
if (reach.get(succ) == null) {
final Record succRec =
new Record<>(succ, succAs, Sets.newHashSetWithExpectedSize(inputs.size()));
reach.put(succ, succRec);
bfsQueue.add(succRec);
}
return succAs;
}
}
}
curr = bfsQueue.poll();
inputIterator = inputs.iterator();
}
return endOfData();
}
private void initialize() {
final S init = automaton.getInitialState();
final Record initRec = new Record<>(init, Word.epsilon(), Sets.newHashSetWithExpectedSize(inputs.size()));
reach.put(init, initRec);
bfsQueue.add(initRec);
Covers.buildReachFromTransitionCover(reach,
bfsQueue,
automaton,
oldCover,
(s, as) -> new Record<>(s,
as,
Sets.newHashSetWithExpectedSize(inputs.size())),
(w) -> {});
}
}