de529df59f
Automatic mass renaming. * src/tgbaalgos/: Rename as... * src/twaalgos/: ... this. * README, configure.ac, iface/ltsmin/modelcheck.cc, src/Makefile.am, src/bin/autfilt.cc, src/bin/common_aoutput.cc, src/bin/common_aoutput.hh, src/bin/common_output.hh, src/bin/common_post.hh, src/bin/dstar2tgba.cc, src/bin/ltl2tgba.cc, src/bin/ltl2tgta.cc, src/bin/ltlcross.cc, src/bin/ltldo.cc, src/bin/ltlfilt.cc, src/bin/randaut.cc, src/dstarparse/dra2ba.cc, src/dstarparse/nra2nba.cc, src/dstarparse/nsa2tgba.cc, src/graphtest/twagraph.cc, src/kripke/kripkeprint.cc, src/ltlvisit/contain.cc, src/ltlvisit/contain.hh, src/ltlvisit/exclusive.cc, src/taalgos/emptinessta.hh, src/tgbatest/checkpsl.cc, src/tgbatest/checkta.cc, src/tgbatest/complementation.cc, src/tgbatest/emptchk.cc, src/tgbatest/ltl2tgba.cc, src/tgbatest/ltlprod.cc, src/tgbatest/randtgba.cc, src/tgbatest/taatgba.cc, src/twa/twa.cc, src/twa/twagraph.hh, src/twa/twasafracomplement.cc, wrap/python/spot_impl.i: Adjust.
53 lines
1.8 KiB
C++
53 lines
1.8 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2012, 2013, 2014, 2015 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/>.
|
|
|
|
#pragma once
|
|
|
|
#include "twa/twagraph.hh"
|
|
|
|
namespace spot
|
|
{
|
|
/// \addtogroup twa_misc
|
|
/// @{
|
|
|
|
/// \brief Count the number of non-deterministic states in \a aut.
|
|
///
|
|
/// The automaton is deterministic if it has 0 nondeterministic states,
|
|
/// but it is more efficient to call is_deterministic() if you do not
|
|
/// care about the number of nondeterministic states.
|
|
SPOT_API unsigned
|
|
count_nondet_states(const const_twa_graph_ptr& aut);
|
|
|
|
/// \brief Return true iff \a aut is deterministic.
|
|
///
|
|
/// This function is more efficient than count_nondet_states() when
|
|
/// the automaton is nondeterministic, because it can return before
|
|
/// the entire automaton has been explored.
|
|
SPOT_API bool
|
|
is_deterministic(const const_twa_graph_ptr& aut);
|
|
|
|
/// \brief Return true iff \a aut is complete.
|
|
///
|
|
/// An automaton is complete if its translation relation is total,
|
|
/// i.e., each state as a successor for any possible configuration.
|
|
SPOT_API bool
|
|
is_complete(const const_twa_graph_ptr& aut);
|
|
|
|
/// @}
|
|
}
|