87c2b291ed
* src/tgba/tgba.hh: Declare a prop_set to specify the types. * src/tgba/tgbagraph.hh: Use prop_set for all copy constructors. * iface/ltsmin/ltsmin.cc, src/bin/autfilt.cc, src/bin/randaut.cc, src/tgbaalgos/are_isomorphic.cc, src/tgbaalgos/closure.cc, src/tgbaalgos/complete.cc, src/tgbaalgos/degen.cc, src/tgbaalgos/dotty.cc, src/tgbaalgos/dtgbacomp.cc, src/tgbaalgos/dupexp.cc, src/tgbaalgos/dupexp.hh, src/tgbaalgos/sccfilter.cc, src/tgbaalgos/simulation.cc, src/tgbaalgos/stutterize.cc, src/tgbatest/checkpsl.cc, src/tgbatest/emptchk.cc, src/tgbatest/ltl2tgba.cc, wrap/python/spot.i,src/graphtest/tgbagraph.test: Adjust all uses.
117 lines
3.3 KiB
C++
117 lines
3.3 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2013, 2014 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 "complete.hh"
|
|
|
|
namespace spot
|
|
{
|
|
unsigned tgba_complete_here(tgba_digraph_ptr aut)
|
|
{
|
|
unsigned n = aut->num_states();
|
|
unsigned sink = -1U;
|
|
acc_cond::mark_t allacc = aut->acc().all_sets();
|
|
if (allacc == 0U)
|
|
{
|
|
// We cannot safely complete an automaton if it has no
|
|
// acceptance set as the added sink would become accepting.
|
|
// In this case, add an acceptance set to all transitions.
|
|
allacc = aut->set_single_acceptance_set();
|
|
for (auto& t: aut->transition_vector())
|
|
t.acc = allacc;
|
|
}
|
|
else
|
|
{
|
|
// If some acceptance sets were used, loop over the states and
|
|
// seek a state that has only self loops, and that is not
|
|
// accepting. This will be our sink state.
|
|
for (unsigned i = 0; i < n; ++i)
|
|
{
|
|
bool selfloop = true;
|
|
acc_cond::mark_t accsum = 0U;
|
|
for (auto& t: aut->out(i))
|
|
{
|
|
if (t.dst != i) // Not a self-loop
|
|
{
|
|
selfloop = false;
|
|
break;
|
|
}
|
|
accsum |= t.acc;
|
|
}
|
|
if (selfloop && accsum != allacc) // We have found a sink!
|
|
{
|
|
sink = i;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
// Now complete all states (including the sink).
|
|
for (unsigned i = 0; i < n; ++i)
|
|
{
|
|
bdd missingcond = bddtrue;
|
|
acc_cond::mark_t acc = 0U;
|
|
for (auto& t: aut->out(i))
|
|
{
|
|
missingcond -= t.cond;
|
|
// FIXME: This is ugly.
|
|
//
|
|
// In case the automaton uses state-based acceptance, we
|
|
// need to put the new transition in the same set as all
|
|
// the other.
|
|
//
|
|
// In case the automaton uses transition-based acceptance,
|
|
// it does not matter what acceptance set we put the new
|
|
// transition into.
|
|
//
|
|
// So in both cases, we put the transition in the same
|
|
// acceptance sets as the last outgoing transition of the
|
|
// state.
|
|
acc = t.acc;
|
|
}
|
|
// If the state has incomplete successors, we need to add a
|
|
// transition to some sink state.
|
|
if (missingcond != bddfalse)
|
|
{
|
|
// If we haven't found any sink, simply add one.
|
|
if (sink == -1U)
|
|
{
|
|
sink = aut->new_state();
|
|
++n;
|
|
}
|
|
// In case the automaton use state-based acceptance, propagate
|
|
// the acceptance of the first transition to the one we add.
|
|
aut->new_transition(i, sink, missingcond, acc);
|
|
}
|
|
}
|
|
return sink;
|
|
}
|
|
|
|
tgba_digraph_ptr tgba_complete(const const_tgba_ptr& aut)
|
|
{
|
|
auto res = make_tgba_digraph(aut, {
|
|
true, // state based
|
|
true, // single acc
|
|
true, // inherently_weak
|
|
true, // deterministic
|
|
});
|
|
tgba_complete_here(res);
|
|
return res;
|
|
}
|
|
|
|
}
|