introduce spot::split_edges()
Fixes #255. * spot/twaalgos/split.cc, spot/twaalgos/split.hh, tests/core/split.test: New files. * spot/twaalgos/Makefile.am, tests/Makefile.am: Add them. * bin/autfilt.cc (--split-edges): New option. * python/spot/impl.i: Process split.hh. * tests/python/alternating.py: Test split_edges() on an alternating automaton.
This commit is contained in:
parent
3d8c48555b
commit
19aae6f9cf
9 changed files with 200 additions and 22 deletions
|
|
@ -1,9 +1,9 @@
|
|||
## -*- coding: utf-8 -*-
|
||||
## Copyright (C) 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 Laboratoire
|
||||
## de Recherche et Développement de l'Epita (LRDE).
|
||||
## Copyright (C) 2003, 2004, 2005 Laboratoire d'Informatique de Paris
|
||||
## 6 (LIP6), département Systèmes Répartis Coopératifs (SRC),
|
||||
## Université Pierre et Marie Curie.
|
||||
## Copyright (C) 2008-2017 Laboratoire de Recherche et Développement
|
||||
## de l'Epita (LRDE).
|
||||
## Copyright (C) 2003-2005 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.
|
||||
##
|
||||
|
|
@ -69,6 +69,7 @@ twaalgos_HEADERS = \
|
|||
relabel.hh \
|
||||
remfin.hh \
|
||||
remprop.hh \
|
||||
split.hh \
|
||||
strength.hh \
|
||||
sbacc.hh \
|
||||
sccfilter.hh \
|
||||
|
|
@ -129,6 +130,7 @@ libtwaalgos_la_SOURCES = \
|
|||
remfin.cc \
|
||||
remprop.cc \
|
||||
relabel.cc \
|
||||
split.cc \
|
||||
strength.cc \
|
||||
sbacc.cc \
|
||||
sccinfo.cc \
|
||||
|
|
|
|||
56
spot/twaalgos/split.cc
Normal file
56
spot/twaalgos/split.cc
Normal file
|
|
@ -0,0 +1,56 @@
|
|||
// -*- coding: utf-8 -*-
|
||||
// Copyright (C) 2017 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 <spot/twaalgos/split.hh>
|
||||
|
||||
namespace spot
|
||||
{
|
||||
twa_graph_ptr split_edges(const const_twa_graph_ptr& aut)
|
||||
{
|
||||
twa_graph_ptr out = make_twa_graph(aut->get_dict());
|
||||
out->copy_acceptance_of(aut);
|
||||
out->copy_ap_of(aut);
|
||||
out->prop_copy(aut, twa::prop_set::all());
|
||||
out->new_states(aut->num_states());
|
||||
out->set_init_state(aut->get_init_state_number());
|
||||
|
||||
internal::univ_dest_mapper<twa_graph::graph_t> uniq(out->get_graph());
|
||||
|
||||
bdd all = aut->ap_vars();
|
||||
for (auto& e: aut->edges())
|
||||
{
|
||||
bdd cond = e.cond;
|
||||
if (cond == bddfalse)
|
||||
continue;
|
||||
unsigned dst = e.dst;
|
||||
if (aut->is_univ_dest(dst))
|
||||
{
|
||||
auto d = aut->univ_dests(dst);
|
||||
dst = uniq.new_univ_dests(d.begin(), d.end());
|
||||
}
|
||||
while (cond != bddfalse)
|
||||
{
|
||||
bdd cube = bdd_satoneset(cond, all, bddfalse);
|
||||
cond -= cube;
|
||||
out->new_edge(e.src, dst, cube, e.acc);
|
||||
}
|
||||
}
|
||||
return out;
|
||||
}
|
||||
}
|
||||
33
spot/twaalgos/split.hh
Normal file
33
spot/twaalgos/split.hh
Normal file
|
|
@ -0,0 +1,33 @@
|
|||
// -*- coding: utf-8 -*-
|
||||
// Copyright (C) 2017 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/>.
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <spot/twa/twagraph.hh>
|
||||
|
||||
namespace spot
|
||||
{
|
||||
/// \brief transform edges into transitions
|
||||
///
|
||||
/// Create a new version of the automaton where all edges are split
|
||||
/// so that they are all labeled by a conjunction of all atomic
|
||||
/// propositions. After this we can consider that each edge of the
|
||||
/// automate is a transition labeled by one letter.
|
||||
SPOT_API twa_graph_ptr split_edges(const const_twa_graph_ptr& aut);
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue