Initialize Transitions.

Parameters:

• graph (LabeledDiGraph)

Overrides: object.__init__

Return list of transitions.

Wraps LabeledDiGraph.edges.

str(x)

Overrides: object.__str__

(inherited documentation)

Wrapper of LabeledDiGraph.add_edge,

which wraps networkx.MultiDiGraph.add_edge.

Wrapper of LabeledDiGraph.add_edges_from,

which wraps networkx.MultiDiGraph.add_edges_from.

Add an edge for each combination (u, v),

for u in from_states for v in to_states.

Remove single transition.

If only the states are passed, then all transitions between them are removed.

If attr_dict, attr are also passed, then only transitions annotated with those labels are removed.

Wraps LabeledDiGraph.remove_labeled_edge.

Remove list of transitions.

Each transition is either a:

• 2-tuple: (u, v), or a
• 3-tuple: (u, v, data)

Add multiple labeled transitions from adjacency matrix.

The label can be empty. For more details see add.

Parameters:

• adj (scipy.sparse.lil (list of lists)) - new transitions represented by adjacency matrix.
• adj2states (either of:
  • dict from adjacency matrix indices to existing, or
  • list of existing states
  ) - map from adjacency matrix indices to states. If value not a state, raise Exception. Use States.add, States.add_from to add states first.

  For example the 1st state in adj2states corresponds to the first node in adj.

  States must have been added using:

  • sys.states.add, or
  • sys.states.add_from

  If adj2states includes a state not in sys.states, no transition is added and an exception raised.

Find all edges between given states with given labels.

Instead of having two separate methods to:

• find all labels of edges between given states (s1, s2)
• find all transitions (s1, s2, L) with given label L, possibly from some given state s1, i.e., the edges leading to the successor states Post(s1, a) = Post(s1) restricted by action a

this method provides both functionalities.

Preimage under edge labeling function L of given label, intersected with given subset of edges:

   L^{-1}(desired_label) \cap (from_states x to_states)

See Also

add, add_adj

Parameters:

• from_states (
  • iterable of existing states, or
  • None (no constraint, default)
  ) - edges must start from this subset of states
• to_states (
  • iterable of existing states, or
  • None (no constraint, default)
  ) - edges must end in this subset of states
• with_attr_dict (
  • {label_type : desired_label_value, ...}, or
  • None (no constraint, default)
  ) - edges must be annotated with these labels
• with_attr - label type-value pairs, take precedence over desired_label.

Returns: list of transitions:

       = list of labeled edges
       = [(from_state, to_state, label),...]

where:

• from_state in from_states
• to_state in to_states
• label: dict

set of transitions = labeled edges:

       (from_state, to_state, label)

such that:

       (from_state, to_state )
       in from_states x to_states