@inproceedings{
    VrpISCIS04,
    editor = {Aykanat, Cevdet and Dayar, Tu{\u{g}}rul and K{\"{o}}rpeo{\u{g}}lu, {\.{I}}brahim},
    author = "Varpaaniemi, Kimmo",
    publisher = "Springer-Verlag, Berlin, Germany",
    note = "© Springer-Verlag Berlin Heidelberg 2004",
    title = "{S}tubborn Sets for Priority Nets",
    url = "http://users.tkk.fi/~kvarpaan/info/VrpISCIS04.html",
    series = "Lecture Notes in Computer Science",
    booktitle = "{C}omputer and Information Sciences --- {I}{S}{C}{I}{S} 2004, 19th International Symposium, {K}emer-{A}ntalya, {T}urkey, {O}ctober 27--29, 2004, Proceedings",
    errata = "http://users.tkk.fi/~kvarpaan/kviscisxixe.html",
    volume = "3280",
    pages = "574--583",
    year = "2004",
    keywords = "reachability analysis, stubborn sets, priority nets",
    abstract = "Partial order methods, such as the stubborn set method and the priority method, reduce verification effort by exploiting irrelevant orders of events. We show how the stubborn set method can be applied to priority nets. By applicability we mean that for a given priority net, the stubborn set method constructs a reduced reachability graph that sufficiently represents the full reachability graph of the priority net. This work can also be considered as a combination of the stubborn set method and the priority method, to be used in ``complete or moderated incomplete'' verification when the original models are unprioritised nets."
}