Answers are grounded in this paper and cite their sources.
A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NP-complete. The fragment is larger than previously known NP-complete fragments. It is obtained by prohibiting the use of until operator and requiring to use only next operators indexed by a letter.
No takes yet. Share an insight, caveat, or question.
Muscholl et al. (2005) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: