Home       Trees       Indices       Help   
TuLiP
Package tulip :: Package transys :: Module automata :: Class FiniteStateAutomaton
[frames] | no frames]

Class FiniteStateAutomaton

Generic automaton.

It has:

subclasses implement is_accepted, simulate

Note

Automata represent languages in a way suitable for testing if a given trace is a member of the language. So an automaton operates in acceptor mode, i.e., testing input words.

The represented language is not readily accessible, because its generation requires solving a search problem. This search problem is the usual model checking, assuming a transition system with a complete digraph.

For constructively representing a language, use a FiniteTransitionSystem. A transition system operates only in generator mode, producing a language (possibly non-deterministically).

For controllers, use a FiniteStateMachine, because it maps input words (input port valuations) to outputs (output port valuations).

See Also

NFA, DFA, BA, RabinAutomaton, DRA, StreettAutomaton, MullerAutomaton, ParityAutomaton

Instance Methods
 
__init__(self, deterministic=False, accepting_states_type=None, atomic_proposition_based=True, symbolic=False)
Initialize FiniteStateAutomaton.
 
__str__(self)
Return the graph name.
 
remove_node(self, node)
Remove state (also referred to as "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
  accepting

Inherited from networkx.classes.graph.Graph: name

Inherited from object: __class__

Method Details

__init__(self, deterministic=False, accepting_states_type=None, 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__

__str__(self)
(Informal representation operator)

  
Return the graph name.

Returns
-------
name : string
    The name of the graph.

Examples
--------
>>> G = nx.Graph(name='foo')
>>> str(G)
'foo'
Overrides: object.__str__
(inherited documentation)

remove_node(self, node)

 

Remove state (also referred to as "node").

More than a wrapper since the state is also removed from the accepting set if present.

Overrides: networkx.classes.graph.Graph.remove_node

Property Details

accepting

Get Method:
unreachable.accepting(self)

   Home       Trees       Indices       Help   
TuLiP
Generated by Epydoc 3.0.1 on Tue May 12 18:21:43 2015 http://epydoc.sourceforge.net