@inproceedings{2e4bae01c15e46499a33704582afca89,
title = "Stubborn set intuition explained",
abstract = "This study focuses on the differences between stubborn sets and other partial order methods. First a major problem with step graphs is pointed out with an example. Then the deadlock-preserving stubborn set method is compared to the deadlock-preserving ample set and persistent set methods. Next, conditions are discussed whose purpose is to ensure that the reduced state space preserves the ordering of visible transitions, that is, transitions that may change the truth values of the propositions that the formula under verification has been built from. Finally solutions to the ignoring problem are analysed both when the purpose is to preserve only safety properties and when also liveness properties are of interest.",
author = "Antti Valmari and Henri Hansen",
note = "jufoid=62555; INTERNATIONAL CONFERENCE ON APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY ; Conference date: 01-01-1900",
year = "2017",
doi = "10.1007/978-3-662-55862-1\_7",
language = "English",
isbn = "9783662558614",
series = "Lecture Notes in Computer Science",
publisher = "Springer Verlag",
pages = "140--165",
booktitle = "Transactions on Petri Nets and Other Models of Concurrency XII",
address = "Germany",
}