16a8c03143
* src/bin/common_trans.cc, src/bin/common_trans.hh: New files, extracted from... * src/bin/ltlcross.cc: ... here, so that ltldo can use them. * src/bin/ltldo.cc: New file. * src/bin/Makefile.am: Adjust. * src/bin/common_aoutput.cc, src/bin/common_aoutput.hh: Make it possible to add new statistics. * doc/org/ltldo.org: New file. * doc/Makefile.am, doc/org/tools.org: Adjust. * src/bin/man/ltldo.x: New file. * src/bin/man/Makefile.am: Adjust. * src/bin/man/ltlcross.x, src/bin/man/ltlfilt.x: Mention ltldo(1). * src/tgbatest/ltldo.test, src/tgbatest/ltldo2.test: New files. * src/tgbatest/Makefile.am: Add them. * NEWS: Mention ltldo.
48 lines
1.5 KiB
Text
48 lines
1.5 KiB
Text
[NAME]
|
|
ltlfilt \- filter files or lists of LTL/PSL formulas
|
|
[DESCRIPTION]
|
|
.\" Add any additional description here
|
|
[BIBLIOGRAPHY]
|
|
If you would like to give a reference to this tool in an article,
|
|
we suggest you cite the following paper:
|
|
.TP
|
|
\(bu
|
|
Alexandre Duret-Lutz: Manipulating LTL formulas using Spot 1.0.
|
|
Proceedings of ATVA'13. LNCS 8172.
|
|
.PP
|
|
The following papers describe algorithms used by ltlfilt:
|
|
.TP
|
|
\(bu
|
|
Kousha Etessami: A note on a question of Peled and Wilke regarding
|
|
stutter-invariant LTL. Information Processing Letters 75(6): 261-263
|
|
(2000).
|
|
|
|
Describes the transformation behind the \fB\-\-remove\-x\fR option.
|
|
.TP
|
|
\(bu
|
|
Christian Dax, Jochen Eisinger, Felix Klaedtke: Mechanizing the
|
|
Powerset Construction for Restricted Classes of
|
|
ω-Automata. Proceedings of ATVA'07. LNCS 4762.
|
|
|
|
Describes the checks implemented by the \fB\-\-safety\fR,
|
|
\fB\-\-guarantee\fR, and \fB\-\-obligation\fR options.
|
|
.TP
|
|
\(bu
|
|
Ivana Černá, Radek Pelánek: Relating Hierarchy of Temporal Properties
|
|
to Model Checking. Proceedings of MFCS'03. LNCS 2747.
|
|
|
|
Describes the syntactic LTL classes matched by the
|
|
\fB\-\-syntactic\-safety\fR, \fB\-\-syntactic\-guarantee\fR,
|
|
\fB\-\-syntactic\-obligation\fR options,
|
|
\fB\-\-syntactic\-persistence\fR, and \fB\-\-syntactic\-recurrence\fR
|
|
options.
|
|
.TP
|
|
\(bu
|
|
Kousha Etessami, Gerard J. Holzmann: Optimizing Büchi
|
|
Automata. Proceedings of CONCUR'00. LNCS 1877.
|
|
|
|
Describe the syntactic LTL classes matched by \fB\-\-eventual\fR, and
|
|
\fB\-\-universal\fR.
|
|
[SEE ALSO]
|
|
.BR randltl (1),
|
|
.BR ltldo (1)
|