spot 2.12.2
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
25namespace spot
26{
27 class tl_simplifier_cache;
28
31 {
32 struct record_;
33 struct trans_map_;
34 public:
37 language_containment_checker(bdd_dict_ptr dict = make_bdd_dict(),
38 bool exprop = false,
39 bool symb_merge = true,
40 bool branching_postponement = false,
41 bool fair_loop_approx = false,
42 unsigned max_states = 0U);
43
45
47 void clear();
48
55
57 bool equal(formula l, formula g);
58
59 protected:
60 bool incompatible_(record_* l, record_* g);
61
62 record_* register_formula_(formula f);
63
64 /* Translation options */
65 bdd_dict_ptr dict_;
66 bool exprop_;
67 bool symb_merge_;
68 bool branching_postponement_;
69 bool fair_loop_approx_;
70 /* Translation Maps */
71 trans_map_* translated_;
72 tl_simplifier_cache* c_;
73 std::unique_ptr<const output_aborter> aborter_ = nullptr;
74 };
75}
Main class for temporal logic formula.
Definition: formula.hh:732
Check containment between LTL formulae.
Definition: contain.hh:31
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: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.4