A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Linear temporal logic with until and next, logical consecutions
2008
Annals of Pure and Applied Logic
While specifications and verifications of concurrent systems employ Linear Temporal Logic (LT L), it is increasingly likely that logical consequence in LT L will be used in the description of computations and parallel reasoning. Our paper considers logical consequence in the standard LT L with temporal operations U (until) and N (next). The prime result is an algorithm recognizing consecutions admissible in LT L, so we prove that LT L is decidable w.r.t. admissible inference rules. As a
doi:10.1016/j.apal.2008.03.001
fatcat:ycdiicbpgba5naz4e4a3j5hr3y