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.
63 lines
1.8 KiB
C++
63 lines
1.8 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2015 Laboratoire de Recherche et Développement
|
|
// de l'Epita.
|
|
//
|
|
// 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/>.
|
|
|
|
#include "twaalgos/cleanacc.hh"
|
|
|
|
namespace spot
|
|
{
|
|
twa_graph_ptr cleanup_acceptance_here(twa_graph_ptr aut)
|
|
{
|
|
auto& acc = aut->acc();
|
|
if (acc.num_sets() == 0)
|
|
return aut;
|
|
|
|
auto& c = aut->get_acceptance();
|
|
acc_cond::mark_t used_in_cond = c.used_sets();
|
|
|
|
acc_cond::mark_t used_in_aut = 0U;
|
|
for (auto& t: aut->transitions())
|
|
used_in_aut |= t.acc;
|
|
|
|
auto useful = used_in_aut & used_in_cond;
|
|
|
|
auto useless = acc.comp(useful);
|
|
|
|
if (!useless)
|
|
return aut;
|
|
|
|
// Remove useless marks from the automaton
|
|
for (auto& t: aut->transitions())
|
|
t.acc = t.acc.strip(useless);
|
|
|
|
// Remove useless marks from the acceptance condition
|
|
aut->set_acceptance(useful.count(), c.strip(useless, true));
|
|
|
|
// This may in turn cause even more set to be unused, because of
|
|
// some simplifications, so do it again.
|
|
return cleanup_acceptance_here(aut);
|
|
}
|
|
|
|
twa_graph_ptr cleanup_acceptance(const_twa_graph_ptr aut)
|
|
{
|
|
return cleanup_acceptance_here(make_twa_graph(aut,
|
|
twa::prop_set::all()));
|
|
}
|
|
|
|
|
|
}
|