Package net.automatalib.util.automaton.procedural

Class SPMMs

java.lang.Object

net.automatalib.util.automaton.procedural.SPMMs

public final class SPMMs
extends Object

Operations on SPMMs.

Method Summary

Modifier and Type	Method	Description
static <I,O> Map<I,Word<I>>	computeAccessSequences(SPMM<?,I,?,O> spmm, ProceduralInputAlphabet<I> alphabet, Map<I,Word<I>> terminatingSequences)	Computes for a given SPMM a set of access sequences using the SPMM alphabet.
static <I,O> ATSequences<I>	computeATSequences(SPMM<?,I,?,O> spmm)	Computes a set of access sequences and terminating sequences for a given SPMM.
static <I,O> ATSequences<I>	computeATSequences(SPMM<?,I,?,O> spmm, ProceduralInputAlphabet<I> alphabet)	Computes a set of access sequences and return sequences for a given SPMM limited to the symbols of the given ProceduralInputAlphabet.
static <I,O> Map<I,Word<I>>	computeTerminatingSequences(SPMM<?,I,?,O> spmm, ProceduralInputAlphabet<I> alphabet)	Computes for a given SPMM the set of terminating sequences using the given alphabet.
static <I,O> @Nullable Word<I>	findSeparatingWord(SPMM<?,I,?,O> spmm1, SPMM<?,I,?,O> spmm2, ProceduralInputAlphabet<I> alphabet)	Computes a separating word for the two given SPMMs, if existent.
static <I,O> boolean	isValid(SPMM<?,I,?,O> spmm)	Checks whether the given SPMM is valid, This is a convenience method for isValid(SPMM, ProceduralInputAlphabet) that uses the input alphabet of the given SPMM.
static <I,O> boolean	isValid(SPMM<?,I,?,O> spmm, ProceduralInputAlphabet<I> alphabet)	Checks whether the given SPMM is valid with respect to the given ProceduralInputAlphabet, i.e., whether its procedures are error-closed, return-closed, and call-closed.
static <I,O> boolean	testEquivalence(SPMM<?,I,?,O> spmm1, SPMM<?,I,?,O> spmm2, ProceduralInputAlphabet<I> alphabet)	Checks if the two given SPMMs are equivalent, i.e. whether there exists a separating word for them.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

computeATSequences

public static <I,O> ATSequences<I> computeATSequences(SPMM<?,I,?,O> spmm)

Computes a set of access sequences and terminating sequences for a given SPMM. This is a convenience method for computeATSequences(SPMM, ProceduralInputAlphabet) that automatically uses the input alphabet of the given spmm.

Type Parameters:

I - input symbol type

Parameters:

spmm - the SPMM for which the sequences should be computed

Returns:

an ATSequences object which contains the respective sequences.

See Also:

computeATSequences(SPMM, ProceduralInputAlphabet)

computeATSequences

public static <I,O> ATSequences<I> computeATSequences(SPMM<?,I,?,O> spmm,
                                                            ProceduralInputAlphabet<I> alphabet)

Computes a set of access sequences and return sequences for a given SPMM limited to the symbols of the given ProceduralInputAlphabet.

Type Parameters:

I - input symbol type

O - output symbol type

Parameters:

spmm - the SPMM for which the sequences should be computed

alphabet - the ProceduralInputAlphabet whose symbols should be used for computing the respective sequences

Returns:

an ATSequences object which contains the respective sequences.

See Also:

computeAccessSequences(SPMM, ProceduralInputAlphabet, Map), computeTerminatingSequences(SPMM, ProceduralInputAlphabet)

computeTerminatingSequences

public static <I,O> Map<I,Word<I>> computeTerminatingSequences(SPMM<?,I,?,O> spmm,
                                                                           ProceduralInputAlphabet<I> alphabet)

Computes for a given SPMM the set of terminating sequences using the given alphabet. Terminating sequences transfer a procedure from its initial state to a returnable state. This method furthermore checks that the hierarchy of calls is well-defined, i.e. it only includes procedural invocations p for determining a terminating sequence if p has a valid terminating sequence itself.

Type Parameters:

I - input symbol type

O - output symbol type

