sccfilter.hh 3.55 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
// Copyright (C) 2009, 2010, 2012, 2013, 2014 Laboratoire de Recherche et
3
// Developpement de l'Epita (LRDE).
4
5
6
7
8
//
// 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
9
// the Free Software Foundation; either version 3 of the License, or
10
11
12
13
14
15
16
17
// (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
18
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
19
20
21
22

#ifndef SPOT_TGBAALGOS_SCCFILTER_HH
# define SPOT_TGBAALGOS_SCCFILTER_HH

23
24
#include "misc/common.hh"
#include <bdd.h>
25
26
27

namespace spot
{
28
  class scc_map;
29
30
31
32
  class tgba;
  class tgba_digraph;
  class scc_info;

33

34
35
36
  /// \brief Prune unaccepting SCCs and remove superfluous acceptance
  /// conditions.
  ///
37
38
39
  /// This function will explore the SCCs of the automaton and remove
  /// dead SCCs (i.e. SCC that are not accepting, and those with no
  /// exit path leading to an accepting SCC).
40
41
42
  ///
  /// Additionally, this will try to remove useless acceptance
  /// conditions.  This operation may diminish the number of
43
44
45
46
  /// acceptance condition of the automaton (for instance when two
  /// acceptance conditions are always used together we only keep one)
  /// but it will never remove all acceptance conditions, even if it
  /// would be OK to have zero.
47
48
49
50
51
52
  ///
  /// Acceptance conditions on transitions going to non-accepting SCC
  /// are all removed.  Acceptance conditions going to an accepting
  /// SCC and coming from another SCC are only removed if \a
  /// remove_all_useless is set.  The default value of \a
  /// remove_all_useless is \c false because some algorithms (like the
53
  /// degeneralization) will work better if transitions going to an
54
  /// accepting SCC are accepting.
55
56
57
58
59
60
61
62
63
64
  ///
  /// If \a given_sm is supplied, the function will use its result
  /// without computing a map of its own.
  ///
  /// If \a susp is different from bddtrue, it should be a conjunction
  /// of (positive) variables to be removed from transitions going to
  /// non-accepting SCCs.  If early_susp is false, the previous
  /// variable are also removed from transitions entering an accepting
  /// SCC.  ignored is a conjunction of positive variables that should
  /// be removed everywhere.
65
66
67
68
69
  ///
  /// \warning Calling scc_filter on a TGBA that has the SBA property
  /// (i.e., transitions leaving accepting states are all marked as
  /// accepting) may destroy this property.  Use scc_filter_states()
  /// instead.
70
71
72
73
  SPOT_API tgba*
  scc_filter(const tgba* aut, bool remove_all_useless = false,
	     scc_map* given_sm = 0, bdd susp = bddtrue,
	     bool early_susp = false, bdd ignored = bddtrue);
74

75
76
77
78
79
80
81
82
  /// \brief Prune unaccepting SCCs.
  ///
  /// This is an abridged version of scc_filter(), that only remove
  /// useless states, without touching at the acceptance conditions.
  ///
  /// Especially, if the input TGBA has the SBA property, (i.e.,
  /// transitions leaving accepting states are all marked as
  /// accepting), then the output TGBA will also have that property.
83
  /// @{
84
85
  SPOT_API tgba*
  scc_filter_states(const tgba* aut, scc_map* given_sm = 0);
86
87
88
89

  SPOT_API tgba_digraph*
  scc_filter_states(const tgba_digraph* aut, scc_info* given_si = 0);
  /// @}
90
91
92
}

#endif // SPOT_TGBAALGOS_SCC_HH