alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

twaalgos: Implement language_map algo

Browse source 
* python/spot/impl.i: Add python bindings.
* spot/twaalgos/langmap.cc: Implement algo.
* spot/twaalgos/langmap.hh: Declare algo.
* spot/twaalgos/Makefile.am: Add new files.
* tests/python/langmap.py: Add tests.
* NEWS: Update.
This commit is contained in:
Alexandre GBAGUIDI AISSE 2016-12-12 16:45:03 +01:00
parent 9a204b770f
commit 8a0eed6cef
6 changed files with 234 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

83
spot/twaalgos/langmap.cc Normal file
View file

@ -0,0 +1,83 @@
// -*- coding: utf-8 -*-
// Copyright (C) 2016 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 <numeric>
#include <spot/twa/twa.hh>
#include <spot/twaalgos/complement.hh>
#include <spot/twaalgos/copy.hh>
#include <spot/twaalgos/isdet.hh>
#include <spot/twaalgos/langmap.hh>
#include <spot/twaalgos/remfin.hh>
namespace spot
{
void highlight_languages(twa_graph_ptr& aut,
const std::vector<unsigned>& v)
{
auto hs = new std::map<unsigned, unsigned>;
aut->set_named_prop("highlight-states", hs);
unsigned n_states = aut->num_states();
for (unsigned i = 0; i < n_states; ++i)
(*hs)[i] = v[i];
}
std::vector<unsigned>
language_map(const const_twa_graph_ptr& aut)
{
if (!is_deterministic(aut))
throw std::runtime_error(
"language_map only works with deterministic automata");
unsigned n_states = aut->num_states();
std::vector<unsigned> res(n_states);
std::iota(std::begin(res), std::end(res), 0);
std::vector<twa_graph_ptr> alt_init_st_auts(n_states);
std::vector<twa_graph_ptr> compl_alt_init_st_auts(n_states);
// Prepare all automatons needed.
for (unsigned i = 0; i < n_states; ++i)
{
twa_graph_ptr c = copy(aut, twa::prop_set::all());
c->set_init_state(i);
alt_init_st_auts[i] = c;
twa_graph_ptr cc =
remove_fin(dtwa_complement(copy(c, twa::prop_set::all())));
compl_alt_init_st_auts[i] = cc;
}
for (unsigned i = 1; i < n_states; ++i)
for (unsigned j = 0; j < i; ++j)
{
if (res[j] != j)
continue;
if (!alt_init_st_auts[i]->intersects(compl_alt_init_st_auts[j])
&& (!compl_alt_init_st_auts[i]->intersects(alt_init_st_auts[j])))
{
res[i] = res[j];
break;
}
}
return res;
}
}