isdet.hh

// -*- coding: utf-8 -*-
// Copyright (C) 2012-2018 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 <spot/twaalgos/sccinfo.hh>
#include <spot/twa/twagraph.hh>
 
namespace spot
{
 
  SPOT_API unsigned
  count_nondet_states(const const_twa_graph_ptr& aut);
 
  SPOT_API bool
  is_universal(const const_twa_graph_ptr& aut);
 
  SPOT_API bool
  is_deterministic(const const_twa_graph_ptr& aut);
 
  SPOT_API void
  highlight_nondet_states(twa_graph_ptr& aut, unsigned color);
 
  SPOT_API void
  highlight_nondet_edges(twa_graph_ptr& aut, unsigned color);
 
  SPOT_API void
  highlight_semidet_sccs(scc_info& si, unsigned color);
 
  SPOT_API bool
  is_complete(const const_twa_graph_ptr& aut);
 
  SPOT_API bool
  is_semi_deterministic(const const_twa_graph_ptr& aut);
 
  SPOT_API std::vector<bool>
  semidet_sccs(scc_info& si);
 
  SPOT_API void check_determinism(twa_graph_ptr aut);
 
  // \brief Count states with some universal branching.
  //
  // This counts the number of states that have edges going to several
  // destinations at once (as reported by aut->is_univ_dest(...)).
  //
  // Note that nondeterministic automata (which include deterministic
  // automata) have 0 such state, but additionally they also have
  // "singleton" initial state (which this function does not check).
  //
  // \see count_univbranch_edges()
  SPOT_API unsigned
  count_univbranch_states(const const_twa_graph_ptr& aut);
 
  // \brief Count edges with universal branching.
  //
  // This counts the number of edges going to several destination at
  // once (as reported by aut->is_univ_dest(...)).
  //
  // If the automaton starts in multiple initial states at once, this
  // is considered as a universal "initial edge", and adds one to the
  // total count.
  //
  // Nondeterministic automata (which include deterministic automata)
  // have 0 edges with universal branching.
  //
  // \see count_univbranch_states()
  SPOT_API unsigned
  count_univbranch_edges(const const_twa_graph_ptr& aut);
}