Tampere University of Technology

TUTCRIS Research Portal

More stubborn set methods for process algebras

Research output: Chapter in Book/Report/Conference proceedingChapterScientific

Standard

More stubborn set methods for process algebras. / Valmari, Antti.

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. 246-271 (Lecture Notes in Computer Science; Vol. 10160).

Research output: Chapter in Book/Report/Conference proceedingChapterScientific

Harvard

Valmari, A 2017, More stubborn set methods for process algebras. 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. 246-271. https://doi.org/10.1007/978-3-319-51046-0_13

APA

Valmari, A. (2017). More stubborn set methods for process algebras. 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. 246-271). (Lecture Notes in Computer Science; Vol. 10160). Springer International Publishing. https://doi.org/10.1007/978-3-319-51046-0_13

Vancouver

Valmari A. More stubborn set methods for process algebras. 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. 246-271. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-51046-0_13

Author

Valmari, Antti. / More stubborn set methods for process algebras. Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. editor / Thomas Gibson-Robinson ; Philippa Hopcroft ; Ranko Lazić. Springer International Publishing, 2017. pp. 246-271 (Lecture Notes in Computer Science).

Bibtex - Download

@inbook{a62b47b9b8b24866b45904953b6cec4e,
title = "More stubborn set methods for process algebras",
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.",
author = "Antti Valmari",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-51046-0_13",
language = "English",
isbn = "978-3-319-51045-3",
series = "Lecture Notes in Computer Science",
publisher = "Springer International Publishing",
pages = "246--271",
editor = "Thomas Gibson-Robinson and Philippa Hopcroft and Ranko Lazić",
booktitle = "Concurrency, Security, and Puzzles",

}

RIS (suitable for import to EndNote) - Download

TY - CHAP

T1 - More stubborn set methods for process algebras

AU - Valmari, Antti

PY - 2017/1/1

Y1 - 2017/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=85006810860&partnerID=8YFLogxK

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

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

M3 - Chapter

SN - 978-3-319-51045-3

T3 - Lecture Notes in Computer Science

SP - 246

EP - 271

BT - Concurrency, Security, and Puzzles

A2 - Gibson-Robinson, Thomas

A2 - Hopcroft, Philippa

A2 - Lazić, Ranko

PB - Springer International Publishing

ER -