Tampere University of Technology

TUTCRIS Research Portal

Abstractions for transition systems with applications to stubborn sets

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
Pages104-123
Number of pages20
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

Partial order reduction covers a range of techniques based on eliminating unnecessary transitions when generating a state space. On the other hand, abstractions replace sets of states of a system with abstract representatives in order to create a smaller state space. This article explores how stubborn sets and abstraction can be combined. We provide examples to provide intuition and expand on some recent results. We provide a classification of abstractions and give some novel results on what is needed to combine abstraction and partial order reduction in a sound way.

Field of science, Statistics Finland