spot  2.16
contain.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) by the Spot authors, see the AUTHORS file for details.
3 //
4 // This file is part of Spot, a model checking library.
5 //
6 // Spot is free software; you can redistribute it and/or modify it
7 // under the terms of the GNU General Public License as published by
8 // the Free Software Foundation; either version 3 of the License, or
9 // (at your option) any later version.
10 //
11 // Spot is distributed in the hope that it will be useful, but WITHOUT
12 // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
13 // or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
14 // License for more details.
15 //
16 // You should have received a copy of the GNU General Public License
17 // along with this program. If not, see <http://www.gnu.org/licenses/>.
18 
19 #pragma once
20 
21 #include <spot/tl/formula.hh>
22 #include <spot/twa/bdddict.hh>
23 #include <spot/twaalgos/powerset.hh>
24 
25 namespace spot
26 {
27  class tl_simplifier_cache;
28 
32  {
33  struct record_;
34  struct trans_map_;
35  public:
39  bool exprop = false,
40  bool symb_merge = true,
41  bool branching_postponement = false,
42  bool fair_loop_approx = false,
43  unsigned max_states = 0U);
44 
46 
48  void clear();
49 
56 
58  bool equal(formula l, formula g);
59 
60  protected:
62  bool incompatible_(record_* l, record_* g);
63 
66 
67  /* Translation options */
69  bool exprop_;
70  bool symb_merge_;
73  /* Translation Maps */
74  trans_map_* translated_;
75  tl_simplifier_cache* c_;
77  std::unique_ptr<const output_aborter> aborter_ = nullptr;
78  };
79 }
Main class for temporal logic formula.
Definition: formula.hh:847
Definition: contain.hh:32
tl_simplifier_cache * c_
Definition: contain.hh:75
void clear()
Clear the cache.
trans_map_ * translated_
Translation cache.
Definition: contain.hh:74
bool fair_loop_approx_
Approximate fair loops.
Definition: contain.hh:72
record_ * register_formula_(formula f)
Register a formula in the translation cache.
bool contained(formula l, formula g)
Check whether L(l) is a subset of L(g).
bool branching_postponement_
Postpone branching choices.
Definition: contain.hh:71
bool exprop_
Use existential properties.
Definition: contain.hh:69
bool contained_neg(formula l, formula g)
Check whether L(l) is a subset of L(!g).
bool neg_contained(formula l, formula g)
Check whether L(!l) is a subset of L(g).
bool incompatible_(record_ *l, record_ *g)
Test whether two cached formulas are incompatible.
bool equal(formula l, formula g)
Check whether L(l) = L(g).
bdd_dict_ptr dict_
Dictionary used for translations.
Definition: contain.hh:68
language_containment_checker(bdd_dict_ptr dict=make_bdd_dict(), bool exprop=false, bool symb_merge=true, bool branching_postponement=false, bool fair_loop_approx=false, unsigned max_states=0U)
bool symb_merge_
Merge symbolic states.
Definition: contain.hh:70
LTL/PSL formula interface.
bdd_dict_ptr make_bdd_dict()
Create a new, empty bdd_dict wrapped in a shared pointer.
Definition: bdddict.hh:308
std::shared_ptr< bdd_dict > bdd_dict_ptr
Shared pointer to a bdd_dict.
Definition: bdddict.hh:304
Definition: automata.hh:26

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Fri Feb 27 2015 10:00:07 for spot by doxygen 1.9.1