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

Add an is_unambiguous() function, use it in ltlcross and autfilt

Browse source 
* src/twaalgos/isunamb.hh, src/twaalgos/isunamb.cc: New files.
* src/twaalgos/Makefile.am: Add them.
* src/tests/unambig.test: New file.
* src/tests/Makefile.am: Add it.
* src/bin/ltlcross.cc: Record whether each produced automaton is
ambiguous.
* src/bin/autfilt.cc: Add a --is-unambiguous option.
* NEWS: Mention it.
This commit is contained in:
Alexandre Duret-Lutz 2013-03-21 11:53:42 +01:00
parent 9f3a7a49de
commit 98de84f3de
8 changed files with 192 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

40
src/twaalgos/isunamb.cc Normal file
View file

@ -0,0 +1,40 @@
// -*- coding: utf-8 -*-
// Copyright (C) 2013, 2015 Laboratoire de Recherche et Developpement
// 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 "isunamb.hh"
#include "twaalgos/product.hh"
#include "sccfilter.hh"
#include "stats.hh"
#include <set>
#include <list>
namespace spot
{
bool is_unambiguous(const const_twa_graph_ptr& aut)
{
if (aut->is_deterministic())
return true;
auto clean_a = scc_filter_states(aut);
auto prod = product(clean_a, clean_a);
auto clean_p = scc_filter_states(prod);
tgba_statistics sa = stats_reachable(clean_a);
tgba_statistics sp = stats_reachable(clean_p);
return sa.states == sp.states && sa.transitions == sp.transitions;
}
}