TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

Stubborn Set Intuition Explained

Tutkimustuotosvertaisarvioitu

Standard

Stubborn Set Intuition Explained. / Valmari, Antti; Hansen, Henri.

Petri Nets and Software Engineering 2016: Proceedings of the International Workshop on Petri Nets and Software Engineering 2016, including the International Workshop on Biological Processes & Petri Nets 2016. toim. / Lawrence Cabac; Lars Michael Kristensen; Heiko Rölke. CEUR-WS, 2016. s. 213-232 (CEUR Workshop Proceedings; Vuosikerta 1591).

Tutkimustuotosvertaisarvioitu

Harvard

Valmari, A & Hansen, H 2016, Stubborn Set Intuition Explained. julkaisussa L Cabac, LM Kristensen & H Rölke (toim), Petri Nets and Software Engineering 2016: Proceedings of the International Workshop on Petri Nets and Software Engineering 2016, including the International Workshop on Biological Processes & Petri Nets 2016. CEUR Workshop Proceedings, Vuosikerta. 1591, CEUR-WS, Sivut 213-232, Torun, Puola, 20/06/16.

APA

Valmari, A., & Hansen, H. (2016). Stubborn Set Intuition Explained. teoksessa L. Cabac, L. M. Kristensen, & H. Rölke (Toimittajat), Petri Nets and Software Engineering 2016: Proceedings of the International Workshop on Petri Nets and Software Engineering 2016, including the International Workshop on Biological Processes & Petri Nets 2016 (Sivut 213-232). (CEUR Workshop Proceedings; Vuosikerta 1591). CEUR-WS.

Vancouver

Valmari A, Hansen H. Stubborn Set Intuition Explained. julkaisussa Cabac L, Kristensen LM, Rölke H, toimittajat, Petri Nets and Software Engineering 2016: Proceedings of the International Workshop on Petri Nets and Software Engineering 2016, including the International Workshop on Biological Processes & Petri Nets 2016. CEUR-WS. 2016. s. 213-232. (CEUR Workshop Proceedings).

Author

Valmari, Antti ; Hansen, Henri. / Stubborn Set Intuition Explained. Petri Nets and Software Engineering 2016: Proceedings of the International Workshop on Petri Nets and Software Engineering 2016, including the International Workshop on Biological Processes & Petri Nets 2016. Toimittaja / Lawrence Cabac ; Lars Michael Kristensen ; Heiko Rölke. CEUR-WS, 2016. Sivut 213-232 (CEUR Workshop Proceedings).

Bibtex - Lataa

@inproceedings{49d10355cb89499aa7b65cfaf5b69a8f,
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=53269",
year = "2016",
language = "English",
series = "CEUR Workshop Proceedings",
publisher = "CEUR-WS",
pages = "213--232",
editor = "Lawrence Cabac and Kristensen, {Lars Michael} and Heiko R{\"o}lke",
booktitle = "Petri Nets and Software Engineering 2016",

}

RIS (suitable for import to EndNote) - Lataa

TY - GEN

T1 - Stubborn Set Intuition Explained

AU - Valmari, Antti

AU - Hansen, Henri

N1 - JUFOID=53269

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84977557005&partnerID=8YFLogxK

M3 - Conference contribution

T3 - CEUR Workshop Proceedings

SP - 213

EP - 232

BT - Petri Nets and Software Engineering 2016

A2 - Cabac, Lawrence

A2 - Kristensen, Lars Michael

A2 - Rölke, Heiko

PB - CEUR-WS

ER -