static <I> Map<I,Word<I>> |
SBAs.computeAccessSequences(SBA<?,I> sba,
ProceduralInputAlphabet<I> alphabet,
Map<I,Word<I>> terminatingSequences) |
Computes for a given SBA a set of access sequences using the given
alphabet .
|
static <I> ATSequences<I> |
SBAs.computeATSequences(SBA<?,I> sba) |
Computes a set of access sequences and terminating sequences for a given SBA .
|
static <I> ATSequences<I> |
SBAs.computeATSequences(SBA<?,I> sba,
ProceduralInputAlphabet<I> alphabet) |
Computes a set of access sequences and terminating sequences for a given SBA limited to the symbols of
the given ProceduralInputAlphabet .
|
static <I> Map<I,Word<I>> |
SBAs.computeTerminatingSequences(SBA<?,I> sba,
ProceduralInputAlphabet<I> alphabet) |
Computes for a given SBA a set of terminating sequences using the given
alphabet .
|
static <I> @Nullable Word<I> |
SBAs.findSeparatingWord(SBA<?,I> sba1,
SBA<?,I> sba2,
ProceduralInputAlphabet<I> alphabet) |
Computes a separating word for the two given SBA s, if existent.
|
static <I> boolean |
SBAs.isValid(SBA<?,I> sba) |
|
static <I> boolean |
SBAs.isValid(SBA<?,I> sba,
ProceduralInputAlphabet<I> alphabet) |
Checks whether the given SBA is valid with respect to the given ProceduralInputAlphabet , i.e.,
whether its procedures are prefix-closed, return-closed, and call-closed.
|
static <I> SPA<?,I> |
SBAs.reduce(SBA<?,I> sba) |
Reduces a given SBA to its well-matched language.
|
static <I> SPA<?,I> |
SBAs.reduce(SBA<?,I> sba,
ProceduralInputAlphabet<I> alphabet) |
|
static <I> boolean |
SBAs.testEquivalence(SBA<?,I> sba1,
SBA<?,I> sba2,
ProceduralInputAlphabet<I> alphabet) |
Checks if the two given SBA s are equivalent, i.e. whether there exists a
separating word for them.
|
static <I> ContextFreeModalProcessSystem<I,Void> |
SBAs.toCFMPS(SBA<?,I> sba) |
Returns a ContextFreeModalProcessSystem -based view on the language of a given SBA such that there
exists a w -labeled path in the returned CFMPS if and only if w is accepted by the given
SBA .
|