6d7c258fd7
At the same time, this adds a is_empty() method to the tgba class, simplifying many places that ran emptiness checks. * iface/dve2/dve2check.cc, src/bin/ltlcross.cc, src/dstarparse/dra2ba.cc, src/ltlvisit/contain.cc, src/tgba/tgba.cc, src/tgba/tgba.hh, src/tgbaalgos/emptiness.cc, src/tgbaalgos/emptiness.hh, src/tgbaalgos/gtec/ce.cc, src/tgbaalgos/gtec/ce.hh, src/tgbaalgos/gtec/gtec.cc, src/tgbaalgos/gtec/gtec.hh, src/tgbaalgos/gv04.cc, src/tgbaalgos/gv04.hh, src/tgbaalgos/magic.cc, src/tgbaalgos/magic.hh, src/tgbaalgos/minimize.cc, src/tgbaalgos/ndfs_result.hxx, src/tgbaalgos/powerset.cc, src/tgbaalgos/projrun.cc, src/tgbaalgos/projrun.hh, src/tgbaalgos/reducerun.cc, src/tgbaalgos/reducerun.hh, src/tgbaalgos/replayrun.cc, src/tgbaalgos/replayrun.hh, src/tgbaalgos/rundotdec.cc, src/tgbaalgos/rundotdec.hh, src/tgbaalgos/se05.cc, src/tgbaalgos/se05.hh, src/tgbaalgos/tau03.cc, src/tgbaalgos/tau03.hh, src/tgbaalgos/tau03opt.cc, src/tgbaalgos/tau03opt.hh, src/tgbaalgos/word.cc, src/tgbaalgos/word.hh, src/tgbatest/checkpsl.cc, src/tgbatest/complementation.cc, src/tgbatest/emptchk.cc, src/tgbatest/ltl2tgba.cc, src/tgbatest/randtgba.cc, wrap/python/ajax/spot.in, wrap/python/spot.i: Use shared_ptr.
110 lines
2.9 KiB
C++
110 lines
2.9 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2013, 2014 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/>.
|
|
|
|
#include "word.hh"
|
|
#include "tgba/bddprint.hh"
|
|
#include "tgba/bdddict.hh"
|
|
|
|
namespace spot
|
|
{
|
|
tgba_word::tgba_word(const tgba_run_ptr run)
|
|
{
|
|
for (tgba_run::steps::const_iterator i = run->prefix.begin();
|
|
i != run->prefix.end(); ++i)
|
|
prefix.push_back(i->label);
|
|
for (tgba_run::steps::const_iterator i = run->cycle.begin();
|
|
i != run->cycle.end(); ++i)
|
|
cycle.push_back(i->label);
|
|
}
|
|
|
|
void
|
|
tgba_word::simplify()
|
|
{
|
|
// If all the formulas on the cycle are compatible, reduce the
|
|
// cycle to a simple conjunction.
|
|
//
|
|
// For instance
|
|
// !a|!b; b; a&b; cycle{a; b; a&b}
|
|
// can be reduced to
|
|
// !a|!b; b; a&b; cycle{a&b}
|
|
{
|
|
bdd all = bddtrue;
|
|
for (seq_t::const_iterator i = cycle.begin(); i != cycle.end(); ++i)
|
|
all &= *i;
|
|
if (all != bddfalse)
|
|
{
|
|
cycle.clear();
|
|
cycle.push_back(all);
|
|
}
|
|
}
|
|
// If the last formula of the prefix is compatible with the
|
|
// last formula of the cycle, we can shift the cycle and
|
|
// reduce the prefix.
|
|
//
|
|
// For instance
|
|
// !a|!b; b; a&b; cycle{a&b}
|
|
// can be reduced to
|
|
// !a|!b; cycle{a&b}
|
|
while (!prefix.empty())
|
|
{
|
|
bdd a = prefix.back() & cycle.back();
|
|
if (a == bddfalse)
|
|
break;
|
|
prefix.pop_back();
|
|
cycle.pop_back();
|
|
cycle.push_front(a);
|
|
}
|
|
// Get rid of any disjunction.
|
|
//
|
|
// For instance
|
|
// !a|!b; cycle{a&b}
|
|
// can be reduced to
|
|
// !a&!b; cycle{a&b}
|
|
for (seq_t::iterator i = prefix.begin(); i != prefix.end(); ++i)
|
|
*i = bdd_satone(*i);
|
|
for (seq_t::iterator i = cycle.begin(); i != cycle.end(); ++i)
|
|
*i = bdd_satone(*i);
|
|
|
|
}
|
|
|
|
std::ostream&
|
|
tgba_word::print(std::ostream& os, const bdd_dict_ptr& d) const
|
|
{
|
|
if (!prefix.empty())
|
|
for (seq_t::const_iterator i = prefix.begin(); i != prefix.end(); ++i)
|
|
{
|
|
bdd_print_formula(os, d, *i);
|
|
os << "; ";
|
|
}
|
|
assert(!cycle.empty());
|
|
bool notfirst = false;
|
|
os << "cycle{";
|
|
for (seq_t::const_iterator i = cycle.begin(); i != cycle.end(); ++i)
|
|
{
|
|
if (notfirst)
|
|
os << "; ";
|
|
notfirst = true;
|
|
bdd_print_formula(os, d, *i);
|
|
}
|
|
os << '}';
|
|
return os;
|
|
}
|
|
|
|
|
|
}
|