@inproceedings{
    Vrp98b,
    editor = {Desel, J{\"{o}}rg and Silva, Manuel},
    author = "Varpaaniemi, Kimmo",
    publisher = "Springer-Verlag, Berlin, Germany",
    note = "© Springer-Verlag Berlin Heidelberg 1998",
    title = "{O}n Stubborn Sets in the Verification of Linear Time Temporal Properties",
    url = "http://users.tkk.fi/~kvarpaan/info/Vrp98b.html",
    series = "Lecture Notes in Computer Science",
    booktitle = "{A}pplication and Theory of {P}etri Nets 1998: 19th International Conference, {I}{C}{A}{T}{P}{N}'98, {L}isbon, {P}ortugal, {J}une 22--26, 1998, Proceedings",
    pages = "124--143",
    volume = "1420",
    year = "1998",
    keywords = "reachability analysis, reduced state space generation, stubborn sets, verification of LTL formulas",
    abstract = "The stubborn set method is one of the methods that try to relieve the state space explosion problem that occurs in state space generation. This paper is concentrated on the verification of nexttime-less LTL (linear time temporal logic) formulas with the aid of the stubborn set method. The contribution of the paper is a theorem that gives us a way to utilize the structure of the formula when the stubborn set method is used and there is no fairness assumption. Connections to already known results are drawn by modifying the theorem to concern verification under fairness assumptions."
}