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
|
|
@ -42,55 +42,55 @@ namespace spot
|
|||
/// (until it returns a null pointer) to enumerate all the visited acceptance
|
||||
/// paths. The implemented algorithm is the following:
|
||||
///
|
||||
/// \verbatim
|
||||
/// procedure check ()
|
||||
/// begin
|
||||
/// call dfs_blue(s0);
|
||||
/// end;
|
||||
///
|
||||
/// procedure dfs_blue (s)
|
||||
/// begin
|
||||
/// s.color = blue;
|
||||
/// for all t in post(s) do
|
||||
/// if t.color == white then
|
||||
/// call dfs_blue(t);
|
||||
/// end if;
|
||||
/// if (the edge (s,t) is accepting) then
|
||||
/// target = s;
|
||||
/// call dfs_red(t);
|
||||
/// end if;
|
||||
/// end for;
|
||||
/// end;
|
||||
///
|
||||
/// procedure dfs_red(s)
|
||||
/// begin
|
||||
/// s.color = red;
|
||||
/// if s == target then
|
||||
/// report cycle
|
||||
/// end if;
|
||||
/// 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 = blue;
|
||||
for all t in post(s) do
|
||||
if t.color == white then
|
||||
call dfs_blue(t);
|
||||
end if;
|
||||
if (the edge (s,t) is accepting) then
|
||||
target = s;
|
||||
call dfs_red(t);
|
||||
end if;
|
||||
end for;
|
||||
end;
|
||||
|
||||
procedure dfs_red(s)
|
||||
begin
|
||||
s.color = red;
|
||||
if s == target then
|
||||
report cycle
|
||||
end if;
|
||||
for all t in post(s) do
|
||||
if t.color == blue then
|
||||
call dfs_red(t);
|
||||
end if;
|
||||
end for;
|
||||
end;
|
||||
\endverbatim */
|
||||
///
|
||||
/// This algorithm is an adaptation to TBA of the one
|
||||
/// (which deals with accepting states) presented in
|
||||
///
|
||||
/// \verbatim
|
||||
/// Article{ courcoubetis.92.fmsd,
|
||||
/// author = {Costas Courcoubetis and Moshe Y. Vardi and Pierre
|
||||
/// Wolper and Mihalis Yannakakis},
|
||||
/// title = {Memory-Efficient Algorithm for the Verification of
|
||||
/// Temporal Properties},
|
||||
/// journal = {Formal Methods in System Design},
|
||||
/// pages = {275--288},
|
||||
/// year = {1992},
|
||||
/// volume = {1}
|
||||
/// }
|
||||
/// \endverbatim
|
||||
/** \verbatim
|
||||
Article{ courcoubetis.92.fmsd,
|
||||
author = {Costas Courcoubetis and Moshe Y. Vardi and Pierre
|
||||
Wolper and Mihalis Yannakakis},
|
||||
title = {Memory-Efficient Algorithm for the Verification of
|
||||
Temporal Properties},
|
||||
journal = {Formal Methods in System Design},
|
||||
pages = {275--288},
|
||||
year = {1992},
|
||||
volume = {1}
|
||||
}
|
||||
\endverbatim */
|
||||
///
|
||||
/// \bug The name is misleading. Magic-search is the algorithm
|
||||
/// from \c godefroid.93.pstv, not \c courcoubetis.92.fmsd.
|
||||
|
|
@ -105,15 +105,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