spot 2.3.3

- Main Page
- Related Pages
- Modules
- Classes
- Files

- File List

All Classes Files Functions Variables Typedefs Enumerations Enumerator Friends Modules Pages
minimize.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) 2009, 2010, 2011, 2012, 2013, 2014 Laboratoire de
3 // Recherche et Développement de l'Epita (LRDE).
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/ta/ta.hh>
23 #include <spot/ta/tgta.hh>
24 #include <spot/ta/tgtaexplicit.hh>
25
26 namespace spot
27 {
30
31
40
56 SPOT_API ta_explicit_ptr
59 minimize_ta(const const_ta_ptr& ta_);
60
61
62
72 SPOT_API tgta_explicit_ptr
73 minimize_tgta(const const_tgta_explicit_ptr& tgta_);
74
76 }
spot
Definition: graph.hh:33
spot::minimize_ta
ta_explicit_ptr minimize_ta(const const_ta_ptr &ta_)
Construct a simplified TA by merging bisimilar states.
spot::minimize_tgta
tgta_explicit_ptr minimize_tgta(const const_tgta_explicit_ptr &tgta_)
Construct a simplified TGTA by merging bisimilar states.

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.