reduce.hh 3.51 KB
Newer Older
1
// Copyright (C) 2004  Laboratoire d'Informatique de Paris 6 (LIP6),
martinez's avatar
martinez committed
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
// et Marie Curie.
//
// 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 2 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 Spot; see the file COPYING.  If not, write to the Free
// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
// 02111-1307, USA.

22
23
#ifndef SPOT_LTLVISIT_REDUCE_HH
# define SPOT_LTLVISIT_REDUCE_HH
martinez's avatar
martinez committed
24
25
26
27
28
29
30
31

#include "ltlast/formula.hh"
#include "ltlast/visitor.hh"

namespace spot
{
  namespace ltl
  {
32

33
34
35
    /// \addtogroup ltl_rewriting
    /// @{

36
    /// Options for spot::ltl::reduce.
37
38
    enum reduce_options
      {
39
	/// No reduction.
40
	Reduce_None = 0,
41
	/// Basic reductions.
42
	Reduce_Basics = 1,
43
	/// Somenzi & Bloem syntactic implication.
44
	Reduce_Syntactic_Implications = 2,
45
	/// Etessami & Holzmann eventuality and universality reductions.
46
	Reduce_Eventuality_And_Universality = 4,
47
	/// All reductions.
48
49
	Reduce_All = -1U
      };
50

51
    /// \brief Reduce a formula \a f.
52
    ///
53
54
    /// \param f the formula to reduce
    /// \param opt a conjonction of spot::ltl::reduce_options specifying
55
    ///            which optimizations to apply.
56
    /// \return the reduced formula
57
    formula* reduce(const formula* f, int opt = Reduce_All);
58
    /// @}
59

60
    /// \brief Check whether a formula is a pure eventuality.
61
    /// \ingroup ltl_misc
62
    ///
63
    /// Pure eventuality formulae are defined in
64
65
66
67
68
69
70
71
72
73
74
    /// \verbatim
    /// @InProceedings{	  etessami.00.concur,
    /// author  	= {Kousha Etessami and Gerard J. Holzmann},
    /// title		= {Optimizing {B\"u}chi Automata},
    /// booktitle	= {Proceedings of the 11th International Conference on
    /// 		  Concurrency Theory (Concur'2000)},
    /// pages		= {153--167},
    /// year		= {2000},
    /// editor  	= {C. Palamidessi},
    /// volume  	= {1877},
    /// series  	= {Lecture Notes in Computer Science},
75
    /// publisher	= {Springer-Verlag}
76
77
    /// }
    /// \endverbatim
78
79
80
    ///
    /// A word that satisfies a pure eventuality can be prefixed by
    /// anything and still satisfies the formula.
martinez's avatar
martinez committed
81
    bool is_eventual(const formula* f);
82

83
    /// \brief Check whether a formula is purely universal.
84
    /// \ingroup ltl_misc
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
    ///
    /// Purely universal formulae are defined in
    /// \verbatim
    /// @InProceedings{	  etessami.00.concur,
    /// author  	= {Kousha Etessami and Gerard J. Holzmann},
    /// title		= {Optimizing {B\"u}chi Automata},
    /// booktitle	= {Proceedings of the 11th International Conference on
    /// 		  Concurrency Theory (Concur'2000)},
    /// pages		= {153--167},
    /// year		= {2000},
    /// editor  	= {C. Palamidessi},
    /// volume  	= {1877},
    /// series  	= {Lecture Notes in Computer Science},
    /// publisher	= {Springer-Verlag}
    /// }
    /// \endverbatim
101
    ///
102
103
    /// Any (non-empty) suffix of a word that satisfies if purely
    /// universal formula also satisfies the formula.
martinez's avatar
martinez committed
104
105
106
107
    bool is_universal(const formula* f);
  }
}

108
#endif //  SPOT_LTLVISIT_REDUCE_HH