Finding Small Stubborn Sets Automatically

Reference:

Kimmo Varpaaniemi. Finding small stubborn sets automatically. In Volkan Atalay, Uğur Halıcı, Kemal İnan, Neşe Yalabık, and Adnan Yazıcı, editors, Proceedings of the Eleventh International Symposium on Computer and Information Sciences, ISCIS XI, November 6–8, 1996, Antalya, Turkey, Volume I, pages 133–142. Middle East Technical University, Ankara, Turkey, 1996.

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.

Keywords:

verification of concurrent and distributed systems, state space generation, stubborn sets

Suggested BibTeX entry:

@inproceedings{VarpaaniemiKimmo-Vrp96,
    author = {Kimmo Varpaaniemi},
    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}},
    editor = {Volkan Atalay and U{\u{g}}ur Hal{\i}c{\i} and Kemal {\.{I}}nan and Ne{\c{s}}e Yalab{\i}k and Adnan Yaz{\i}c{\i}},
    pages = {133--142},
    publisher = {Middle East Technical University, Ankara, Turkey},
    title = {{F}inding Small Stubborn Sets Automatically},
    year = {1996},
}