bisimulation and complete just trigger extra algorithms to be called at the end of this one, so they need not be part of this algorithm. * spot/twaalgos/determinize.cc, spot/twaalgos/determinize.hh: Reduce the number of options. * tests/core/safra.cc: Implement those options here.
32 lines
1.1 KiB
C++
32 lines
1.1 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2015, 2016 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
|
|
{
|
|
SPOT_API twa_graph_ptr
|
|
tgba_determinisation(const const_twa_graph_ptr& aut,
|
|
bool pretty_print = false,
|
|
bool scc_opt = false,
|
|
bool use_bisimulation = false,
|
|
bool use_stutter = false);
|
|
}
|