f120dd3206
* NEWS: Mention the change. * src/: Rename as ... * spot/: ... this, adjust all headers to include <spot/...> instead of "...", and adjust all Makefile.am to search headers from the top-level directory. * HACKING: Add conventions about #include. * spot/sanity/style.test: Add a few more grep to catch cases that do not follow these conventions. * .gitignore, Makefile.am, README, bench/stutter/Makefile.am, bench/stutter/stutter_invariance_formulas.cc, bench/stutter/stutter_invariance_randomgraph.cc, configure.ac, debian/rules, doc/Doxyfile.in, doc/Makefile.am, doc/org/.dir-locals.el.in, doc/org/g++wrap.in, doc/org/init.el.in, doc/org/tut01.org, doc/org/tut02.org, doc/org/tut03.org, doc/org/tut10.org, doc/org/tut20.org, doc/org/tut21.org, doc/org/tut22.org, doc/org/tut30.org, iface/ltsmin/Makefile.am, iface/ltsmin/kripke.test, iface/ltsmin/ltsmin.cc, iface/ltsmin/ltsmin.hh, iface/ltsmin/modelcheck.cc, wrap/python/Makefile.am, wrap/python/ajax/spotcgi.in, wrap/python/spot_impl.i, wrap/python/tests/ltl2tgba.py, wrap/python/tests/randgen.py, wrap/python/tests/run.in: Adjust.
66 lines
2.6 KiB
C++
66 lines
2.6 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2012, 2013, 2014 2015, Laboratoire de Recherche et
|
|
// Développement de l'Epita.
|
|
//
|
|
// 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/twa/twagraph.hh>
|
|
|
|
namespace spot
|
|
{
|
|
/// \ingroup twa_misc
|
|
/// \brief Degeneralize a spot::tgba into an equivalent sba with
|
|
/// only one acceptance condition.
|
|
///
|
|
/// This algorithms will build a new explicit automaton that has
|
|
/// at most (N+1) times the number of states of the original automaton.
|
|
///
|
|
/// When \a use_z_lvl is set, the level of the degeneralized
|
|
/// automaton is reset everytime an SCC is exited. If \a
|
|
/// use_cust_acc_orders is set, the degeneralization will compute a
|
|
/// custom acceptance order for each SCC (this option is disabled by
|
|
/// default because our benchmarks show that it usually does more
|
|
/// harm than good). If \a use_lvl_cache is set, everytime an SCC
|
|
/// is entered on a state that as already been associated to some
|
|
/// level elsewhere, reuse that level (set it to 2 to keep the
|
|
/// smallest number, 3 to keep the largest level, and 1 to keep the
|
|
/// first level found). If \a ignaccsl is set, we do not directly
|
|
/// jump to the accepting level if the entering state has an
|
|
/// accepting self-loop.
|
|
///
|
|
/// Any of these three options will cause the SCCs of the automaton
|
|
/// \a a to be computed prior to its actual degeneralization.
|
|
///
|
|
/// The degeneralize_tba() variant produce a degeneralized automaton
|
|
/// with transition-based acceptance.
|
|
/// \@{
|
|
SPOT_API twa_graph_ptr
|
|
degeneralize(const const_twa_graph_ptr& a, bool use_z_lvl = true,
|
|
bool use_cust_acc_orders = false,
|
|
int use_lvl_cache = 1,
|
|
bool skip_levels = true,
|
|
bool ignaccsl = false);
|
|
|
|
SPOT_API twa_graph_ptr
|
|
degeneralize_tba(const const_twa_graph_ptr& a, bool use_z_lvl = true,
|
|
bool use_cust_acc_orders = false,
|
|
int use_lvl_cache = 1,
|
|
bool skip_levels = true,
|
|
bool ignaccsl = false);
|
|
/// \@}
|
|
}
|