Partial-order reduction

Doron Peled

doi:10.1007/978-3-319-10575-8_6

Partial-order reduction

Doron Peled

Department of Computer Science

Bar-Ilan University

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

Abstract

Partial order reduction methods help reduce the time and space required to automatically verify concurrent asynchronous systems based on commutativity between concurrently executed transitions. We describe partial order reduction for various specification formalisms, such as LTL, CTL, and process algebra.

Original language	English
Title of host publication	Handbook of Model Checking
Pages	173-190
Number of pages	18
ISBN (Electronic)	9783319105758
DOIs	https://doi.org/10.1007/978-3-319-10575-8_6
State	Published - 18 May 2018

All Science Journal Classification (ASJC) codes

General Computer Science
General Mathematics
General Engineering

Access to Document

10.1007/978-3-319-10575-8_6

Cite this

@inbook{9c4fc6ba935f483eb7b7ea642de44ff1,

title = "Partial-order reduction",

abstract = "Partial order reduction methods help reduce the time and space required to automatically verify concurrent asynchronous systems based on commutativity between concurrently executed transitions. We describe partial order reduction for various specification formalisms, such as LTL, CTL, and process algebra.",

author = "Doron Peled",

year = "2018",

month = may,

day = "18",

doi = "10.1007/978-3-319-10575-8_6",

language = "الإنجليزيّة",

isbn = "9783319105741",

pages = "173--190",

booktitle = "Handbook of Model Checking",

}

TY - CHAP

T1 - Partial-order reduction

AU - Peled, Doron

PY - 2018/5/18

Y1 - 2018/5/18

N2 - Partial order reduction methods help reduce the time and space required to automatically verify concurrent asynchronous systems based on commutativity between concurrently executed transitions. We describe partial order reduction for various specification formalisms, such as LTL, CTL, and process algebra.

AB - Partial order reduction methods help reduce the time and space required to automatically verify concurrent asynchronous systems based on commutativity between concurrently executed transitions. We describe partial order reduction for various specification formalisms, such as LTL, CTL, and process algebra.

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

U2 - 10.1007/978-3-319-10575-8_6

DO - 10.1007/978-3-319-10575-8_6

M3 - فصل

SN - 9783319105741

SP - 173

EP - 190

BT - Handbook of Model Checking

ER -

Partial-order reduction

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this