@inproceedings{
    Vrp96,
    editor = "Atalay, Volkan and Hal{\i}c{\i}, U{\u{g}}ur and {\.{I}}nan, Kemal and Yalab{\i}k, Ne{\c{s}}e and Yaz{\i}c{\i}, Adnan",
    author = "Varpaaniemi, Kimmo",
    publisher = "Middle East Technical University, Ankara, Turkey",
    title = "{F}inding Small Stubborn Sets Automatically",
    booktitle = "{P}roceedings of the Eleventh International Symposium on Computer and Information Sciences, {I}{S}{C}{I}{S} {X}{I}, {N}ovember 6--8, 1996, {A}ntalya, {T}urkey, Volume {I}",
    ps = "kviscisxi.ps",
    pages = "133--142",
    flags = "public",
    year = "1996",
    keywords = "verification of concurrent and distributed systems, state space generation, stubborn sets",
    pdf = "kviscisxi.pdf",
    abstract = "State space generation is often needed in the analysis of concurrent and distributed systems. The stubborn set method is one of the techniques that try to alleviate the state space explosion encountered in state space generation. An algorithm for finding a stubborn set having as few enabled transitions as possible is presented. Practicality of the algorithm is motivated with the aid of examples."
}