tgtaproduct.hh 2.57 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
3
// Copyright (C) 2011, 2012, 2013, 2014 Laboratoire de Recherche et
// Développement 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
#pragma once
21

22
23
#include "twa/twa.hh"
#include "twa/twaproduct.hh"
24
25
#include "misc/fixpool.hh"
#include "kripke/kripke.hh"
26
#include "tgta.hh"
27
28
29
30
31

namespace spot
{

  /// \brief A lazy product.  (States are computed on the fly.)
32
  class SPOT_API tgta_product : public twa_product
33
34
  {
  public:
35
36
    tgta_product(const const_kripke_ptr& left,
		 const const_tgta_ptr& right);
37

38
    virtual const state* get_init_state() const;
39

40
    virtual twa_succ_iterator*
41
    succ_iter(const state* local_state) const;
42
43
  };

44
  inline twa_ptr product(const const_kripke_ptr& left,
45
46
47
48
49
			  const const_tgta_ptr& right)
  {
    return std::make_shared<tgta_product>(left, right);
  }

50
  /// \brief Iterate over the successors of a product computed on the fly.
51
  class SPOT_API tgta_succ_iterator_product : public twa_succ_iterator
52
53
  {
  public:
54
55
56
57
    tgta_succ_iterator_product(const state_product* s,
			       const const_kripke_ptr& k,
			       const const_tgta_ptr& tgta,
			       fixed_size_pool* pool);
58
59

    virtual
60
    ~tgta_succ_iterator_product();
61
62

    // iteration
63
64
65
    bool first();
    bool next();
    bool done() const;
66
67
68

    // inspection
    state_product*
69
    dst() const;
70
    bdd
71
    cond() const;
72

73
    acc_cond::mark_t
74
    acc() const;
75
76
77
78
79
80

  private:
    //@{
    /// Internal routines to advance to the next successor.
    void
    step_();
81
    bool find_next_succ_();
82
83
84
85
86
87
88
89

    void
    next_kripke_dest();

    //@}

  protected:
    const state_product* source_;
90
91
    const_tgta_ptr tgta_;
    const_kripke_ptr kripke_;
92
    fixed_size_pool* pool_;
93
94
    twa_succ_iterator* tgta_succ_it_;
    twa_succ_iterator* kripke_succ_it_;
95
96
    state_product* current_state_;
    bdd current_condition_;
97
    acc_cond::mark_t current_acceptance_conditions_;
98
    bdd kripke_source_condition;
99
    const state* kripke_current_dest_state;
100
101
  };
}