reducform.hh 3.35 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
22
23
24
25
26
27
28
29
30
31
// 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.

#ifndef SPOT_LTLVISIT_REDUCFORM_HH
# define SPOT_LTLVISIT_REDUCFORM_HH

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

namespace spot
{
  namespace ltl
  {
32
33
34
35
36
37
38
39
40

    enum reduce_options
      {
	Reduce_None = 0,
	Reduce_Basics = 1,
	Reduce_Syntactic_Implications = 2,
	Reduce_Eventuality_And_Universality = 4,
	Reduce_All = -1U
      };
41
42
43
44
45
46
47
48
49
50
51

    /// \brief Reduce a formula \a f using Basic rewriting, implies
    /// relation, and class of eventuality and univerality formula.
    ///
    /// Put the formula in negative normal form with
    /// spot::ltl::negative_normal_form and then reduce it according
    /// to options:
    /// Base for spot::ltl::Basic_reduce_form,
    /// Inf for spot::ltl::reduce_inf_form,
    /// EventualUniversal for spot::ltl::reduce_eventuality_universality_form,
    /// BRI for spot::ltl::reduce_form.
52
    formula* reduce(const formula* f, int opt = Reduce_All);
53
54

    /// Implement basic rewriting.
martinez's avatar
martinez committed
55
    formula* basic_reduce_form(const formula* f);
56

57
58
    /// Detect easy case of implies.
    /// True if f1 < f2, false otherwise.
59
    bool inf_form(const formula* f1, const formula* f2);
60
61
62
    /// Detect easy case of implies.
    /// If n = 0, true if !f1 < f2, false otherwise.
    /// If n = 1, true if f1 < !f2, false otherwise.
63
64
    bool infneg_form(const formula* f1, const formula* f2, int n);

65
66
67
    /// \brief Check whether a formula is eventual.
    ///
    /// FIXME: Describe what eventual formulae are.  Cite paper.
martinez's avatar
martinez committed
68
    bool is_eventual(const formula* f);
69
70
71
72

    /// \brief Check whether a formula is universal.
    ///
    /// FIXME: Describe what universal formulae are.  Cite paper.
martinez's avatar
martinez committed
73
74
    bool is_universal(const formula* f);

75
    /// Length of a formula.
76
    int form_length(const formula* f);
77

78
    /// Type the first node of a formula.
martinez's avatar
martinez committed
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
    class node_type_form_visitor : public const_visitor
    {
    public:
      enum type { Atom, Const, Unop, Binop, Multop };
      node_type_form_visitor();
      virtual ~node_type_form_visitor(){};
      type result() const;
      void visit(const atomic_prop* ap);
      void visit(const constant* c);
      void visit(const unop* uo);
      void visit(const binop* bo);
      void visit(const multop* mo);
    protected:
      type result_;
    };
    node_type_form_visitor::type node_type(const formula* f);

96
    /// Whether a formula starts with GF.
97
    bool is_GF(const formula* f);
98
    /// Whether a formula starts with FG.
99
    bool is_FG(const formula* f);
martinez's avatar
martinez committed
100
101
102
103
  }
}

#endif //  SPOT_LTLVISIT_REDUCFORM_HH