Fix verbatim blocks of Doxygen comments.
* 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:
parent
1ec9cebe58
commit
1cd9b204ed
29 changed files with 758 additions and 745 deletions
|
|
@ -43,59 +43,59 @@ namespace spot
|
|||
/// paths. The implemented algorithm is an optimization of
|
||||
/// spot::explicit_magic_search and is the following:
|
||||
///
|
||||
/// \verbatim
|
||||
/// procedure check ()
|
||||
/// begin
|
||||
/// call dfs_blue(s0);
|
||||
/// end;
|
||||
///
|
||||
/// procedure dfs_blue (s)
|
||||
/// begin
|
||||
/// s.color = cyan;
|
||||
/// for all t in post(s) do
|
||||
/// if t.color == white then
|
||||
/// call dfs_blue(t);
|
||||
/// else if t.color == cyan and
|
||||
/// (the edge (s,t) is accepting or
|
||||
/// (it exists a predecessor p of s in st_blue and s != t and
|
||||
/// the arc between p and s is accepting)) then
|
||||
/// report cycle;
|
||||
/// end if;
|
||||
/// if the edge (s,t) is accepting then
|
||||
/// call dfs_red(t);
|
||||
/// end if;
|
||||
/// end for;
|
||||
/// s.color = blue;
|
||||
/// end;
|
||||
///
|
||||
/// procedure dfs_red(s)
|
||||
/// begin
|
||||
/// if s.color == cyan then
|
||||
/// report cycle;
|
||||
/// end if;
|
||||
/// s.color = red;
|
||||
/// for all t in post(s) do
|
||||
/// if t.color == blue then
|
||||
/// call dfs_red(t);
|
||||
/// end if;
|
||||
/// end for;
|
||||
/// end;
|
||||
/// \endverbatim
|
||||
/** \verbatim
|
||||
procedure check ()
|
||||
begin
|
||||
call dfs_blue(s0);
|
||||
end;
|
||||
|
||||
procedure dfs_blue (s)
|
||||
begin
|
||||
s.color = cyan;
|
||||
for all t in post(s) do
|
||||
if t.color == white then
|
||||
call dfs_blue(t);
|
||||
else if t.color == cyan and
|
||||
(the edge (s,t) is accepting or
|
||||
(it exists a predecessor p of s in st_blue and s != t and
|
||||
the arc between p and s is accepting)) then
|
||||
report cycle;
|
||||
end if;
|
||||
if the edge (s,t) is accepting then
|
||||
call dfs_red(t);
|
||||
end if;
|
||||
end for;
|
||||
s.color = blue;
|
||||
end;
|
||||
|
||||
procedure dfs_red(s)
|
||||
begin
|
||||
if s.color == cyan then
|
||||
report cycle;
|
||||
end if;
|
||||
s.color = red;
|
||||
for all t in post(s) do
|
||||
if t.color == blue then
|
||||
call dfs_red(t);
|
||||
end if;
|
||||
end for;
|
||||
end;
|
||||
\endverbatim */
|
||||
///
|
||||
/// It is an adaptation to TBA of the one presented in
|
||||
/// \verbatim
|
||||
/// @techreport{SE04,
|
||||
/// author = {Stefan Schwoon and Javier Esparza},
|
||||
/// institution = {Universit{\"a}t Stuttgart, Fakult\"at Informatik,
|
||||
/// Elektrotechnik und Informationstechnik},
|
||||
/// month = {November},
|
||||
/// number = {2004/06},
|
||||
/// title = {A Note on On-The-Fly Verification Algorithms},
|
||||
/// year = {2004},
|
||||
/// url =
|
||||
///{http://www.fmi.uni-stuttgart.de/szs/publications/info/schwoosn.SE04.shtml}
|
||||
/// }
|
||||
/// \endverbatim
|
||||
/** \verbatim
|
||||
@techreport{SE04,
|
||||
author = {Stefan Schwoon and Javier Esparza},
|
||||
institution = {Universit{\"a}t Stuttgart, Fakult\"at Informatik,
|
||||
Elektrotechnik und Informationstechnik},
|
||||
month = {November},
|
||||
number = {2004/06},
|
||||
title = {A Note on On-The-Fly Verification Algorithms},
|
||||
year = {2004},
|
||||
url =
|
||||
{http://www.fmi.uni-stuttgart.de/szs/publications/info/schwoosn.SE04.shtml}
|
||||
}
|
||||
\endverbatim */
|
||||
///
|
||||
/// \sa spot::explicit_magic_search
|
||||
///
|
||||
|
|
@ -109,15 +109,15 @@ namespace spot
|
|||
/// During the visit of \a a, the returned checker does not store explicitely
|
||||
/// the traversed states but uses the bit-state hashing technic presented in:
|
||||
///
|
||||
/// \verbatim
|
||||
/// @book{Holzmann91,
|
||||
/// author = {G.J. Holzmann},
|
||||
/// title = {Design and Validation of Computer Protocols},
|
||||
/// publisher = {Prentice-Hall},
|
||||
/// address = {Englewood Cliffs, New Jersey},
|
||||
/// year = {1991}
|
||||
/// }
|
||||
/// \endverbatim
|
||||
/** \verbatim
|
||||
@book{Holzmann91,
|
||||
author = {G.J. Holzmann},
|
||||
title = {Design and Validation of Computer Protocols},
|
||||
publisher = {Prentice-Hall},
|
||||
address = {Englewood Cliffs, New Jersey},
|
||||
year = {1991}
|
||||
}
|
||||
\endverbatim */
|
||||
///
|
||||
/// Consequently, the detection of an acceptence cycle is not ensured.
|
||||
///
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue