emptinessta.hh

// -*- coding: utf-8 -*-
// Copyright (C) by the Spot authors, see the AUTHORS file for details.
//
// 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 3 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 this program.  If not, see <http://www.gnu.org/licenses/>.
 
#pragma once
 
#include <spot/ta/taproduct.hh>
#include <spot/misc/optionmap.hh>
#include <spot/twaalgos/emptiness_stats.hh>
#include <stack>
#include <queue>
 
namespace spot
{
 
  namespace
  {
    typedef std::pair<const spot::state*,
                      ta_succ_iterator_product*> pair_state_iter;
  }



  class SPOT_API ta_check : public ec_statistics
  {
    typedef state_map<int> hash_type;
  public:
    ta_check(const const_ta_product_ptr& a, option_map o = option_map());
    virtual
    ~ta_check();

    bool
    check(bool disable_second_pass = false,
          bool disable_heuristic_for_livelock_detection = false);

    bool
    livelock_detection(const const_ta_product_ptr& t);

    std::ostream&
    print_stats(std::ostream& os) const;
 
  protected:
    void
    clear(hash_type& h, std::stack<pair_state_iter> todo, std::queue<
        const spot::state*> init_set);
 
    void
    clear(hash_type& h, std::stack<pair_state_iter> todo,
        spot::ta_succ_iterator* init_states_it);

    bool
    heuristic_livelock_detection(const state * stuttering_succ,
        hash_type& h, int h_livelock_root, std::set<const state*,
            state_ptr_less_than> liveset_curr);
 
    const_ta_product_ptr a_; 
    option_map o_; 
 
    // Force the second pass
    bool is_full_2_pass_;
 
    // scc: a stack of strongly connected components (SCC)
    scc_stack_ta scc;
 
    // sscc: a stack of strongly stuttering-connected components (SSCC)
    scc_stack_ta sscc;
 
  };

 
}