// Copyright (C) 2004 Laboratoire d'Informatique de Paris 6 (LIP6), // 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_TGBAALGOS_TARJAN_ON_FLY_HH # define SPOT_TGBAALGOS_TARJAN_ON_FLY_HH #include "misc/hash.hh" #include #include #include #include "tgba/tgbatba.hh" namespace spot { class tarjan_on_fly { public: tarjan_on_fly(const tgba_tba_proxy *a); virtual ~tarjan_on_fly(); /// \brief Return true if there exits an accepting path. bool check(); /// \brief Print Stat. std::ostream& print_stat(std::ostream& os) const; private: struct struct_state { const state* s; tgba_succ_iterator* lasttr; int lowlink; int pre; int acc; }; //typedef std::pair state_iter_pair; typedef Sgi::hash_map hash_type; hash_type h; ///< Map of visited states. typedef std::vector stack_type; stack_type stack; ///< Stack of visited states on the path. const tgba_tba_proxy* a; ///< The automata to check. int top; int dftop; bool violation; const state* x; void push(const state* s); void pop(); void lowlinkupdate(int f, int t); int in_stack(const state* s) const; }; } #endif // SPOT_TGBAALGOS_MINIMALCE_HH