spot  1.0.2
Functions
TA simplifications
TA algorithms

Functions

ta * spot::minimize_ta (const ta *ta_)
 Construct a simplified TA by merging bisimilar states.
tgta_explicit * spot::minimize_tgta (const tgta_explicit *tgta_)
 Construct a simplified TGTA by merging bisimilar states.

Detailed Description

Function Documentation

ta* spot::minimize_ta ( const ta *  ta_)

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

For more detail about this type of algorithm, see the following paper:
@verbatim 

/// {valmari.09.icatpn, /// author = {Antti Valmari}, /// title = {Bisimilarity Minimization in in O(m logn) Time}, /// booktitle = {Proceedings of the 30th International Conference on /// the Applications and Theory of Petri Nets /// (ICATPN'09)}, /// series = {Lecture Notes in Computer Science}, /// publisher = {Springer}, /// isbn = {978-3-642-02423-8}, /// pages = {123–142}, /// volume = 5606, /// url = {http://dx.doi.org/10.1007/978-3-642-02424-5_9}, /// year = {2009} /// } ///

\param ta_ the TA automaton to convert into a simplified TA  
tgta_explicit* spot::minimize_tgta ( const tgta_explicit *  tgta_)

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 comment this page and report errors about it on the RefDocComments page.
Generated on Wed Mar 6 2013 09:25:15 for spot by doxygen 1.8.1.2