net.automatalib.util.ts.copy.TSCopy Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of automata-util Show documentation
Show all versions of automata-util Show documentation
This artifact provides various common utility operations for analyzing and manipulating
automata and graphs, such as traversal, minimization and copying.
/* 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.ts.copy;
import java.util.Collection;
import java.util.function.Function;
import java.util.function.Predicate;
import net.automatalib.automata.Automaton;
import net.automatalib.automata.MutableAutomaton;
import net.automatalib.automata.UniversalAutomaton;
import net.automatalib.commons.util.functions.FunctionsUtil;
import net.automatalib.commons.util.mappings.Mapping;
import net.automatalib.ts.TransitionPredicate;
import net.automatalib.ts.TransitionSystem;
import net.automatalib.ts.UniversalTransitionSystem;
import net.automatalib.util.automata.predicates.TransitionPredicates;
import net.automatalib.util.ts.TS;
import net.automatalib.util.ts.traversal.TSTraversalMethod;
public final class TSCopy {
private TSCopy() {
throw new IllegalStateException("Constructor should never be invoked");
}
/**
* Copies an {@link Automaton} to a {@link MutableAutomaton} with possibly heterogeneous input alphabets and state
* and transition properties. State and transitions will not be filtered.
*
* @param method
* the traversal method to use
* @param in
* the input transition system
* @param limit
* the traversal limit, a value less than 0 means no limit
* @param inputs
* the inputs to consider
* @param out
* the output automaton
* @param inputsMapping
* the transformation for input symbols
* @param spMapping
* the function for obtaining state properties
* @param tpMapping
* the function for obtaining transition properties
*
* @return a mapping from old to new states
*/
public static Mapping rawCopy(TSTraversalMethod method,
TransitionSystem in,
int limit,
Collection extends I1> inputs,
MutableAutomaton out,
Function super I1, ? extends I2> inputsMapping,
Function super S1, ? extends SP2> spMapping,
Function super T1, ? extends TP2> tpMapping) {
return rawCopy(method,
in,
limit,
inputs,
out,
inputsMapping,
spMapping,
tpMapping,
x -> true,
TransitionPredicates.alwaysTrue());
}
/**
* Copies an {@link TransitionSystem} to a {@link MutableAutomaton} with possibly heterogeneous input alphabets and
* state and transition properties.
*
* @param method
* the traversal method to use
* @param in
* the input transition system
* @param limit
* the traversal limit, a value less than 0 means no limit
* @param inputs
* the inputs to consider
* @param out
* the output automaton
* @param inputsMapping
* the transformation for input symbols
* @param spMapping
* the function for obtaining state properties
* @param tpMapping
* the function for obtaining transition properties
* @param stateFilter
* the filter predicate for states
* @param transFilter
* the filter predicate for transitions
*
* @return a mapping from old to new states
*/
public static Mapping rawCopy(TSTraversalMethod method,
TransitionSystem in,
int limit,
Collection extends I1> inputs,
MutableAutomaton out,
Function super I1, ? extends I2> inputsMapping,
Function super S1, ? extends SP2> spMapping,
Function super T1, ? extends TP2> tpMapping,
Predicate super S1> stateFilter,
TransitionPredicate super S1, ? super I1, ? super T1> transFilter) {
final Function super S1, ? extends SP2> safeSpMapping = FunctionsUtil.safeDefault(spMapping);
final Function super T1, ? extends TP2> safeTpMapping = FunctionsUtil.safeDefault(tpMapping);
final Predicate super S1> safeStateFilter = FunctionsUtil.safeToTrue(stateFilter);
final TransitionPredicate super S1, ? super I1, ? super T1> safeTransFilter =
TransitionPredicates.safePred(transFilter, true);
TSCopyVisitor vis = new TSCopyVisitor<>(in,
out,
inputsMapping,
safeSpMapping,
safeTpMapping,
safeStateFilter,
safeTransFilter);
method.traverse(in, limit, inputs, vis);
return vis.getStateMapping();
}
/**
* Copies an {@link Automaton} to a {@link MutableAutomaton} with a compatible input alphabet, but possibly
* heterogeneous state and transition properties. States and transitions will not be filtered.
*
* @param method
* the traversal method to use
* @param in
* the input transition system
* @param limit
* the traversal limit, a value less than 0 means no limit
* @param inputs
* the inputs to consider
* @param out
* the output automaton
* @param spMapping
* the function for obtaining state properties
* @param tpMapping
* the function for obtaining transition properties
*
* @return a mapping from old to new states
*/
public static Mapping rawCopy(TSTraversalMethod method,
TransitionSystem in,
int limit,
Collection extends I> inputs,
MutableAutomaton out,
Function super S1, ? extends SP2> spMapping,
Function super T1, ? extends TP2> tpMapping) {
return rawCopy(method,
in,
limit,
inputs,
out,
spMapping,
tpMapping,
x -> true,
TransitionPredicates.alwaysTrue());
}
/**
* Copies an {@link Automaton} to a {@link MutableAutomaton} with a compatible input alphabet, but possibly
* heterogeneous state and transition properties.
*
* @param method
* the traversal method to use
* @param in
* the input transition system
* @param limit
* the traversal limit, a value less than 0 means no limit
* @param inputs
* the inputs to consider
* @param out
* the output automaton
* @param spMapping
* the function for obtaining state properties
* @param tpMapping
* the function for obtaining transition properties
* @param stateFilter
* the filter predicate for states
* @param transFilter
* the filter predicate for transitions
*
* @return a mapping from old to new states
*/
public static Mapping rawCopy(TSTraversalMethod method,
TransitionSystem in,
int limit,
Collection extends I> inputs,
MutableAutomaton out,
Function super S1, ? extends SP2> spMapping,
Function super T1, ? extends TP2> tpMapping,
Predicate super S1> stateFilter,
TransitionPredicate super S1, ? super I, ? super T1> transFilter) {
return rawCopy(method,
in,
limit,
inputs,
out,
Function.identity(),
spMapping,
tpMapping,
stateFilter,
transFilter);
}
/**
* Copies a {@link UniversalAutomaton} to a {@link MutableAutomaton} with possibly heterogeneous input alphabets and
* state and transition properties. States and transitions will not be filtered
*
* @param method
* the traversal method to use
* @param in
* the input transition system
* @param limit
* the traversal limit, a value less than 0 means no limit
* @param inputs
* the inputs to consider
* @param out
* the output automaton
* @param inputsMapping
* the transformation for input symbols
* @param spTransform
* the transformation for state properties
* @param tpTransform
* the transformation for transition properties
*
* @return a mapping from old to new states
*/
public static Mapping copy(TSTraversalMethod method,
UniversalTransitionSystem in,
int limit,
Collection extends I1> inputs,
MutableAutomaton out,
Function super I1, ? extends I2> inputsMapping,
Function super SP1, ? extends SP2> spTransform,
Function super TP1, ? extends TP2> tpTransform) {
return copy(method,
in,
limit,
inputs,
out,
inputsMapping,
spTransform,
tpTransform,
x -> true,
TransitionPredicates.alwaysTrue());
}
/**
* Copies a {@link UniversalAutomaton} to a {@link MutableAutomaton} with possibly heterogeneous input alphabets and
* state and transition properties.
*
* @param method
* the traversal method to use
* @param in
* the input transition system
* @param limit
* the traversal limit, a value less than 0 means no limit
* @param inputs
* the inputs to consider
* @param out
* the output automaton
* @param inputsMapping
* the transformation for input symbols
* @param spTransform
* the transformation for state properties
* @param tpTransform
* the transformation for transition properties
* @param stateFilter
* the filter predicate for states
* @param transFilter
* the filter predicate for transitions
*
* @return a mapping from old to new states
*/
public static Mapping copy(TSTraversalMethod method,
UniversalTransitionSystem in,
int limit,
Collection extends I1> inputs,
MutableAutomaton out,
Function super I1, ? extends I2> inputsMapping,
Function super SP1, ? extends SP2> spTransform,
Function super TP1, ? extends TP2> tpTransform,
Predicate super S1> stateFilter,
TransitionPredicate super S1, ? super I1, ? super T1> transFilter) {
Function super S1, ? extends SP2> spMapping =
(spTransform == null) ? null : TS.stateProperties(in).andThen(spTransform);
Function super T1, ? extends TP2> tpMapping =
(tpTransform == null) ? null : TS.transitionProperties(in).andThen(tpTransform);
return rawCopy(method, in, limit, inputs, out, inputsMapping, spMapping, tpMapping, stateFilter, transFilter);
}
/**
* Copies a {@link UniversalAutomaton} to a {@link MutableAutomaton} with compatible input alphabets, but possibly
* heterogeneous properties. States and transitions will not be filtered.
*
* @param method
* the traversal method to use
* @param in
* the input transition system
* @param limit
* the traversal limit, a value less than 0 means no limit
* @param inputs
* the inputs to consider
* @param out
* the output automaton
* @param spTransform
* the transformation for state properties
* @param tpTransform
* the transformation for transition properties
*
* @return a mapping from old to new states
*/
public static Mapping copy(TSTraversalMethod method,
UniversalTransitionSystem in,
int limit,
Collection extends I> inputs,
MutableAutomaton out,
Function super SP1, ? extends SP2> spTransform,
Function super TP1, ? extends TP2> tpTransform) {
return copy(method,
in,
limit,
inputs,
out,
spTransform,
tpTransform,
x -> true,
TransitionPredicates.alwaysTrue());
}
/**
* Copies a {@link UniversalAutomaton} to a {@link MutableAutomaton} with compatible input alphabets, but possibly
* heterogeneous properties.
*
* @param method
* the traversal method to use
* @param in
* the input transition system
* @param limit
* the traversal limit, a value less than 0 means no limit
* @param inputs
* the inputs to consider
* @param out
* the output automaton
* @param spTransform
* the transformation for state properties
* @param tpTransform
* the transformation for transition properties
* @param stateFilter
* the filter predicate for states
* @param transFilter
* the filter predicate for transitions
*
* @return a mapping from old to new states
*/
public static Mapping copy(TSTraversalMethod method,
UniversalTransitionSystem in,
int limit,
Collection extends I> inputs,
MutableAutomaton out,
Function super SP1, ? extends SP2> spTransform,
Function super TP1, ? extends TP2> tpTransform,
Predicate super S1> stateFilter,
TransitionPredicate super S1, ? super I, ? super T1> transFilter) {
return copy(method,
in,
limit,
inputs,
out,
Function.identity(),
spTransform,
tpTransform,
stateFilter,
transFilter);
}
/**
* Copies a {@link UniversalAutomaton} with possibly heterogeneous input alphabets, but compatible properties.
* States and transitions will not be filtered
*
* @param method
* the traversal method to use
* @param in
* the input transition system
* @param limit
* the traversal limit, a value less than 0 means no limit
* @param inputs
* the inputs to consider
* @param out
* the output automaton
* @param inputsMapping
* a mapping from inputs in the input automaton to inputs in the output automaton
*
* @return a mapping from old to new states
*/
public static Mapping copy(TSTraversalMethod method,
UniversalTransitionSystem in,
int limit,
Collection extends I1> inputs,
MutableAutomaton out,
Function super I1, ? extends I2> inputsMapping) {
return copy(method, in, limit, inputs, out, inputsMapping, x -> true, TransitionPredicates.alwaysTrue());
}
/**
* Copies a {@link UniversalAutomaton} with possibly heterogeneous input alphabets, but compatible properties.
*
* @param method
* the traversal method to use
* @param in
* the input transition system
* @param limit
* the traversal limit, a value less than 0 means no limit
* @param inputs
* the inputs to consider
* @param out
* the output automaton
* @param inputsMapping
* the transformation for input symbols
* @param stateFilter
* the filter predicate for states
* @param transFilter
* the filter predicate for transitions
*
* @return a mapping from old to new states
*/
public static Mapping copy(TSTraversalMethod method,
UniversalTransitionSystem in,
int limit,
Collection extends I1> inputs,
MutableAutomaton out,
Function super I1, ? extends I2> inputsMapping,
Predicate super S1> stateFilter,
TransitionPredicate super S1, ? super I1, ? super T1> transFilter) {
return copy(method,
in,
limit,
inputs,
out,
inputsMapping,
Function.identity(),
Function.identity(),
stateFilter,
transFilter);
}
/**
* Copies a {@link UniversalAutomaton} with compatible input alphabets and properties. States and transitions will
* not be filtered.
*
* @param method
* the traversal method to use
* @param in
* the input transition system
* @param limit
* the traversal limit, a value less than 0 means no limit
* @param inputs
* the inputs to consider
* @param out
* the output automaton
*
* @return a mapping from old to new states.
*/
public static Mapping copy(TSTraversalMethod method,
UniversalTransitionSystem in,
int limit,
Collection extends I> inputs,
MutableAutomaton out) {
return copy(method, in, limit, inputs, out, x -> true, TransitionPredicates.alwaysTrue());
}
/**
* Copies a {@link UniversalAutomaton} with compatible input alphabets and properties.
*
* @param method
* the traversal method to use
* @param in
* the input transition system
* @param limit
* the traversal limit, a value less than 0 means no limit
* @param inputs
* the inputs to consider
* @param out
* the output automaton
* @param stateFilter
* the filter predicate for states
* @param transFilter
* the filter predicate for transitions
*
* @return a mapping from old to new states
*/
public static Mapping copy(TSTraversalMethod method,
UniversalTransitionSystem in,
int limit,
Collection extends I> inputs,
MutableAutomaton out,
Predicate super S1> stateFilter,
TransitionPredicate super S1, ? super I, ? super T1> transFilter) {
return copy(method, in, limit, inputs, out, Function.identity(), stateFilter, transFilter);
}
}