twagraph.cc 2.63 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// -*- coding: utf-8 -*-
// Copyright (C) 2014 Laboratoire de Recherche et Développement de
// l'Epita.
//
// This file is part of Spot, a model checking library.
//
// Spot is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 3 of the License, or
// (at your option) any later version.
//
// Spot is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
// or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
// License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.


#include <iostream>
22
#include "twa/twagraph.hh"
23
24
25
26
27
#include "tgbaalgos/dotty.hh"
#include "ltlenv/defaultenv.hh"

void f1()
{
28
  auto d = spot::make_bdd_dict();
29
30
31

  auto& e = spot::ltl::default_environment::instance();

32
  auto tg = make_twa_graph(d);
33
34
35

  auto* f1 = e.require("p1");
  auto* f2 = e.require("p2");
36
37
  bdd p1 = bdd_ithvar(d->register_proposition(f1, tg));
  bdd p2 = bdd_ithvar(d->register_proposition(f2, tg));
38
  tg->acc().add_sets(2);
39
40
41
  f1->destroy();
  f2->destroy();

42
43
44
  auto s1 = tg->new_state();
  auto s2 = tg->new_state();
  auto s3 = tg->new_state();
45
46
47
48
49
50
51
  tg->new_transition(s1, s1, bddfalse, 0U);
  tg->new_transition(s1, s2, p1, 0U);
  tg->new_transition(s1, s3, p2, tg->acc().mark(1));
  tg->new_transition(s2, s3, p1 & p2, tg->acc().mark(0));
  tg->new_transition(s3, s1, p1 | p2, tg->acc().marks({0, 1}));
  tg->new_transition(s3, s2, p1 >> p2, 0U);
  tg->new_transition(s3, s3, bddtrue, tg->acc().marks({0, 1}));
52

53
  spot::dotty_reachable(std::cout, tg);
54
55

  {
56
    auto i = tg->get_graph().out_iteraser(s3);
57
58
59
60
    ++i;
    i.erase();
    i.erase();
    assert(!i);
61
    spot::dotty_reachable(std::cout, tg);
62
63
64
  }

  {
65
    auto i = tg->get_graph().out_iteraser(s3);
66
67
    i.erase();
    assert(!i);
68
    spot::dotty_reachable(std::cout, tg);
69
70
  }

71
72
73
74
  auto all = tg->acc().marks({0, 1});
  tg->new_transition(s3, s1, p1 | p2, all);
  tg->new_transition(s3, s2, p1 >> p2, 0U);
  tg->new_transition(s3, s1, bddtrue, all);
75

76
77
  std::cerr << tg->num_transitions() << '\n';
  assert(tg->num_transitions() == 7);
78

79
80
81
  spot::dotty_reachable(std::cout, tg);
  tg->merge_transitions();
  spot::dotty_reachable(std::cout, tg);
82

83
84
  std::cerr << tg->num_transitions() << '\n';
  assert(tg->num_transitions() == 5);
85
86
87

  // Add enough states so that the state vector is reallocated.
  for (unsigned i = 0; i < 100; ++i)
88
89
    tg->new_state();
  spot::dotty_reachable(std::cout, tg);
90
91
92
93
94
95
}

int main()
{
  f1();
}