spot 2.3.1

- Main Page
- Related Pages
- Modules
- Classes
- Files

- File List

All Classes Files Functions Variables Typedefs Enumerations Enumerator Friends Modules Pages
emptinessta.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) 2008, 2012, 2013, 2014, 2016 Laboratoire de Recherche
3 // et Dévelopment de l'Epita (LRDE).
4 // Copyright (C) 2003, 2004, 2005, 2006 Laboratoire d'Informatique de
5 // Paris 6 (LIP6), département Systèmes Répartis Coopératifs (SRC),
6 // Université Pierre et Marie Curie.
7 //
8 // This file is part of Spot, a model checking library.
9 //
10 // Spot is free software; you can redistribute it and/or modify it
11 // under the terms of the GNU General Public License as published by
12 // the Free Software Foundation; either version 3 of the License, or
13 // (at your option) any later version.
14 //
15 // Spot is distributed in the hope that it will be useful, but WITHOUT
16 // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
17 // or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
18 // License for more details.
19 //
20 // You should have received a copy of the GNU General Public License
21 // along with this program. If not, see <http://www.gnu.org/licenses/>.
22
23 #pragma once
24
25 #include <spot/ta/taproduct.hh>
26 #include <spot/misc/optionmap.hh>
27 #include <spot/twaalgos/emptiness_stats.hh>
28 #include <stack>
29 #include <queue>
30
31 namespace spot
32 {
33
34 namespace
35 {
36 typedef std::pair<const spot::state*,
37 ta_succ_iterator_product*> pair_state_iter;
38 }
39
52
65
87 class SPOT_API ta_check : public ec_statistics
88 {
89 typedef state_map<int> hash_type;
90 public:
91 ta_check(const const_ta_product_ptr& a, option_map o = option_map());
92 virtual
93 ~ta_check();
94
112 bool
113 check(bool disable_second_pass = false,
114 bool disable_heuristic_for_livelock_detection = false);
115
120 bool
121 livelock_detection(const const_ta_product_ptr& t);
122
124 std::ostream&
125 print_stats(std::ostream& os) const;
126
127 protected:
128 void
129 clear(hash_type& h, std::stack<pair_state_iter> todo, std::queue<
130 const spot::state*> init_set);
131
132 void
133 clear(hash_type& h, std::stack<pair_state_iter> todo,
134 spot::ta_succ_iterator* init_states_it);
135
138 bool
139 heuristic_livelock_detection(const state * stuttering_succ,
140 hash_type& h, int h_livelock_root, std::set<const state*,
141 state_ptr_less_than> liveset_curr);
142
143 const_ta_product_ptr a_;
144 option_map o_;
145
146 // Force the second pass
147 bool is_full_2_pass_;
148
149 // scc: a stack of strongly connected components (SCC)
150 scc_stack_ta scc;
151
152 // sscc: a stack of strongly stuttering-connected components (SSCC)
153 scc_stack_ta sscc;
154
155 };
156
158
161 }
spot
Definition: graph.hh:33
spot::ec_statistics
Emptiness-check statistics.
Definition: emptiness_stats.hh:121
spot::option_map
Manage a map of options.
Definition: optionmap.hh:37
spot::scc_stack_ta
Definition: ta.hh:208
spot::state
Abstract class for states.
Definition: twa.hh:50
spot::ta_check::a_
const_ta_product_ptr a_
The automaton.
Definition: emptinessta.hh:143
spot::ta_check
An implementation of the emptiness-check algorithm for a product between a TA and a Kripke structure...
Definition: emptinessta.hh:87
spot::ta_check::o_
option_map o_
The options.
Definition: emptinessta.hh:144
spot::ta_succ_iterator
Iterate over the successors of a state.
Definition: ta.hh:197
spot::state_ptr_less_than
Strict Weak Ordering for state*.
Definition: twa.hh:127

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.