Concurrent program schemes and their logics

David Peleg

doi:10.1016/0304-3975(87)90088-0

Concurrent program schemes and their logics

David Peleg

Weizmann Institute of Science

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

1 Scopus citations

Abstract

We define and investigate several classes of concurrent program schemes, including goto schemes and two versions of structured schemes, based on extensions of the regular expressions to trees. The schemes are studied on the first-order, Boolean-variable and propositional levels. We also define and study the dynamic logics based on these classes of schemes, including issues of decidability and axiomatization.

Original language	English
Pages (from-to)	1-45
Number of pages	45
Journal	Theoretical Computer Science
Volume	55
Issue number	1
DOIs	https://doi.org/10.1016/0304-3975(87)90088-0
State	Published - Nov 1987
Externally published	Yes

Access to Document

10.1016/0304-3975(87)90088-0

Cite this

@article{1d4c20cece05489b91a994b7ea9aa6bb,

title = "Concurrent program schemes and their logics",

abstract = "We define and investigate several classes of concurrent program schemes, including goto schemes and two versions of structured schemes, based on extensions of the regular expressions to trees. The schemes are studied on the first-order, Boolean-variable and propositional levels. We also define and study the dynamic logics based on these classes of schemes, including issues of decidability and axiomatization.",

author = "David Peleg",

year = "1987",

month = nov,

doi = "10.1016/0304-3975(87)90088-0",

language = "אנגלית",

volume = "55",

pages = "1--45",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Concurrent program schemes and their logics

AU - Peleg, David

PY - 1987/11

Y1 - 1987/11

N2 - We define and investigate several classes of concurrent program schemes, including goto schemes and two versions of structured schemes, based on extensions of the regular expressions to trees. The schemes are studied on the first-order, Boolean-variable and propositional levels. We also define and study the dynamic logics based on these classes of schemes, including issues of decidability and axiomatization.

AB - We define and investigate several classes of concurrent program schemes, including goto schemes and two versions of structured schemes, based on extensions of the regular expressions to trees. The schemes are studied on the first-order, Boolean-variable and propositional levels. We also define and study the dynamic logics based on these classes of schemes, including issues of decidability and axiomatization.

UR - https://www.scopus.com/pages/publications/0023452142

U2 - 10.1016/0304-3975(87)90088-0

DO - 10.1016/0304-3975(87)90088-0

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0023452142

SN - 0304-3975

VL - 55

SP - 1

EP - 45

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1

ER -

Concurrent program schemes and their logics

Abstract

Access to Document

Other files and links

Fingerprint

Cite this