spot
2.8.7
spot
twaalgos
remfin.hh
1
// -*- coding: utf-8 -*-
2
// Copyright (C) 2015, 2017, 2018 Laboratoire de Recherche et
3
// Développement de l'Epita.
4
//
5
// This file is part of Spot, a model checking library.
6
//
7
// Spot is free software; you can redistribute it and/or modify it
8
// under the terms of the GNU General Public License as published by
9
// the Free Software Foundation; either version 3 of the License, or
10
// (at your option) any later version.
11
//
12
// Spot is distributed in the hope that it will be useful, but WITHOUT
13
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14
// or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
15
// License for more details.
16
//
17
// You should have received a copy of the GNU General Public License
18
// along with this program. If not, see <http://www.gnu.org/licenses/>.
19
20
#pragma once
21
22
#include <spot/twa/twagraph.hh>
23
24
namespace
spot
25
{
30
SPOT_API
bool
31
rabin_is_buchi_realizable
(
const
const_twa_graph_ptr& aut);
32
47
SPOT_API twa_graph_ptr
48
rabin_to_buchi_maybe
(
const
const_twa_graph_ptr& aut);
49
61
SPOT_API twa_graph_ptr
62
remove_fin
(
const
const_twa_graph_ptr& aut);
63
}
spot
Definition:
automata.hh:26
spot::rabin_is_buchi_realizable
bool rabin_is_buchi_realizable(const const_twa_graph_ptr &aut)
Check if is Büchi-realizable. This is inspired from rabin_to_buchi_maybe()'s algorithm. The main difference is that here, no automaton is built.
spot::remove_fin
twa_graph_ptr remove_fin(const const_twa_graph_ptr &aut)
Rewrite an automaton without Fin or f acceptance.
spot::rabin_to_buchi_maybe
twa_graph_ptr rabin_to_buchi_maybe(const const_twa_graph_ptr &aut)
Convert a Rabin automaton to Büchi automaton, preserving determinism when possible.
Please direct any
question
,
comment
, or
bug report
to the Spot mailing list at
spot@lrde.epita.fr
.
Generated on Fri Feb 27 2015 10:00:07 for spot by
1.8.13