TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

More stubborn set methods for process algebras

Tutkimustuotos

Yksityiskohdat

AlkuperäiskieliEnglanti
OtsikkoConcurrency, Security, and Puzzles
AlaotsikkoEssays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday
ToimittajatThomas Gibson-Robinson, Philippa Hopcroft, Ranko Lazić
KustantajaSpringer International Publishing
Sivut246-271
Sivumäärä26
ISBN (elektroninen)978-3-319-51046-0
ISBN (painettu)978-3-319-51045-3
DOI - pysyväislinkit
TilaJulkaistu - 1 tammikuuta 2017
OKM-julkaisutyyppiB2 Kirjan tai muun kokoomateoksen osa

Julkaisusarja

NimiLecture Notes in Computer Science
Vuosikerta10160
ISSN (painettu)0302-9743
ISSN (elektroninen)1611-3349

Tiivistelmä

Six stubborn set methods for computing reduced labelled transition systems are presented. Two of them preserve the traces, and one is tailored for on-the-fly verification of safety properties. The rest preserve the tree failures, fair testing equivalence, or the divergence traces. Two methods are entirely new, the ideas of three are recent and the adaptation to the process-algebraic setting with non-deterministic actions is new, and one is recent but slightly generalized. Most of the methods address problems in earlier solutions to the so-called ignoring problem. The correctness of each method is proven, and efficient implementation is discussed.

Tilastokeskuksen tieteenalat