spot  2.11.6
Functions

Functions

ta_explicit_ptr spot::minimize_ta (const const_ta_ptr &ta_)
 Construct a simplified TA by merging bisimilar states. More...
 
tgta_explicit_ptr spot::minimize_tgta (const const_tgta_explicit_ptr &tgta_)
 Construct a simplified TGTA by merging bisimilar states. More...
 

Detailed Description

Function Documentation

◆ minimize_ta()

ta_explicit_ptr spot::minimize_ta ( const const_ta_ptr &  ta_)

#include <spot/taalgos/minimize.hh>

Construct a simplified TA by merging bisimilar states.

A TA automaton can be simplified by merging bisimilar states: Two states are bisimilar if the automaton can accept the same executions starting for either of these states. This can be achieved using any algorithm based on partition refinement

Parameters
ta_the TA automaton to convert into a simplified TA

◆ minimize_tgta()

tgta_explicit_ptr spot::minimize_tgta ( const const_tgta_explicit_ptr &  tgta_)

#include <spot/taalgos/minimize.hh>

Construct a simplified TGTA by merging bisimilar states.

A TGTA automaton can be simplified by merging bisimilar states: Two states are bisimilar if the automaton can accept the same executions starting for either of these states. This can be achieved using same algorithm used to simplify a TA taking into account the acceptance conditions of the outgoing transitions.

Parameters
tgta_the TGTA automaton to convert into a simplified TGTA

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Fri Feb 27 2015 10:00:07 for spot by doxygen 1.9.1