Relation-based semantics for concurrency

N. Boudriga; Y. Slimani; A. Mili

doi:10.1016/0020-0255(93)90056-R

Relation-based semantics for concurrency

N. Boudriga, Y. Slimani, A. Mili

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

Abstract

Despite several decades of research, capturing the semantics of concurrent programs in a crisp and tractable fashion remains a formidable challenge. In this paper, we present a relation-based model for defining the semantics of concurrent programs. Although it is still in its enfancy, this model shows some advantageous features, which make it worthy of further investigation.

Original language	English (US)
Pages (from-to)	223-252
Number of pages	30
Journal	Information sciences
Volume	75
Issue number	3
DOIs	https://doi.org/10.1016/0020-0255(93)90056-R
State	Published - Dec 15 1993
Externally published	Yes

All Science Journal Classification (ASJC) codes

Software
Control and Systems Engineering
Theoretical Computer Science
Computer Science Applications
Information Systems and Management
Artificial Intelligence

Access to Document

10.1016/0020-0255(93)90056-R

Cite this

@article{952ff40407e444769df804cd22caea50,

title = "Relation-based semantics for concurrency",

abstract = "Despite several decades of research, capturing the semantics of concurrent programs in a crisp and tractable fashion remains a formidable challenge. In this paper, we present a relation-based model for defining the semantics of concurrent programs. Although it is still in its enfancy, this model shows some advantageous features, which make it worthy of further investigation.",

author = "N. Boudriga and Y. Slimani and A. Mili",

year = "1993",

month = dec,

day = "15",

doi = "10.1016/0020-0255(93)90056-R",

language = "English (US)",

volume = "75",

pages = "223--252",

journal = "Information sciences",

issn = "0020-0255",

publisher = "Elsevier Inc.",

number = "3",

}

TY - JOUR

T1 - Relation-based semantics for concurrency

AU - Boudriga, N.

AU - Slimani, Y.

AU - Mili, A.

PY - 1993/12/15

Y1 - 1993/12/15

N2 - Despite several decades of research, capturing the semantics of concurrent programs in a crisp and tractable fashion remains a formidable challenge. In this paper, we present a relation-based model for defining the semantics of concurrent programs. Although it is still in its enfancy, this model shows some advantageous features, which make it worthy of further investigation.

AB - Despite several decades of research, capturing the semantics of concurrent programs in a crisp and tractable fashion remains a formidable challenge. In this paper, we present a relation-based model for defining the semantics of concurrent programs. Although it is still in its enfancy, this model shows some advantageous features, which make it worthy of further investigation.

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

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

U2 - 10.1016/0020-0255(93)90056-R

DO - 10.1016/0020-0255(93)90056-R

M3 - Article

AN - SCOPUS:0027886521

SN - 0020-0255

VL - 75

SP - 223

EP - 252

JO - Information sciences

JF - Information sciences

IS - 3

ER -

Relation-based semantics for concurrency

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this