df326e032b
* doc/tl/tl.bib: Move ... * doc/spot.bib: ... here, and augment it with all references that appeared verbatim in Doxygen comments. * doc/Makefile.am, doc/tl/Makefile.am doc/tl/tl.tex: Adjust for the move. * doc/Doxyfile.in: Point to spot.bib. * spot/gen/automata.hh, spot/gen/formulas.hh, spot/misc/game.hh, spot/misc/minato.hh spot/taalgos/emptinessta.hh, spot/taalgos/minimize.hh, spot/taalgos/tgba2ta.hh, spot/tl/formula.hh, spot/tl/remove_x.hh, spot/tl/simplify.hh, spot/tl/snf.hh, spot/twaalgos/cobuchi.hh, spot/twaalgos/cycles.hh, spot/twaalgos/dualize.hh, spot/twaalgos/gtec/gtec.hh, spot/twaalgos/gv04.hh, spot/twaalgos/ltl2taa.hh, spot/twaalgos/ltl2tgba_fm.hh, spot/twaalgos/magic.hh, spot/twaalgos/minimize.hh, spot/twaalgos/parity.hh, spot/twaalgos/powerset.hh, spot/twaalgos/randomgraph.hh, spot/twaalgos/se05.hh, spot/twaalgos/simulation.hh, spot/twaalgos/strength.hh, spot/twaalgos/stutter.hh, spot/twaalgos/tau03.hh, spot/twaalgos/totgba.hh, spot/twaalgos/toweak.hh: Use \cite instead of a verbatim bibtex entry.
58 lines
2 KiB
C++
58 lines
2 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2009, 2010, 2011, 2012, 2013, 2014, 2019 Laboratoire de
|
|
// Recherche et Développement de l'Epita (LRDE).
|
|
//
|
|
// This file is part of Spot, a model checking library.
|
|
//
|
|
// Spot is free software; you can redistribute it and/or modify it
|
|
// under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation; either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// Spot is distributed in the hope that it will be useful, but WITHOUT
|
|
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
// or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
|
|
// License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
#pragma once
|
|
|
|
#include <spot/ta/ta.hh>
|
|
#include <spot/ta/tgta.hh>
|
|
#include <spot/ta/tgtaexplicit.hh>
|
|
|
|
namespace spot
|
|
{
|
|
/// \addtogroup ta_reduction
|
|
/// @{
|
|
|
|
|
|
/// \brief 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
|
|
///
|
|
/// \param ta_ the TA automaton to convert into a simplified TA
|
|
SPOT_API ta_explicit_ptr
|
|
minimize_ta(const const_ta_ptr& ta_);
|
|
|
|
|
|
|
|
/// \brief 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.
|
|
///
|
|
/// \param tgta_ the TGTA automaton to convert into a simplified TGTA
|
|
SPOT_API tgta_explicit_ptr
|
|
minimize_tgta(const const_tgta_explicit_ptr& tgta_);
|
|
|
|
/// @}
|
|
}
|