File: linearization_instantation_compare_test.cpp

package info (click to toggle)
mcrl2 201409.0-1
  • links: PTS, VCS
  • area: main
  • in suites: buster, jessie, jessie-kfreebsd
  • size: 46,348 kB
  • ctags: 29,960
  • sloc: cpp: 213,160; ansic: 16,219; python: 13,238; yacc: 309; lex: 214; xml: 197; makefile: 83; sh: 82; pascal: 17
file content (158 lines) | stat: -rwxr-xr-x 4,764 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
// Author(s): Wieger Wesselink, Jan Friso Groote
// Copyright: see the accompanying file COPYING or copy at
// https://svn.win.tue.nl/trac/MCRL2/browser/trunk/COPYING
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
/// \file linearization_test.cpp
/// \brief Add your file description here.

#include <iostream>
#include <string>

#include <boost/test/included/unit_test_framework.hpp>

#include "mcrl2/lps/linearise.h"
#include "mcrl2/lts/detail/exploration.h"
#include "mcrl2/lts/lts_aut.h"
#include "mcrl2/lts/lts_algorithm.h"

#include "mcrl2/utilities/logger.h"
#include "mcrl2/utilities/test_utilities.h"

using namespace mcrl2;
using namespace mcrl2::lps;

typedef data::rewriter::strategy rewrite_strategy;
typedef std::vector<rewrite_strategy> rewrite_strategy_vector;

template <class LTS_TYPE>
inline
LTS_TYPE translate_lps_to_lts(lps::specification const& specification)
{
  lts::lts_generation_options options;
  options.trace_prefix = "linearization_instantiation_compare_test";
  options.specification = specification;
  options.lts = utilities::temporary_filename("linearization_instantiation_compare_test_file");

  LTS_TYPE result;
  options.outformat = result.type();
  lts::lps2lts_algorithm lps2lts;
  lps2lts.initialise_lts_generation(&options);
  lps2lts.generate_lts();
  lps2lts.finalise_lts_generation();

  result.load(options.lts);
  remove(options.lts.c_str()); // Clean up after ourselves
  return result;
}

static
void run_linearisation_instance(const std::string& spec, const t_lin_options& options, const lts::lts_aut_t& expected_statespace)
{
  std::clog << "  Linearisation method " << options.lin_method << std::endl
            << "    rewrite strategy: " << options.rewrite_strategy << std::endl
            << "    binary: " << std::boolalpha << options.binary << std::endl
            << "    nocluster: " << std::boolalpha << options.no_intermediate_cluster << std::endl;

  lps::specification s = linearise(spec, options);
  BOOST_CHECK(s != lps::specification());

  lts::lts_aut_t result = translate_lps_to_lts<lts::lts_aut_t>(s);
  BOOST_CHECK(lts::compare(result, expected_statespace, lts::lts_eq_bisim));
}

static
void run_linearisation_test_case(const std::string& spec, const lts::lts_aut_t& expected_statespace)
{
  // Set various rewrite strategies
  rewrite_strategy_vector rewrite_strategies = utilities::get_test_rewrite_strategies(false);

  for (rewrite_strategy_vector::const_iterator i = rewrite_strategies.begin(); i != rewrite_strategies.end(); ++i)
  {
    t_lin_options options;
    options.rewrite_strategy=*i;

    run_linearisation_instance(spec, options, expected_statespace);

    options.lin_method=lmRegular2;
    run_linearisation_instance(spec, options, expected_statespace);

    options.lin_method=lmStack;
    run_linearisation_instance(spec, options, expected_statespace);

    options.binary=true;
    run_linearisation_instance(spec, options, expected_statespace);

    options.lin_method=lmRegular;
    run_linearisation_instance(spec, options, expected_statespace);

    options.binary=false; // reset binary
    options.no_intermediate_cluster=true;
    run_linearisation_instance(spec, options, expected_statespace);
  }
}

BOOST_AUTO_TEST_CASE(bad_renaming_non_bisimilar)
{
  const std::string spec =
      "sort D = struct d1;\n"
      "act a, b;\n"
      "proc\n"
      "P(p:D) = a. Q(p);\n"
      "Q(q:D) = sum l:List(D). (#l<=1) ->\n"
      "             b.\n"
      "            (([] == l) -> P(q) <>  Q());\n"
      "init P(d1);\n";

  const std::string expected_statespace =
      "des (0,6,4)\n"
      "(0,\"a\",1)\n"
      "(1,\"b\",2)\n"
      "(1,\"b\",3)\n"
      "(2,\"a\",1)\n"
      "(3,\"b\",2)\n"
      "(3,\"b\",3)\n";
  std::stringstream is(expected_statespace);

  lts::lts_aut_t statespace;
  statespace.load(is);
  run_linearisation_test_case(spec,statespace);
}


BOOST_AUTO_TEST_CASE(where_clauses_in_conditions_of_rewrite_rules)
{
  const std::string spec =
      "act a:Bool;\n"
      "\n"
      "map is_null:List(Bool) -> Bool;\n"
      "\n"
      "var  L:List(Bool);\n"
      "eqn  (n>0 whr n=#L end) -> is_null(L)=false;\n"
      "     (n==0 whr n=#L end) -> is_null(L)= true;\n"
      "\n"
      "proc X(L:List(Bool))=a(is_null(L)).X([true]);\n"
      "init X([]);\n";

  const std::string expected_statespace =
      "des (0,2,2)\n"
      "(0,\"a(true)\",1)\n"
      "(1,\"a(false)\",1)\n";

  std::stringstream is(expected_statespace);

  lts::lts_aut_t statespace;
  statespace.load(is);
  run_linearisation_test_case(spec,statespace);
}



boost::unit_test::test_suite* init_unit_test_suite(int argc, char* argv[])
{
  return 0;
}