e764cf6f3b
* spot/twa/twagraph.cc, spot/twa/twagraph.hh, tests/core/tgbagraph.test, tests/core/twagraph.cc, NEWS: here.
112 lines
3 KiB
C++
112 lines
3 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2014, 2015, 2016 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>
|
|
#include <spot/twa/twagraph.hh>
|
|
#include <spot/twaalgos/dot.hh>
|
|
#include <spot/tl/defaultenv.hh>
|
|
|
|
static void f1()
|
|
{
|
|
auto d = spot::make_bdd_dict();
|
|
auto tg = make_twa_graph(d);
|
|
bdd p1 = bdd_ithvar(tg->register_ap("p1"));
|
|
bdd p2 = bdd_ithvar(tg->register_ap("p2"));
|
|
tg->acc().add_sets(2);
|
|
|
|
for (auto f: tg->ap())
|
|
std::cout << f.ap_name() << '\n';
|
|
|
|
auto s1 = tg->new_state();
|
|
auto s2 = tg->new_state();
|
|
auto s3 = tg->new_state();
|
|
tg->new_edge(s1, s1, bddfalse, 0U);
|
|
tg->new_edge(s1, s2, p1, 0U);
|
|
tg->new_edge(s1, s3, p2, tg->acc().mark(1));
|
|
tg->new_edge(s2, s3, p1 & p2, tg->acc().mark(0));
|
|
tg->new_edge(s3, s1, p1 | p2, spot::acc_cond::mark_t({0, 1}));
|
|
tg->new_edge(s3, s2, p1 >> p2, 0U);
|
|
tg->new_edge(s3, s3, bddtrue, spot::acc_cond::mark_t({0, 1}));
|
|
|
|
spot::print_dot(std::cout, tg);
|
|
|
|
{
|
|
auto i = tg->get_graph().out_iteraser(s3);
|
|
++i;
|
|
i.erase();
|
|
i.erase();
|
|
assert(!i);
|
|
spot::print_dot(std::cout, tg);
|
|
}
|
|
|
|
{
|
|
auto i = tg->get_graph().out_iteraser(s3);
|
|
i.erase();
|
|
assert(!i);
|
|
spot::print_dot(std::cout, tg);
|
|
}
|
|
|
|
spot::acc_cond::mark_t all({0, 1});
|
|
tg->new_edge(s3, s1, p1 | p2, all);
|
|
tg->new_edge(s3, s2, p1 >> p2, 0U);
|
|
tg->new_edge(s3, s1, bddtrue, all);
|
|
|
|
std::cerr << tg->num_edges() << '\n';
|
|
assert(tg->num_edges() == 7);
|
|
|
|
spot::print_dot(std::cout, tg);
|
|
tg->merge_edges();
|
|
spot::print_dot(std::cout, tg);
|
|
|
|
std::cerr << tg->num_edges() << '\n';
|
|
assert(tg->num_edges() == 5);
|
|
|
|
// Add enough states so that the state vector is reallocated.
|
|
for (unsigned i = 0; i < 100; ++i)
|
|
tg->new_state();
|
|
spot::print_dot(std::cout, tg);
|
|
}
|
|
|
|
// Test purge with named states.
|
|
static void f2()
|
|
{
|
|
auto d = spot::make_bdd_dict();
|
|
auto tg = make_twa_graph(d);
|
|
|
|
auto s1 = tg->new_state();
|
|
auto s2 = tg->new_state();
|
|
auto s3 = tg->new_state();
|
|
(void) s1;
|
|
(void) s2;
|
|
std::vector<std::string>* names;
|
|
names = new std::vector<std::string>({"s1", "s2", "s3"});
|
|
|
|
tg->set_named_prop<std::vector<std::string>>("state-names", names);
|
|
tg->set_init_state(s3);
|
|
spot::print_dot(std::cout, tg);
|
|
tg->purge_unreachable_states();
|
|
spot::print_dot(std::cout, tg);
|
|
}
|
|
|
|
int main()
|
|
{
|
|
f1();
|
|
f2();
|
|
}
|