alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Fix verbatim blocks of Doxygen comments.

Browse source 
* src/ltlast/formula.hh, src/ltlvisit/contain.hh,
src/ltlvisit/randomltl.hh, src/ltlvisit/reduce.hh,
src/ltlvisit/remove_x.hh, src/ltlvisit/simplify.hh, src/ltlvisit/snf.hh,
src/misc/minato.hh, src/misc/optionmap.hh,
src/saba/sabacomplementtgba.hh, src/taalgos/emptinessta.hh,
src/taalgos/minimize.hh, src/taalgos/tgba2ta.hh,
src/tgba/tgbakvcomplement.hh, src/tgbaalgos/cycles.hh,
src/tgbaalgos/eltl2tgba_lacim.hh, src/tgbaalgos/gtec/gtec.hh,
src/tgbaalgos/gv04.hh, src/tgbaalgos/ltl2taa.hh,
src/tgbaalgos/ltl2tgba_fm.hh, src/tgbaalgos/ltl2tgba_lacim.hh,
src/tgbaalgos/magic.hh, src/tgbaalgos/minimize.hh,
src/tgbaalgos/randomgraph.hh, src/tgbaalgos/se05.hh,
src/tgbaalgos/simulation.hh, src/tgbaalgos/tau03.hh,
src/tgbaalgos/tau03opt.hh: Surround verbatim blocks with /** ... */
instead of using /// on each line.  Otherwise Doxygen will output the
leading "///" tokens -- apparently this is a feature.
* src/sanity/style.test: Strip multi-line comments before checking
code style.
This commit is contained in:
Alexandre Duret-Lutz 2013-06-08 23:43:16 +02:00
parent 1ec9cebe58
commit 1cd9b204ed
29 changed files with 758 additions and 745 deletions
Download patch file Download diff file Expand all files Collapse all files

98
src/tgbaalgos/tau03opt.hh
View file

@ -37,55 +37,55 @@ namespace spot
/// During the visit of \a a, the returned checker stores explicitely all
/// the traversed states. The implemented algorithm is the following:
///
/// \verbatim
/// procedure check ()
/// begin
/// weight = 0; // the null vector
/// call dfs_blue(s0);
/// end;
///
/// procedure dfs_blue (s)
/// begin
/// s.color = cyan;
/// s.acc = emptyset;
/// s.weight = weight;
/// for all t in post(s) do
/// let (s, l, a, t) be the edge from s to t;
/// if t.color == white then
/// for all b in a do
/// weight[b] = weight[b] + 1;
/// end for;
/// call dfs_blue(t);
/// for all b in a do
/// weight[b] = weight[b] - 1;
/// end for;
/// end if;
/// Acc = s.acc U a;
/// if t.color == cyan &&
/// (Acc U support(weight - t.weight) U t.acc) == all_acc then
/// report a cycle;
/// else if Acc not included in t.acc then
/// t.acc := t.acc U Acc;
/// call dfs_red(t, Acc);
/// end if;
/// end for;
/// s.color = blue;
/// end;
///
/// procedure dfs_red(s, Acc)
/// begin
/// for all t in post(s) do
/// let (s, l, a, t) be the edge from s to t;
/// if t.color == cyan &&
/// (Acc U support(weight - t.weight) U t.acc) == all_acc then
/// report a cycle;
/// else if t.color != white and Acc not included in t.acc then
/// t.acc := t.acc U Acc;
/// call dfs_red(t, Acc);
/// end if;
/// end for;
/// end;
/// \endverbatim
/** \verbatim
procedure check ()
begin
weight = 0; // the null vector
call dfs_blue(s0);
end;
procedure dfs_blue (s)
begin
s.color = cyan;
s.acc = emptyset;
s.weight = weight;
for all t in post(s) do
let (s, l, a, t) be the edge from s to t;
if t.color == white then
for all b in a do
weight[b] = weight[b] + 1;
end for;
call dfs_blue(t);
for all b in a do
weight[b] = weight[b] - 1;
end for;
end if;
Acc = s.acc U a;
if t.color == cyan &&
(Acc U support(weight - t.weight) U t.acc) == all_acc then
report a cycle;
else if Acc not included in t.acc then
t.acc := t.acc U Acc;
call dfs_red(t, Acc);
end if;
end for;
s.color = blue;
end;
procedure dfs_red(s, Acc)
begin
for all t in post(s) do
let (s, l, a, t) be the edge from s to t;
if t.color == cyan &&
(Acc U support(weight - t.weight) U t.acc) == all_acc then
report a cycle;
else if t.color != white and Acc not included in t.acc then
t.acc := t.acc U Acc;
call dfs_red(t, Acc);
end if;
end for;
end;
\endverbatim */
///
/// This algorithm is a generalisation to TGBA of the one implemented in
/// spot::explicit_se05_search. It is based on the acceptance set labelling