Package net.automatalib.ts.modal

Interface ModalTransitionSystem<S,I,T,TP extends ModalEdgeProperty>

Type Parameters:

S - state type

I - input symbol type

T - transition type

TP - (specific) transition property type

All Superinterfaces:

Automaton<S,I,T>, FiniteAlphabetAutomaton<S,I,T>, FiniteRepresentation, GraphViewable, InputAlphabetHolder<I>, Iterable<S>, SimpleAutomaton<S,I>, SimpleTS<S,I>, TransitionSystem<S,I,T>, UniversalAutomaton<S,I,T,Void,TP>, UniversalFiniteAlphabetAutomaton<S,I,T,Void,TP>, UniversalTransitionSystem<S,I,T,Void,TP>

All Known Subinterfaces:

MutableModalTransitionSystem<S,I,T,TP>

All Known Implementing Classes:

AbstractCompactMTS, CompactMTS

public interface ModalTransitionSystem<S,I,T,TP extends ModalEdgeProperty>
extends UniversalFiniteAlphabetAutomaton<S,I,T,Void,TP>

A modal transition system is a UniversalAutomaton in which transitions can be marked as may or must edges. Since most MTS-based algorithms require a finite transition domain, this includes a finite set input symbols. This is achieved by sub-typing the UniversalFiniteAlphabetAutomaton interface, which additionally inherits several convenience methods for working with MTSs.

Nested Class Summary

Nested Classes

Modifier and Type	Interface	Description
static class	ModalTransitionSystem.MTSGraphView<S,I,T,TP extends ModalEdgeProperty,M extends ModalTransitionSystem<S,I,T,TP>>

Method Summary

Modifier and Type	Method	Description
default Iterator<S>	iterator()
default int	size()	Retrieves the size (number of states) of this transition system.
default UniversalGraph<S,TransitionEdge<I,T>,Void,TransitionEdge.Property<I,TP>>	transitionGraphView(Collection<? extends I> inputs)	Obtains a graph view of the transition graph of this automaton, taking into account the specified input symbols.

Methods inherited from interface net.automatalib.automaton.FiniteAlphabetAutomaton

getTransitions, graphView

Methods inherited from interface net.automatalib.automaton.concept.InputAlphabetHolder

getInputAlphabet

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Methods inherited from interface net.automatalib.automaton.simple.SimpleAutomaton

createDynamicStateMapping, createStaticStateMapping, getStates, stateIDs

Methods inherited from interface net.automatalib.ts.simple.SimpleTS

getInitialStates, getStates, getSuccessors, getSuccessors

Methods inherited from interface net.automatalib.ts.TransitionSystem

getSuccessor, getSuccessors, getTransitions, powersetView

Methods inherited from interface net.automatalib.automaton.UniversalFiniteAlphabetAutomaton

transitionGraphView

Methods inherited from interface net.automatalib.ts.UniversalTransitionSystem

getStateProperty, getTransitionProperty

Method Detail

iterator

default Iterator<S> iterator()

Specified by:

iterator in interface Iterable<S>

Specified by:

iterator in interface SimpleAutomaton<S,I>

size

default int size()

Description copied from interface: SimpleAutomaton

Retrieves the size (number of states) of this transition system.

Specified by:

size in interface FiniteRepresentation

Specified by:

size in interface SimpleAutomaton<S,I>

Returns:

the number of states of this transition system

transitionGraphView

default UniversalGraph<S,TransitionEdge<I,T>,Void,TransitionEdge.Property<I,TP>> transitionGraphView(Collection<? extends I> inputs)

Description copied from interface: Automaton

Obtains a graph view of the transition graph of this automaton, taking into account the specified input symbols. The transitions are represented as TransitionEdges in the graph.

Specified by:

transitionGraphView in interface Automaton<S,I,T>

Specified by:

transitionGraphView in interface UniversalAutomaton<S,I,T,Void,TP extends ModalEdgeProperty>

Parameters:

inputs - the input symbols to consider

Returns:

a graph view of the transition graph of this automaton for the given input symbols