hierarchy.hh

// -*- coding: utf-8 -*-
// Copyright (C) 2017, 2018, 2019 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/tl/formula.hh>
#include <spot/twa/fwd.hh>
 
namespace spot
{
  enum class prcheck
  {
    Auto,
    via_CoBuchi,
    via_Rabin,
    via_Parity,
  };
 
  SPOT_API bool
  is_persistence(formula f,
                 twa_graph_ptr aut = nullptr,
                 prcheck algo = prcheck::Auto);
 
  SPOT_API bool
  is_recurrence(formula f,
                twa_graph_ptr aut = nullptr,
                prcheck algo = prcheck::Auto);
 
  enum class ocheck
  {
    Auto,
    via_CoBuchi,
    via_Rabin,
    via_WDBA,
  };
 
  SPOT_API bool
  is_obligation(formula f,
                twa_graph_ptr aut = nullptr,
                ocheck algo = ocheck::Auto);
 
  SPOT_API char mp_class(formula f);
 
 
  SPOT_API std::string mp_class(formula f, const char* opt);
 
  SPOT_API std::string mp_class(char mpc, const char* opt);
 
 
  SPOT_API unsigned nesting_depth(formula f, op oper);
 
#ifndef SWIG
  SPOT_API unsigned nesting_depth(formula f, const op* begin, const op* end);
#endif
 
  SPOT_API unsigned nesting_depth(formula f, const char* opers);
 
 
  SPOT_API bool is_liveness(formula f);
}