spot 2.15
Loading...
Searching...
No Matches
mc.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 <iostream>
22#include <stdexcept>
23#include <string>
24#include <vector>
25#include <utility>
26
27#include <spot/misc/common.hh>
28
34
35namespace spot
36{
38 enum class SPOT_API mc_algorithm
39 {
42 CNDFS,
43 DEADLOCK,
45 SWARMING,
46 };
47
48 enum class SPOT_API mc_rvalue
49 {
50 DEADLOCK,
51 EMPTY,
52 FAILURE,
54 NOT_EMPTY,
55 SUCCESS,
56 };
57
60 struct SPOT_API ec_stats
61 {
62 std::vector<std::string> name;
63 std::vector<unsigned> walltime;
64 std::vector<unsigned> states;
65 std::vector<unsigned> transitions;
66 std::vector<int> sccs;
67 std::vector<mc_rvalue> value;
68 std::vector<bool> finisher;
69 std::string trace;
70 };
71
72 SPOT_API std::ostream& operator<<(std::ostream& os, const mc_algorithm& ma)
73 {
74 switch (ma)
75 {
77 os << "bloemen_ec"; break;
79 os << "bloemen_scc"; break;
81 os << "cndfs"; break;
83 os << "deadlock"; break;
85 os << "reachability"; break;
87 os << "swarming"; break;
88 }
89 return os;
90 }
91
92 SPOT_API std::ostream& operator<<(std::ostream& os, const mc_rvalue& mr)
93 {
94 switch (mr)
95 {
97 os << "deadlock"; break;
99 os << "empty"; break;
101 os << "failure"; break;
103 os << "no_deadlock"; break;
105 os << "not_empty"; break;
107 os << "success"; break;
108 }
109 return os;
110 }
111
112 SPOT_API std::ostream& operator<<(std::ostream& os, const ec_stats& es)
113 {
114 for (unsigned i = 0; i < es.name.size(); ++i)
115 {
116 os << "---- Thread number:\t" << i << '\n'
117 << " - Algorithm:\t\t" << es.name[i] << '\n'
118 << " - Walltime (ms):\t" << es.walltime[i] <<'\n'
119 << " - States:\t\t" << es.states[i] << '\n'
120 << " - Transitions:\t" << es.transitions[i] << '\n'
121 << " - Result:\t\t" << es.value[i] << '\n'
122 << " - SCCs:\t\t" << es.sccs[i] << '\n';
123
124 os << "CSV: tid,algorithm,walltime,states,transitions,"
125 "sccs,result,finisher\n"
126 << "@th_" << i << ',' << es.name[i] << ',' << es.walltime[i] << ','
127 << es.states[i] << ',' << es.transitions[i] << ','
128 << es.sccs[i] << ',' << es.value[i]
129 << ',' << es.finisher[i] << "\n\n";
130 }
131 return os;
132 }
133
136 SPOT_API const mc_rvalue operator|(const mc_rvalue& lhs, const mc_rvalue& rhs)
137 {
138 // Handle Deadlocks
139 if (lhs == mc_rvalue::DEADLOCK && rhs == mc_rvalue::DEADLOCK)
140 return mc_rvalue::DEADLOCK;
143 if ((lhs == mc_rvalue::DEADLOCK && rhs == mc_rvalue::NO_DEADLOCK) ||
145 return mc_rvalue::DEADLOCK;
146
147 // Handle Emptiness
148 if (lhs == mc_rvalue::EMPTY && rhs == mc_rvalue::EMPTY)
149 return mc_rvalue::EMPTY;
150 if (lhs == mc_rvalue::NOT_EMPTY && rhs == mc_rvalue::NOT_EMPTY)
152 if ((lhs == mc_rvalue::EMPTY && rhs == mc_rvalue::NOT_EMPTY) ||
153 (lhs == mc_rvalue::NOT_EMPTY && rhs == mc_rvalue::EMPTY))
154 return mc_rvalue::EMPTY;
155
156 // Handle Failure / Success
157 if (lhs == mc_rvalue::FAILURE && rhs == mc_rvalue::FAILURE)
158 return mc_rvalue::FAILURE;
159 if (lhs == mc_rvalue::SUCCESS && rhs == mc_rvalue::SUCCESS)
160 return mc_rvalue::SUCCESS;
161 if ((lhs == mc_rvalue::FAILURE && rhs == mc_rvalue::SUCCESS) ||
162 (lhs == mc_rvalue::SUCCESS && rhs == mc_rvalue::FAILURE))
163 return mc_rvalue::FAILURE;
164
165 throw std::runtime_error("Unable to compare these elements!");
166 }
167}
Definition automata.hh:26
mc_algorithm
The list of parallel model-checking algorithms available.
Definition mc.hh:39
@ CNDFS
Evangelista.12.atva emptiness check.
@ REACHABILITY
Only perform a reachability algorithm.
@ SWARMING
Holzmann.11.ieee applied to renault.13.lpar.
@ DEADLOCK
Check wether there is a deadlock.
@ BLOEMEN_SCC
Bloemen.16.ppopp SCC computation.
@ BLOEMEN_EC
Bloemen.16.hvc emptiness check.
mc_rvalue
Definition mc.hh:49
@ NOT_EMPTY
The product is not empty.
@ NO_DEADLOCK
No deadlock has been found.
@ FAILURE
The Algorithm finished abnormally.
@ DEADLOCK
A deadlock has been found.
@ EMPTY
The product is empty.
@ SUCCESS
The Algorithm finished normally.
const mc_rvalue operator|(const mc_rvalue &lhs, const mc_rvalue &rhs)
This function helps to find the output value from a set of threads that may have different values.
Definition mc.hh:136
This structure contains, for each thread, the collected information during the traversal.
Definition mc.hh:61
std::vector< mc_rvalue > value
The return status.
Definition mc.hh:67
std::vector< unsigned > walltime
Walltime for this thread in ms.
Definition mc.hh:63
std::vector< bool > finisher
Is it the finisher thread?
Definition mc.hh:68
std::vector< int > sccs
Number of SCCs or -1.
Definition mc.hh:66
std::vector< unsigned > states
Number of states visited.
Definition mc.hh:64
std::vector< unsigned > transitions
Number of transitions visited.
Definition mc.hh:65
std::vector< std::string > name
The name of the algorithm used.
Definition mc.hh:62
std::string trace
The output trace.
Definition mc.hh:69

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.8