24 lines
700 B
Text
24 lines
700 B
Text
[NAME]
|
|
genltl \- generate LTL formulas from scalable patterns
|
|
[DESCRIPTION]
|
|
.\" Add any additional description here
|
|
[BIBLIOGRAPHY]
|
|
Prefixes used in pattern names refer to the following papers:
|
|
.TP
|
|
gh
|
|
J. Geldenhuys and H. Hansen: Larger automata and less
|
|
work for LTL model checking. Proceedings of Spin'06. LNCS 3925.
|
|
.TP
|
|
ccj
|
|
J. Cichoń, A. Czubak, and A. Jasiński (DepCoS'09): Minimal Büchi
|
|
Automata for Certain Classes of LTL Formulas. Proceedings of DepCoS'09.
|
|
.TP
|
|
go
|
|
P. Gastin and D. Oddoux: Fast LTL to Büchi Automata Translation.
|
|
Proceedings of CAV'01. LNCS 2102.
|
|
.TP
|
|
rv
|
|
K. Rozier and M. Vardi: LTL Satisfiability Checking.
|
|
Proceedings of Spin'07. LNCS 4595.
|
|
[SEE ALSO]
|
|
.BR randltl (1)
|