Parameters:

spmm - the SPMM to analyze

alphabet - the ProceduralInputAlphabet whose symbols should be used for computing the terminating sequences

Returns:

A map from procedures (restricted to the call symbols of the given alphabet) to the terminating sequences. This map may be partial as some procedures may not have a well-defined terminating sequence for the given alphabet.

computeAccessSequences

public static <I,O> Map<I,Word<I>> computeAccessSequences(SPMM<?,I,?,O> spmm,
                                                                      ProceduralInputAlphabet<I> alphabet,
                                                                      Map<I,Word<I>> terminatingSequences)

Computes for a given SPMM a set of access sequences using the SPMM alphabet. An access sequence (for procedure p) transfers an SPMM from its initial state to a state that is able to successfully execute a run of p. This method furthermore checks that potentially nested calls are well-defined, i.e. it only includes procedural invocations p for determining access sequences if p has a valid terminating sequence and therefore can be expanded correctly.

Type Parameters:

I - input symbol type

O - output symbol type

Parameters:

spmm - the SPMM to analyze

alphabet - the ProceduralInputAlphabet whose symbols should be used for computing the access sequences

terminatingSequences - a Map of call symbols to terminating sequences used to expand nested invocations in access sequences

Returns:

A map from procedures (restricted to the call symbols of the given alphabet) to the access sequences. This map may be partial as some procedures may not have well-defined access sequences for the given alphabet.

isValid

public static <I,O> boolean isValid(SPMM<?,I,?,O> spmm)

Checks whether the given SPMM is valid, This is a convenience method for isValid(SPMM, ProceduralInputAlphabet) that uses the input alphabet of the given SPMM.

Type Parameters:

I - input symbol type

O - output symbol type

Parameters:

spmm - the SPMM to analyze

Returns:

true if spmm is valid, false otherwise.

See Also:

isValid(SPMM, ProceduralInputAlphabet)

isValid

public static <I,O> boolean isValid(SPMM<?,I,?,O> spmm,
                                          ProceduralInputAlphabet<I> alphabet)

Checks whether the given SPMM is valid with respect to the given ProceduralInputAlphabet, i.e., whether its procedures are error-closed, return-closed, and call-closed.

A procedure is considered error-closed iff any transition that emits an error output transitions the procedure into a sink state that continues to output the error output.

A procedure is considered return-closed iff the return symbol transitions the procedure into a sink state that continues to output the error output.

A procedure is considered call-closed iff any transition labeled with a non-terminating call symbol transitions the procedure into a sink state that continues to output the error output.

Type Parameters:

I - input symbol type

O - output symbol type

Parameters:

spmm - the SPMM to analyze

alphabet - the ProceduralInputAlphabet whose symbols should be used for checking validity

Returns:

true if spmm is valid, false otherwise.

testEquivalence

public static <I,O> boolean testEquivalence(SPMM<?,I,?,O> spmm1,
                                                  SPMM<?,I,?,O> spmm2,
                                                  ProceduralInputAlphabet<I> alphabet)

Checks if the two given SPMMs are equivalent, i.e. whether there exists a separating word for them.

Type Parameters:

I - input symbol type

O - output symbol type

Parameters:

spmm1 - the first SPMM

spmm2 - the second SPMM

alphabet - the ProceduralInputAlphabet whose symbols should be used for checking equivalence

Returns:

true if the two SPMMs are equivalent, false otherwise.

See Also:

findSeparatingWord(SPMM, SPMM, ProceduralInputAlphabet)

findSeparatingWord

public static <I,O> @Nullable Word<I> findSeparatingWord(SPMM<?,I,?,O> spmm1,
                                                               SPMM<?,I,?,O> spmm2,
                                                               ProceduralInputAlphabet<I> alphabet)

Computes a separating word for the two given SPMMs, if existent. A separating word is a Word such that one SPMM behaves different from the other.

Type Parameters:

I - input symbol type

O - output symbol type

Parameters:

spmm1 - the first SPMM

spmm2 - the second SPMM

alphabet - the ProceduralInputAlphabet whose symbols should be used for computing the separating word

Returns:

a separating word, if existent, null otherwise.