Wikipedia:Articles for deletion/Temporal logic in finite-state verification Source: en.wikipedia.org/wiki/Wikipedia:Articles_for_deletion/Temporal_logic_in_finite-state_verification

The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.

The result was keep. (non-admin closure) Mz7 (talk) 04:14, 10 April 2016 (UTC)[reply]

Temporal logic in finite-state verification

(Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL)

Written like an essay or lesson. — Music1201 ^talk 05:37, 3 April 2016 (UTC)[reply]

Note: This debate has been included in the list of Logic-related deletion discussions. Shawn in Montreal (talk) 15:57, 3 April 2016 (UTC)[reply]

Note: This debate has been included in the list of Computing-related deletion discussions. Shawn in Montreal (talk) 15:57, 3 April 2016 (UTC)[reply]

Keep This is horrible and it has been that way for a decade. Yet I still can't see awful prose as reason to delete.

We have an army of CompSci grads - isn't there anyone who can rework this? Andy Dingley (talk) 16:31, 3 April 2016 (UTC)[reply]

Keep unless we can find a sensible merge target. Curiously, while I'm not into formal methods, I found it perfectly clear and easy to read. Chiswick Chap (talk) 18:53, 3 April 2016 (UTC)[reply]
Keep as this is enough to keep and could use any improvements if available. SwisterTwister talk 05:11, 5 April 2016 (UTC)[reply]

The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.