Abstractions for transition systems with applications to stubborn sets

Henri Hansen

doi:10.1007/978-3-319-51046-0_6

Abstractions for transition systems with applications to stubborn sets

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Scientific

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.

Original language	English
Title of host publication	Concurrency, Security, and Puzzles
Subtitle of host publication	Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday
Editors	Thomas Gibson-Robinson, Philippa Hopcroft, Ranko Lazić
Publisher	Springer International Publishing
Pages	104-123
Number of pages	20
ISBN (Electronic)	978-3-319-51046-0
ISBN (Print)	978-3-319-51045-3
DOIs	https://doi.org/10.1007/978-3-319-51046-0_6
Publication status	Published - 1 Jan 2017
Publication type	B2 Book chapter

Publication series

Name	Lecture Notes in Computer Science
Volume	10160
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-51046-0_6

Cite this

Hansen, H. (2017). Abstractions for transition systems with applications to stubborn sets. In T. Gibson-Robinson, P. Hopcroft, & R. Lazić (Eds.), Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday (pp. 104-123). (Lecture Notes in Computer Science; Vol. 10160). Springer International Publishing. https://doi.org/10.1007/978-3-319-51046-0_6

@inbook{35c1e7e0f72e4087993649994ef96099,

title = "Abstractions for transition systems with applications to stubborn sets",

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.",

author = "Henri Hansen",

year = "2017",

month = jan,

day = "1",

doi = "10.1007/978-3-319-51046-0\_6",

language = "English",

isbn = "978-3-319-51045-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer International Publishing",

pages = "104--123",

editor = "Thomas Gibson-Robinson and Philippa Hopcroft and Ranko Lazi{\'c}",

booktitle = "Concurrency, Security, and Puzzles",

}

Hansen, H 2017, Abstractions for transition systems with applications to stubborn sets. in T Gibson-Robinson, P Hopcroft & R Lazić (eds), Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, vol. 10160, Springer International Publishing, pp. 104-123. https://doi.org/10.1007/978-3-319-51046-0_6

Abstractions for transition systems with applications to stubborn sets. / Hansen, Henri.
Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. ed. / Thomas Gibson-Robinson; Philippa Hopcroft; Ranko Lazić. Springer International Publishing, 2017. p. 104-123 (Lecture Notes in Computer Science; Vol. 10160).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Scientific

TY - CHAP

T1 - Abstractions for transition systems with applications to stubborn sets

AU - Hansen, Henri

PY - 2017/1/1

Y1 - 2017/1/1

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

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

U2 - 10.1007/978-3-319-51046-0_6

DO - 10.1007/978-3-319-51046-0_6

M3 - Chapter

AN - SCOPUS:85006700598

SN - 978-3-319-51045-3

T3 - Lecture Notes in Computer Science

SP - 104

EP - 123

BT - Concurrency, Security, and Puzzles

A2 - Gibson-Robinson, Thomas

A2 - Hopcroft, Philippa

A2 - Lazić, Ranko

PB - Springer International Publishing

ER -

Hansen H. Abstractions for transition systems with applications to stubborn sets. In Gibson-Robinson T, Hopcroft P, Lazić R, editors, Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. Springer International Publishing. 2017. p. 104-123. (Lecture Notes in Computer Science). doi: 10.1007/978-3-319-51046-0_6

Abstractions for transition systems with applications to stubborn sets

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this