Relaxed visibility enhances partial order reduction

Ilkka Kokkarinen; Doron Peled; Antti Valmari

doi:10.1007/3-540-63166-6_33

Relaxed visibility enhances partial order reduction

Ilkka Kokkarinen, Doron Peled, Antti Valmari

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

13 Scopus citations

Abstract

State-space explosion is a central problem in the automatic verification (model-checking) of concurrent systems. Partial order reduction is a method that was developed to try to cope with the state-space explosion. Based on the observation that the order of execution of concurrent (independent) atomic actions is in many cases unimportant for the checked property, it allows reducing the state space by exploring fewer execution sequences. However, to be on the safe side, partial order reductions put constraints about commuting the order of atomic actions that may change the value of propositions appearing in the checked specification. In this paper we relax this constraint, allowing a weaker requirement to be imposed, achieving a better reduction. We demonstrate the benefits of our improved reduction with experimental results.

Original language	English
Title of host publication	Computer Aided Verification - 9th International Conference, CAV 1997, Proceedings
Editors	Orna Grumberg
Publisher	Springer Verlag
Pages	328-339
Number of pages	12
ISBN (Print)	3540631666, 9783540631668
DOIs	https://doi.org/10.1007/3-540-63166-6_33
State	Published - 1997
Externally published	Yes
Event	9th International Conference on Computer-Aided Verification, CAV 1997 - Haifa, Israel Duration: 22 Jun 1997 → 25 Jun 1997

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1254
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Conference on Computer-Aided Verification, CAV 1997
Country/Territory	Israel
City	Haifa
Period	22/06/97 → 25/06/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Access to Document

10.1007/3-540-63166-6_33

Cite this

Kokkarinen, I., Peled, D., & Valmari, A. (1997). Relaxed visibility enhances partial order reduction. In O. Grumberg (Ed.), Computer Aided Verification - 9th International Conference, CAV 1997, Proceedings (pp. 328-339). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1254). Springer Verlag. https://doi.org/10.1007/3-540-63166-6_33

Kokkarinen, Ilkka ; Peled, Doron ; Valmari, Antti. / Relaxed visibility enhances partial order reduction. Computer Aided Verification - 9th International Conference, CAV 1997, Proceedings. editor / Orna Grumberg. Springer Verlag, 1997. pp. 328-339 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{696bd14bdf02405cbd10cd4ee47fe9f1,

title = "Relaxed visibility enhances partial order reduction",

abstract = "State-space explosion is a central problem in the automatic verification (model-checking) of concurrent systems. Partial order reduction is a method that was developed to try to cope with the state-space explosion. Based on the observation that the order of execution of concurrent (independent) atomic actions is in many cases unimportant for the checked property, it allows reducing the state space by exploring fewer execution sequences. However, to be on the safe side, partial order reductions put constraints about commuting the order of atomic actions that may change the value of propositions appearing in the checked specification. In this paper we relax this constraint, allowing a weaker requirement to be imposed, achieving a better reduction. We demonstrate the benefits of our improved reduction with experimental results.",

author = "Ilkka Kokkarinen and Doron Peled and Antti Valmari",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 9th International Conference on Computer-Aided Verification, CAV 1997 ; Conference date: 22-06-1997 Through 25-06-1997",

year = "1997",

doi = "10.1007/3-540-63166-6_33",

language = "אנגלית",

isbn = "3540631666",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "328--339",

editor = "Orna Grumberg",

booktitle = "Computer Aided Verification - 9th International Conference, CAV 1997, Proceedings",

address = "גרמניה",

}

Kokkarinen, I, Peled, D & Valmari, A 1997, Relaxed visibility enhances partial order reduction. in O Grumberg (ed.), Computer Aided Verification - 9th International Conference, CAV 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1254, Springer Verlag, pp. 328-339, 9th International Conference on Computer-Aided Verification, CAV 1997, Haifa, Israel, 22/06/97. https://doi.org/10.1007/3-540-63166-6_33

Relaxed visibility enhances partial order reduction. / Kokkarinen, Ilkka; Peled, Doron; Valmari, Antti.
Computer Aided Verification - 9th International Conference, CAV 1997, Proceedings. ed. / Orna Grumberg. Springer Verlag, 1997. p. 328-339 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1254).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Relaxed visibility enhances partial order reduction

AU - Kokkarinen, Ilkka

AU - Peled, Doron

AU - Valmari, Antti

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1997.

PY - 1997

Y1 - 1997

N2 - State-space explosion is a central problem in the automatic verification (model-checking) of concurrent systems. Partial order reduction is a method that was developed to try to cope with the state-space explosion. Based on the observation that the order of execution of concurrent (independent) atomic actions is in many cases unimportant for the checked property, it allows reducing the state space by exploring fewer execution sequences. However, to be on the safe side, partial order reductions put constraints about commuting the order of atomic actions that may change the value of propositions appearing in the checked specification. In this paper we relax this constraint, allowing a weaker requirement to be imposed, achieving a better reduction. We demonstrate the benefits of our improved reduction with experimental results.

AB - State-space explosion is a central problem in the automatic verification (model-checking) of concurrent systems. Partial order reduction is a method that was developed to try to cope with the state-space explosion. Based on the observation that the order of execution of concurrent (independent) atomic actions is in many cases unimportant for the checked property, it allows reducing the state space by exploring fewer execution sequences. However, to be on the safe side, partial order reductions put constraints about commuting the order of atomic actions that may change the value of propositions appearing in the checked specification. In this paper we relax this constraint, allowing a weaker requirement to be imposed, achieving a better reduction. We demonstrate the benefits of our improved reduction with experimental results.

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

U2 - 10.1007/3-540-63166-6_33

DO - 10.1007/3-540-63166-6_33

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84947442096

SN - 3540631666

SN - 9783540631668

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 328

EP - 339

BT - Computer Aided Verification - 9th International Conference, CAV 1997, Proceedings

A2 - Grumberg, Orna

PB - Springer Verlag

T2 - 9th International Conference on Computer-Aided Verification, CAV 1997

Y2 - 22 June 1997 through 25 June 1997

ER -

Kokkarinen I, Peled D, Valmari A. Relaxed visibility enhances partial order reduction. In Grumberg O, editor, Computer Aided Verification - 9th International Conference, CAV 1997, Proceedings. Springer Verlag. 1997. p. 328-339. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-63166-6_33

Relaxed visibility enhances partial order reduction

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this