spot  2.11.6
contain.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) 2011-2016, 2019, 2020 Laboratoire de Recherche
3 // et Développement de l'Epita (LRDE).
4 // Copyright (C) 2006 Laboratoire d'Informatique de Paris 6 (LIP6),
5 // département Systèmes Répartis Coopératifs (SRC), Université Pierre
6 // 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/tl/formula.hh>
26 #include <spot/twa/bdddict.hh>
27 #include <spot/twaalgos/powerset.hh>
28 
29 namespace spot
30 {
31  class tl_simplifier_cache;
32 
35  {
36  struct record_;
37  struct trans_map_;
38  public:
41  language_containment_checker(bdd_dict_ptr dict = make_bdd_dict(),
42  bool exprop = false,
43  bool symb_merge = true,
44  bool branching_postponement = false,
45  bool fair_loop_approx = false,
46  unsigned max_states = 0U);
47 
49 
51  void clear();
52 
59 
61  bool equal(formula l, formula g);
62 
63  protected:
64  bool incompatible_(record_* l, record_* g);
65 
66  record_* register_formula_(formula f);
67 
68  /* Translation options */
69  bdd_dict_ptr dict_;
70  bool exprop_;
71  bool symb_merge_;
72  bool branching_postponement_;
73  bool fair_loop_approx_;
74  /* Translation Maps */
75  trans_map_* translated_;
76  tl_simplifier_cache* c_;
77  std::unique_ptr<const output_aborter> aborter_ = nullptr;
78  };
79 }
Main class for temporal logic formula.
Definition: formula.hh:717
Check containment between LTL formulae.
Definition: contain.hh:35
void clear()
Clear the cache.
bool contained(formula l, formula g)
Check whether L(l) is a subset of L(g).
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 equal(formula l, formula g)
Check whether L(l) = L(g).
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)
LTL/PSL formula interface.
Definition: automata.hh:27

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