358d4bfdf2
* src/tgbaalgos/powerset.hh (power_map): New structure, allowing the caller to retrieve the set of original states corresponding to the set in the deterministic automaton. (power_set): Adjust prototype to take a power_map instead of the acc_list. * src/tgbaalgos/powerset.cc (power_set): Strip all code using acc_list, and update power_set. * src/tgbaalgos/minimize.cc (minimize): Rewrite, using an algorithm similar to the one in the Dax paper to check whether state of the minimized automaton should be accepting.
119 lines
3.3 KiB
C++
119 lines
3.3 KiB
C++
// Copyright (C) 2009, 2010, 2011 Laboratoire de Recherche et Développement
|
|
// de l'Epita (LRDE).
|
|
// Copyright (C) 2004 Laboratoire d'Informatique de Paris 6 (LIP6),
|
|
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
|
|
// et Marie Curie.
|
|
//
|
|
// 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 2 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 Spot; see the file COPYING. If not, write to the Free
|
|
// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
|
// 02111-1307, USA.
|
|
|
|
#include <set>
|
|
#include <deque>
|
|
#include "powerset.hh"
|
|
#include "misc/hash.hh"
|
|
#include "tgbaalgos/powerset.hh"
|
|
#include "bdd.h"
|
|
|
|
namespace spot
|
|
{
|
|
tgba_explicit_number*
|
|
tgba_powerset(const tgba* aut, power_map& pm)
|
|
{
|
|
typedef power_map::power_state power_state;
|
|
typedef std::map<power_map::power_state, int> power_set;
|
|
typedef std::deque<power_map::power_state> todo_list;
|
|
|
|
power_set seen;
|
|
todo_list todo;
|
|
tgba_explicit_number* res = new tgba_explicit_number(aut->get_dict());
|
|
|
|
{
|
|
power_state ps;
|
|
state* s = aut->get_init_state();
|
|
pm.states.insert(s);
|
|
ps.insert(s);
|
|
todo.push_back(ps);
|
|
seen[ps] = 1;
|
|
pm.map_[1] = ps;
|
|
}
|
|
|
|
unsigned state_num = 1;
|
|
|
|
while (!todo.empty())
|
|
{
|
|
power_state src = todo.front();
|
|
todo.pop_front();
|
|
// Compute all variables occurring on outgoing arcs.
|
|
bdd all_vars = bddtrue;
|
|
power_state::const_iterator i;
|
|
|
|
for (i = src.begin(); i != src.end(); ++i)
|
|
all_vars &= aut->support_variables(*i);
|
|
|
|
// Compute all possible combinations of these variables.
|
|
bdd all_conds = bddtrue;
|
|
while (all_conds != bddfalse)
|
|
{
|
|
bdd cond = bdd_satoneset(all_conds, all_vars, bddtrue);
|
|
all_conds -= cond;
|
|
|
|
// Construct the set of all states reachable via COND.
|
|
power_state dest;
|
|
for (i = src.begin(); i != src.end(); ++i)
|
|
{
|
|
tgba_succ_iterator *si = aut->succ_iter(*i);
|
|
for (si->first(); !si->done(); si->next())
|
|
if ((cond >> si->current_condition()) == bddtrue)
|
|
{
|
|
const state* s = pm.canonicalize(si->current_state());
|
|
dest.insert(s);
|
|
}
|
|
delete si;
|
|
}
|
|
if (dest.empty())
|
|
continue;
|
|
// Add that transition.
|
|
power_set::const_iterator i = seen.find(dest);
|
|
int dest_num;
|
|
tgba_explicit::transition* t;
|
|
if (i != seen.end())
|
|
{
|
|
dest_num = i->second;
|
|
t = res->create_transition(seen[src], dest_num);
|
|
}
|
|
else
|
|
{
|
|
dest_num = ++state_num;
|
|
seen[dest] = dest_num;
|
|
pm.map_[dest_num] = dest;
|
|
todo.push_back(dest);
|
|
t = res->create_transition(seen[src], dest_num);
|
|
}
|
|
res->add_conditions(t, cond);
|
|
}
|
|
}
|
|
res->merge_transitions();
|
|
return res;
|
|
}
|
|
|
|
tgba_explicit_number*
|
|
tgba_powerset(const tgba* aut)
|
|
{
|
|
power_map pm;
|
|
return tgba_powerset(aut, pm);
|
|
}
|
|
}
|