Trapping mutual exclusion in the box calculus

Javier Esparza; Glenn Bruns

doi:10.1016/0304-3975(95)00119-0

Trapping mutual exclusion in the box calculus

Javier Esparza, Glenn Bruns

Informatics 7 - Chair of Theoretical Computer Science

University of Edinburgh

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

The box calculus is a process algebra with a simple Petri net semantics. We show that it provides for the concise translation of parallel programs and for the combination of verification techniques from process algebra and Petri nets. This is done by proving some properties of mutual exclusion algorithms.

Original language	English
Pages (from-to)	95-128
Number of pages	34
Journal	Theoretical Computer Science
Volume	153
Issue number	1-2
DOIs	https://doi.org/10.1016/0304-3975(95)00119-0
State	Published - 8 Jan 1996

Access to Document

10.1016/0304-3975(95)00119-0

Cite this

@article{e2c7555b8f134051a28b0f2f6fe2ecd4,

title = "Trapping mutual exclusion in the box calculus",

abstract = "The box calculus is a process algebra with a simple Petri net semantics. We show that it provides for the concise translation of parallel programs and for the combination of verification techniques from process algebra and Petri nets. This is done by proving some properties of mutual exclusion algorithms.",

author = "Javier Esparza and Glenn Bruns",

year = "1996",

month = jan,

day = "8",

doi = "10.1016/0304-3975(95)00119-0",

language = "English",

volume = "153",

pages = "95--128",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1-2",

}

TY - JOUR

T1 - Trapping mutual exclusion in the box calculus

AU - Esparza, Javier

AU - Bruns, Glenn

PY - 1996/1/8

Y1 - 1996/1/8

N2 - The box calculus is a process algebra with a simple Petri net semantics. We show that it provides for the concise translation of parallel programs and for the combination of verification techniques from process algebra and Petri nets. This is done by proving some properties of mutual exclusion algorithms.

AB - The box calculus is a process algebra with a simple Petri net semantics. We show that it provides for the concise translation of parallel programs and for the combination of verification techniques from process algebra and Petri nets. This is done by proving some properties of mutual exclusion algorithms.

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

U2 - 10.1016/0304-3975(95)00119-0

DO - 10.1016/0304-3975(95)00119-0

M3 - Article

AN - SCOPUS:0030574523

SN - 0304-3975

VL - 153

SP - 95

EP - 128

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-2

ER -

Trapping mutual exclusion in the box calculus

Abstract

Access to Document

Other files and links

Fingerprint

Cite this