Package  Description 

de.uni_due.inf.ti.raven.actions 
General Action Classes.

de.uni_due.inf.ti.raven.algorithms 
Classes to run different algorithms.

de.uni_due.inf.ti.raven.data.automata 
Classes to create, represent, manipulate automata.

de.uni_due.inf.ti.raven.encodings 
Classes to encode the state space and the transitions of the various graph automata.

de.uni_due.inf.ti.raven.gui 
GUI Classes.

de.uni_due.inf.ti.raven.gui.automaton 
Classes which provide (visual) forms either used to collect information required to create the
several graph automata or used to present information about existing graph automata.

de.uni_due.inf.ti.raven.gui.graphs 
GUI Classes to visualize graphs.

de.uni_due.inf.ti.raven.io 
Classes to load, save and print data.

Class and Description 

Automaton
This abstract class is the base class for all symbolic graph automata.

ColorabilityAutomaton
This class implements a graph automaton accepting the language of all graphs which are
kcolorable.

DominatingSetAutomaton
This class implements a graph automaton accepting the language of all graphs which have a
dominating set of size at most k, i.e. a set D of nodes with size at most k
such that each node of the graph is either in D or adjacent to a node in D.

EdgeCountingAutomaton
This class implements a graph automaton accepting the language of all graphs whose number of
edges of a specific kind is equal to remainder modulo divisor.

LinkAutomaton
This class implements a graph automaton accepting all graphs that have an
edge between a node from the inner to a node from the outer interface.

MaximumEdgeAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of edges is at most maximum.

MaximumVertexAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of nodes is at most maximum.

MinimumEdgeAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of edges is at least minimum.

MinimumVertexAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of nodes is at least minimum.

NoIsolatedNodesAutomaton
This class implements a graph automaton accepting the language of all graphs which do not
contain any isolated node.

PathAutomaton
This class implements a graph automaton accepting the language of all graphs
where certain nodes are connected by a path.

ProductAutomaton
This class implements a graph automaton accepting the language which is obtained by the
intersection of the languages of the two underlying graph automata.

SubgraphAutomaton
This class implements a graph automaton accepting the language of all graphs which contain a
specific graph as subgraph.

UnionAutomaton
This class implements a graph automaton accepting the language which is obtained by the
union of the languages of the two underlying graph automata.

VertexCountingAutomaton
This class implements a graph automaton accepting the language of all graphs whose number of
nodes is equal to remainder modulo divisor.

VertexCoverAutomaton
This class implements a graph automaton accepting the language of all graphs which have a
vertex cover of size at most k, i.e. a set C of nodes with size at most k
such that each edge of the graph is incident to at least one node of C.

Class and Description 

Automaton
This abstract class is the base class for all symbolic graph automata.

Class and Description 

Automaton
This abstract class is the base class for all symbolic graph automata.

Automaton.Type
Enumeration of the different types of implemented automata.

AutomatonFactory
Factory class for vending
Automaton objects. 
ColorabilityAutomaton
This class implements a graph automaton accepting the language of all graphs which are
kcolorable.

DominatingSetAutomaton
This class implements a graph automaton accepting the language of all graphs which have a
dominating set of size at most k, i.e. a set D of nodes with size at most k
such that each node of the graph is either in D or adjacent to a node in D.

EdgeCountingAutomaton
This class implements a graph automaton accepting the language of all graphs whose number of
edges of a specific kind is equal to remainder modulo divisor.

LinkAutomaton
This class implements a graph automaton accepting all graphs that have an
edge between a node from the inner to a node from the outer interface.

MaximumEdgeAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of edges is at most maximum.

MaximumVertexAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of nodes is at most maximum.

MinimumEdgeAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of edges is at least minimum.

MinimumVertexAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of nodes is at least minimum.

NoIsolatedNodesAutomaton
This class implements a graph automaton accepting the language of all graphs which do not
contain any isolated node.

PathAutomaton
This class implements a graph automaton accepting the language of all graphs
where certain nodes are connected by a path.

ProductAutomaton
This class implements a graph automaton accepting the language which is obtained by the
intersection of the languages of the two underlying graph automata.

SubgraphAutomaton
This class implements a graph automaton accepting the language of all graphs which contain a
specific graph as subgraph.

UnionAutomaton
This class implements a graph automaton accepting the language which is obtained by the
union of the languages of the two underlying graph automata.

VertexCountingAutomaton
This class implements a graph automaton accepting the language of all graphs whose number of
nodes is equal to remainder modulo divisor.

VertexCoverAutomaton
This class implements a graph automaton accepting the language of all graphs which have a
vertex cover of size at most k, i.e. a set C of nodes with size at most k
such that each edge of the graph is incident to at least one node of C.

Class and Description 

Automaton
This abstract class is the base class for all symbolic graph automata.

Class and Description 

Automaton
This abstract class is the base class for all symbolic graph automata.

Class and Description 

Automaton
This abstract class is the base class for all symbolic graph automata.

ColorabilityAutomaton
This class implements a graph automaton accepting the language of all graphs which are
kcolorable.

DominatingSetAutomaton
This class implements a graph automaton accepting the language of all graphs which have a
dominating set of size at most k, i.e. a set D of nodes with size at most k
such that each node of the graph is either in D or adjacent to a node in D.

EdgeCountingAutomaton
This class implements a graph automaton accepting the language of all graphs whose number of
edges of a specific kind is equal to remainder modulo divisor.

LinkAutomaton
This class implements a graph automaton accepting all graphs that have an
edge between a node from the inner to a node from the outer interface.

MaximumEdgeAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of edges is at most maximum.

MaximumVertexAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of nodes is at most maximum.

MinimumEdgeAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of edges is at least minimum.

MinimumVertexAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of nodes is at least minimum.

NoIsolatedNodesAutomaton
This class implements a graph automaton accepting the language of all graphs which do not
contain any isolated node.

PathAutomaton
This class implements a graph automaton accepting the language of all graphs
where certain nodes are connected by a path.

ProductAutomaton
This class implements a graph automaton accepting the language which is obtained by the
intersection of the languages of the two underlying graph automata.

SubgraphAutomaton
This class implements a graph automaton accepting the language of all graphs which contain a
specific graph as subgraph.

UnionAutomaton
This class implements a graph automaton accepting the language which is obtained by the
union of the languages of the two underlying graph automata.

VertexCountingAutomaton
This class implements a graph automaton accepting the language of all graphs whose number of
nodes is equal to remainder modulo divisor.

VertexCoverAutomaton
This class implements a graph automaton accepting the language of all graphs which have a
vertex cover of size at most k, i.e. a set C of nodes with size at most k
such that each edge of the graph is incident to at least one node of C.

Class and Description 

Automaton
This abstract class is the base class for all symbolic graph automata.

Class and Description 

Automaton
This abstract class is the base class for all symbolic graph automata.
