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.
88 lines
2.2 KiB
C++
88 lines
2.2 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2012, 2013, 2014, 2015, 2016 Laboratoire de Recherche
|
|
// et Développement 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/isdet.hh>
|
|
#include <set>
|
|
#include <deque>
|
|
|
|
namespace spot
|
|
{
|
|
namespace
|
|
{
|
|
template<bool count>
|
|
static
|
|
unsigned
|
|
count_nondet_states_aux(const const_twa_graph_ptr& aut)
|
|
{
|
|
unsigned nondet_states = 0;
|
|
unsigned ns = aut->num_states();
|
|
for (unsigned src = 0; src < ns; ++src)
|
|
{
|
|
bdd available = bddtrue;
|
|
for (auto& t: aut->out(src))
|
|
if (!bdd_implies(t.cond, available))
|
|
{
|
|
++nondet_states;
|
|
break;
|
|
}
|
|
else
|
|
{
|
|
available -= t.cond;
|
|
}
|
|
// If we are not counting non-deterministic states, abort as
|
|
// soon as possible.
|
|
if (!count && nondet_states)
|
|
break;
|
|
}
|
|
return nondet_states;
|
|
}
|
|
}
|
|
|
|
unsigned
|
|
count_nondet_states(const const_twa_graph_ptr& aut)
|
|
{
|
|
return count_nondet_states_aux<true>(aut);
|
|
}
|
|
|
|
bool
|
|
is_deterministic(const const_twa_graph_ptr& aut)
|
|
{
|
|
trival d = aut->prop_deterministic();
|
|
if (d.is_known())
|
|
return d.is_true();
|
|
return !count_nondet_states_aux<false>(aut);
|
|
}
|
|
|
|
bool
|
|
is_complete(const const_twa_graph_ptr& aut)
|
|
{
|
|
unsigned ns = aut->num_states();
|
|
for (unsigned src = 0; src < ns; ++src)
|
|
{
|
|
bdd available = bddtrue;
|
|
for (auto& t: aut->out(src))
|
|
available -= t.cond;
|
|
if (available != bddfalse)
|
|
return false;
|
|
}
|
|
// The empty automaton is not complete since it does not have an
|
|
// initial state.
|
|
return ns > 0;
|
|
}
|
|
}
|