tgtaproduct.hh 2.62 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 24 25

#include "tgba/tgba.hh"
#include "tgba/tgbaproduct.hh"
#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 39 40

    virtual state*
    get_init_state() const;

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

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

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

    virtual
61
    ~tgta_succ_iterator_product();
62 63

    // iteration
64 65 66
    bool first();
    bool next();
    bool done() const;
67 68 69 70 71 72 73

    // inspection
    state_product*
    current_state() const;
    bdd
    current_condition() const;

74
    acc_cond::mark_t
75 76 77 78 79 80 81
    current_acceptance_conditions() const;

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

    void
    next_kripke_dest();

    //@}

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