Concurrent program schemes and their logics

David Peleg

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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 languageEnglish
Pages (from-to)1-45
Number of pages45
JournalTheoretical Computer Science
Issue number1
StatePublished - Nov 1987
Externally publishedYes


Dive into the research topics of 'Concurrent program schemes and their logics'. Together they form a unique fingerprint.

Cite this