Stubborn Set Intuition Explained
Tutkimustuotos › › vertaisarvioitu
Yksityiskohdat
| Alkuperäiskieli | Englanti |
|---|---|
| Otsikko | Petri Nets and Software Engineering 2016 |
| Alaotsikko | Proceedings of the International Workshop on Petri Nets and Software Engineering 2016, including the International Workshop on Biological Processes & Petri Nets 2016 |
| Toimittajat | Lawrence Cabac, Lars Michael Kristensen, Heiko Rölke |
| Kustantaja | CEUR-WS |
| Sivut | 213-232 |
| Sivumäärä | 20 |
| Tila | Julkaistu - 2016 |
| OKM-julkaisutyyppi | A4 Artikkeli konferenssijulkaisussa |
| Tapahtuma | International 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 2016 → 21 kesäkuuta 2016 |
Julkaisusarja
| Nimi | CEUR Workshop Proceedings |
|---|---|
| Kustantaja | CEUR-WS |
| Vuosikerta | 1591 |
| ISSN (elektroninen) | 1613-0073 |
Conference
| Conference | International Workshop on Petri Nets and Software Engineering, PNSE 2016, including the International Workshop on Biological Processes and Petri Nets, BioPPN 2016 |
|---|---|
| Maa | Puola |
| Kaupunki | Torun |
| Ajanjakso | 20/06/16 → 21/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.