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 - http://www.scopus.com/inward/record.url?scp=0023452142&partnerID=8YFLogxK
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 -