Tampere University of Technology

TUTCRIS Research Portal

More stubborn set methods for process algebras

Research output: Chapter in Book/Report/Conference proceedingChapterScientific

Details

Original languageEnglish
Title of host publicationConcurrency, Security, and Puzzles
Subtitle of host publicationEssays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday
EditorsThomas Gibson-Robinson, Philippa Hopcroft, Ranko Lazić
PublisherSpringer International Publishing
Pages246-271
Number of pages26
ISBN (Electronic)978-3-319-51046-0
ISBN (Print)978-3-319-51045-3
DOIs
Publication statusPublished - 1 Jan 2017
Publication typeB2 Part of a book or another research book

Publication series

NameLecture Notes in Computer Science
Volume10160
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Abstract

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.

Field of science, Statistics Finland