TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

Stubborn Set Intuition Explained

Tutkimustuotosvertaisarvioitu

Yksityiskohdat

AlkuperäiskieliEnglanti
OtsikkoPetri Nets and Software Engineering 2016
AlaotsikkoProceedings of the International Workshop on Petri Nets and Software Engineering 2016, including the International Workshop on Biological Processes & Petri Nets 2016
ToimittajatLawrence Cabac, Lars Michael Kristensen, Heiko Rölke
KustantajaCEUR-WS
Sivut213-232
Sivumäärä20
TilaJulkaistu - 2016
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisussa
TapahtumaInternational Workshop on Petri Nets and Software Engineering, PNSE 2016, including the International Workshop on Biological Processes and Petri Nets, BioPPN 2016 - Torun, Puola
Kesto: 20 kesäkuuta 201621 kesäkuuta 2016

Julkaisusarja

NimiCEUR Workshop Proceedings
KustantajaCEUR-WS
Vuosikerta1591
ISSN (elektroninen)1613-0073

Conference

ConferenceInternational Workshop on Petri Nets and Software Engineering, PNSE 2016, including the International Workshop on Biological Processes and Petri Nets, BioPPN 2016
MaaPuola
KaupunkiTorun
Ajanjakso20/06/1621/06/16

Tiivistelmä

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.

!!ASJC Scopus subject areas

Julkaisufoorumi-taso