da391492f3
* spot/twa/twa.hh: Store property bits as trivals. * NEWS: Mention the change. * spot/parseaut/parseaut.yy, spot/twaalgos/are_isomorphic.cc, spot/twaalgos/complete.cc, spot/twaalgos/dot.cc, spot/twaalgos/hoa.cc, spot/twaalgos/isdet.cc, spot/twaalgos/isunamb.cc, spot/twaalgos/lbtt.cc, spot/twaalgos/ltl2tgba_fm.cc, spot/twaalgos/postproc.cc, spot/twaalgos/remfin.cc, spot/twaalgos/strength.cc, spot/twaalgos/stutter.cc, spot/twaalgos/stutter.hh, spot/twaalgos/totgba.cc, tests/core/ikwiad.cc, tests/python/product.ipynb, tests/python/remfin.py: Adjust. * doc/org/hoa.org, doc/org/tut21.org: Update documentation.
49 lines
1.5 KiB
C++
49 lines
1.5 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2013, 2015, 2016 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 <spot/twaalgos/isunamb.hh>
|
|
#include <spot/twaalgos/product.hh>
|
|
#include <spot/twaalgos/sccfilter.hh>
|
|
#include <set>
|
|
#include <list>
|
|
|
|
namespace spot
|
|
{
|
|
bool is_unambiguous(const const_twa_graph_ptr& aut)
|
|
{
|
|
trival u = aut->prop_unambiguous();
|
|
if (u.is_known())
|
|
return u.is_true();
|
|
|
|
auto clean_a = scc_filter_states(aut);
|
|
if (clean_a->num_edges() == 0)
|
|
return true;
|
|
auto prod = product(clean_a, clean_a);
|
|
auto clean_p = scc_filter_states(prod);
|
|
return (clean_a->num_states() == clean_p->num_states()
|
|
&& clean_a->num_edges() == clean_p->num_edges());
|
|
}
|
|
|
|
bool check_unambiguous(const twa_graph_ptr& aut)
|
|
{
|
|
bool u = is_unambiguous(aut);
|
|
aut->prop_unambiguous(u);
|
|
return u;
|
|
}
|
|
}
|