Main Page | Namespace List | Class Hierarchy | Class List | File List | Namespace Members | Class Members

emptinesscheck.hh

Go to the documentation of this file.
00001 // Copyright (C) 2003  Laboratoire d'Informatique de Paris 6 (LIP6),
00002 // département Systèmes Répartis Coopératifs (SRC), Université Pierre
00003 // et Marie Curie.
00004 //
00005 // This file is part of Spot, a model checking library.
00006 //
00007 // Spot is free software; you can redistribute it and/or modify it
00008 // under the terms of the GNU General Public License as published by
00009 // the Free Software Foundation; either version 2 of the License, or
00010 // (at your option) any later version.
00011 //
00012 // Spot is distributed in the hope that it will be useful, but WITHOUT
00013 // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
00014 // or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
00015 // License for more details.
00016 //
00017 // You should have received a copy of the GNU General Public License
00018 // along with Spot; see the file COPYING.  If not, write to the Free
00019 // Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
00020 // 02111-1307, USA.
00021 
00022 #ifndef SPOT_EMPTINESS_CHECK_HH
00023 # define SPOT_EMPTINESS_CHECK_HH
00024 
00025 #include "tgba/tgba.hh"
00026 #include "misc/hash.hh"
00027 #include <stack>
00028 #include <list>
00029 #include <utility>
00030 #include <iostream>
00031 
00032 namespace spot
00033 {
00034 
00055   class emptiness_check
00056   {
00057     typedef std::list<const state*> state_sequence;
00058     typedef std::pair<const state*, bdd> state_proposition;
00059     typedef std::list<state_proposition> cycle_path;
00060   public:
00061     emptiness_check(const tgba* a);
00062     ~emptiness_check();
00063 
00066     bool check();
00067 
00069     void counter_example();
00070 
00071     std::ostream& print_result(std::ostream& os,
00072                                const tgba* restrict = 0) const;
00073 
00074   private:
00075 
00076     struct connected_component
00077     {
00078       // During the Depth path we keep the connected component that we met.
00079     public:
00080       connected_component(int index = -1);
00081 
00082       int index;
00085       bdd condition;
00086     };
00087 
00088     struct connected_component_set: public connected_component
00089     {
00090       typedef Sgi::hash_set<const state*,
00091                             state_ptr_hash, state_ptr_equal> set_type;
00094       set_type states;
00095 
00097       bool has_state(const state* s) const;
00098     };
00099 
00100     const tgba* aut_;
00101     std::stack<connected_component> root;
00102     state_sequence suffix;
00103     cycle_path period;
00104 
00105     typedef Sgi::hash_map<const state*, int,
00106                           state_ptr_hash, state_ptr_equal> hash_type;
00107     hash_type h;                
00108 
00114     const state* h_filt(const state* s) const;
00115 
00121     void remove_component(const state* start_delete);
00122 
00125     void accepting_path (const connected_component_set& scc,
00126                          const state* start, bdd acc_to_traverse);
00127 
00130     void complete_cycle(const connected_component_set& scc,
00131                         const state* from, const state* to);
00132   };
00133 }
00134 #endif // SPOT_EMPTINESS_CHECK_HH

Generated on Mon Dec 1 11:33:53 2003 for spot by doxygen 1.3.4