Package tulip :: Package transys :: Module automata :: Class BuchiAutomaton
[frames] | no frames]

Class BuchiAutomaton


Nested Classes

Inherited from networkx.classes.multigraph.MultiGraph: edge_key_dict_factory

Inherited from networkx.classes.graph.Graph: adjlist_dict_factory, edge_attr_dict_factory, node_dict_factory

Instance Methods
 
__init__(self, deterministic=False, atomic_proposition_based=True, symbolic=False)
Initialize FiniteStateAutomaton.

Inherited from FiniteStateAutomaton: __str__, remove_node

Inherited from labeled_graphs.LabeledDiGraph: add_edge, add_edges_from, add_node, add_nodes_from, dot_str, has_deadends, is_consistent, plot, remove_deadends, remove_labeled_edge, remove_labeled_edges_from, save

Inherited from networkx.classes.multidigraph.MultiDiGraph: degree_iter, edges_iter, in_degree_iter, in_edges, in_edges_iter, is_directed, is_multigraph, out_degree_iter, out_edges, out_edges_iter, remove_edge, reverse, subgraph, to_directed, to_undirected

Inherited from networkx.classes.multigraph.MultiGraph: edges, get_edge_data, has_edge, number_of_edges, remove_edges_from, selfloop_edges

Inherited from networkx.classes.digraph.DiGraph: clear, has_predecessor, has_successor, in_degree, neighbors, neighbors_iter, out_degree, predecessors, predecessors_iter, remove_nodes_from, successors, successors_iter

Inherited from networkx.classes.graph.Graph: __contains__, __getitem__, __iter__, __len__, add_cycle, add_path, add_star, add_weighted_edges_from, adjacency_iter, adjacency_list, copy, degree, has_node, nbunch_iter, nodes, nodes_iter, nodes_with_selfloops, number_of_nodes, number_of_selfloops, order, size

Inherited from object: __delattr__, __format__, __getattribute__, __hash__, __new__, __reduce__, __reduce_ex__, __repr__, __setattr__, __sizeof__, __subclasshook__

Properties

Inherited from FiniteStateAutomaton: accepting

Inherited from networkx.classes.graph.Graph: name

Inherited from object: __class__

Method Details

__init__(self, deterministic=False, atomic_proposition_based=True, symbolic=False)
(Constructor)

 

Initialize FiniteStateAutomaton.

Additional keyword arguments are passed to LabeledDiGraph.__init__.

Parameters:
  • atomic_proposition_based - If False, then the alphabet is represented by a set. If True, then the alphabet is represented by a powerset 2^AP.
Overrides: object.__init__
(inherited documentation)