de529df59f
Automatic mass renaming. * src/tgbaalgos/: Rename as... * src/twaalgos/: ... this. * README, configure.ac, iface/ltsmin/modelcheck.cc, src/Makefile.am, src/bin/autfilt.cc, src/bin/common_aoutput.cc, src/bin/common_aoutput.hh, src/bin/common_output.hh, src/bin/common_post.hh, src/bin/dstar2tgba.cc, src/bin/ltl2tgba.cc, src/bin/ltl2tgta.cc, src/bin/ltlcross.cc, src/bin/ltldo.cc, src/bin/ltlfilt.cc, src/bin/randaut.cc, src/dstarparse/dra2ba.cc, src/dstarparse/nra2nba.cc, src/dstarparse/nsa2tgba.cc, src/graphtest/twagraph.cc, src/kripke/kripkeprint.cc, src/ltlvisit/contain.cc, src/ltlvisit/contain.hh, src/ltlvisit/exclusive.cc, src/taalgos/emptinessta.hh, src/tgbatest/checkpsl.cc, src/tgbatest/checkta.cc, src/tgbatest/complementation.cc, src/tgbatest/emptchk.cc, src/tgbatest/ltl2tgba.cc, src/tgbatest/ltlprod.cc, src/tgbatest/randtgba.cc, src/tgbatest/taatgba.cc, src/twa/twa.cc, src/twa/twagraph.hh, src/twa/twasafracomplement.cc, wrap/python/spot_impl.i: Adjust.
89 lines
3.6 KiB
C++
89 lines
3.6 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2009, 2010, 2012, 2013, 2014 Laboratoire de Recherche et
|
|
// Developpement 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 "misc/common.hh"
|
|
#include <bddx.h>
|
|
#include "twa/fwd.hh"
|
|
|
|
namespace spot
|
|
{
|
|
class scc_info;
|
|
|
|
|
|
/// \brief Prune unaccepting SCCs and remove superfluous acceptance
|
|
/// conditions.
|
|
///
|
|
/// This function will explore the SCCs of the automaton and remove
|
|
/// dead SCCs (i.e. SCC that are not accepting, and those with no
|
|
/// exit path leading to an accepting SCC).
|
|
///
|
|
/// Additionally, this will try to remove useless acceptance
|
|
/// conditions. This operation may diminish the number of
|
|
/// acceptance condition of the automaton (for instance when two
|
|
/// acceptance conditions are always used together we only keep one)
|
|
/// but it will never remove all acceptance conditions, even if it
|
|
/// would be OK to have zero.
|
|
///
|
|
/// Acceptance conditions on transitions going to non-accepting SCC
|
|
/// are all removed. Acceptance conditions going to an accepting
|
|
/// SCC and coming from another SCC are only removed if \a
|
|
/// remove_all_useless is set. The default value of \a
|
|
/// remove_all_useless is \c false because some algorithms (like the
|
|
/// degeneralization) will work better if transitions going to an
|
|
/// accepting SCC are accepting.
|
|
///
|
|
/// If \a given_sm is supplied, the function will use its result
|
|
/// without computing a map of its own.
|
|
///
|
|
/// \warning Calling scc_filter on a TGBA that has the SBA property
|
|
/// (i.e., transitions leaving accepting states are all marked as
|
|
/// accepting) may destroy this property. Use scc_filter_states()
|
|
/// instead.
|
|
SPOT_API twa_graph_ptr
|
|
scc_filter(const const_twa_graph_ptr& aut, bool remove_all_useless = false,
|
|
scc_info* given_si = 0);
|
|
|
|
/// \brief Prune unaccepting SCCs.
|
|
///
|
|
/// This is an abridged version of scc_filter(), that only remove
|
|
/// useless states, without touching at the acceptance conditions.
|
|
///
|
|
/// Especially, if the input TGBA has the SBA property, (i.e.,
|
|
/// transitions leaving accepting states are all marked as
|
|
/// accepting), then the output TGBA will also have that property.
|
|
SPOT_API twa_graph_ptr
|
|
scc_filter_states(const const_twa_graph_ptr& aut, scc_info* given_si = 0);
|
|
|
|
/// \brief Prune unaccepting SCCs, superfluous acceptance
|
|
/// sets, and suspension variables.
|
|
///
|
|
/// In addition to removing useless states, and acceptance sets,
|
|
/// this remove all ignoredvars occurring in conditions, and all
|
|
/// suspvars in conditions leadings to non-accepting SCC (as well
|
|
/// as the conditions between two SCCs if early_susp is false).
|
|
///
|
|
/// This is used by compsusp(), and is probably useless for any
|
|
/// other use.
|
|
SPOT_API twa_graph_ptr
|
|
scc_filter_susp(const const_twa_graph_ptr& aut, bool remove_all_useless,
|
|
bdd suspvars, bdd ignoredvars, bool early_susp,
|
|
scc_info* given_si = 0);
|
|
}
|