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

#ifndef SPOT_KRIPKE_FAIRKRIPKE_HH
# define SPOT_KRIPKE_FAIRKRIPKE_HH

#include "tgba/tgba.hh"
#include "tgba/succiter.hh"

24
25
26
/// \addtogroup kripke Kripke Structures
/// \ingroup tgba

27
28
29
30
namespace spot
{
  class fair_kripke;

31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
  /// \brief Iterator code for a Fair Kripke structure.
  /// \ingroup kripke
  ///
  /// This iterator can be used to simplify the writing
  /// of an iterator on a Fair Kripke structure (or lookalike).
  ///
  /// If you inherit from this iterator, you should only
  /// redefine
  ///
  ///   - fair_kripke_succ_iterator::first()
  ///   - fair_kripke_succ_iterator::next()
  ///   - fair_kripke_succ_iterator::done()
  ///   - fair_kripke_succ_iterator::current_state()
  ///
  /// This class implements fair_kripke_succ_iterator::current_condition(),
  /// and fair_kripke_succ_iterator::current_acceptance_conditions().
47
48
49
  class fair_kripke_succ_iterator : public tgba_succ_iterator
  {
  public:
50
51
52
53
54
55
    /// \brief Constructor
    ///
    /// The \a cond and \a acc_cond arguments will be those returned
    /// by fair_kripke_succ_iterator::current_condition(),
    /// and fair_kripke_succ_iterator::current_acceptance_conditions().
    fair_kripke_succ_iterator(const bdd& cond, const bdd& acc_cond);
56
57
    virtual ~fair_kripke_succ_iterator();

58
    virtual bdd current_condition() const;
59
60
    virtual bdd current_acceptance_conditions() const;
  protected:
61
62
    bdd cond_;
    bdd acc_cond_;
63
64
  };

65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
  /// \brief Interface for a Fair Kripke structure.
  /// \ingroup kripke
  ///
  /// A Kripke structure is a graph in which each node (=state) is
  /// labeled by a conjunction of atomic proposition, and a set of
  /// acceptance conditions.
  ///
  /// Such a structure can be seen as spot::tgba by pushing all labels
  /// to the outgoing transitions.
  ///
  /// A programmer that develops an instance of Fair Kripke structure
  /// needs just provide an implementation for the following methods:
  ///
  ///   - kripke::get_init_state()
  ///   - kripke::succ_iter()
  ///   - kripke::state_condition()
  ///   - kripke::state_acceptance_conditions()
  ///   - kripke::format_state()
  ///   - and optionally kripke::transition_annotation()
  ///
  /// The other methods of the tgba interface are supplied by this
  /// class and need not be defined.
  ///
  /// See also spot::fair_kripke_succ_iterator.
89
90
91
  class fair_kripke : public tgba
  {
  public:
92
93
94
95
96
97
98
99
    /// \brief The condition that label the state \a s.
    ///
    /// This should be a conjunction of atomic propositions.
    virtual bdd state_condition(const state* s) const = 0;

    /// \brief The set of acceptance conditions that label the state \a s.
    virtual bdd state_acceptance_conditions(const state* s) const = 0;

100
101
102
103
104
105
106
107
108
  protected:
    virtual bdd compute_support_conditions(const state* s) const;
    virtual bdd compute_support_variables(const state* s) const;
  };

}


#endif // SPOT_KRIPKE_FAIRKRIPKE_HH