TY - JOUR
T1 - Process logic with regular formulas
AU - Harel, D.
AU - Peleg, D.
PY - 1985
Y1 - 1985
N2 - The paper proposes an extension RPL of the process logic PL of Harel, Kozen and Parikh (1980). The PL formula operators f and suf are replaced by the operators chop and slice, corresponding to Kleene's regular operators · and *, thus enabling formulas to express regular sets of paths. The main result is that, in expressive power, PL<RPL, the hard part being in showing that PL≤RPL. It is argued that this version of PL comes closer to the desired goal of a natural and powerful (yet decidable) logic for reasoning about the ongoing behavior of programs.
AB - The paper proposes an extension RPL of the process logic PL of Harel, Kozen and Parikh (1980). The PL formula operators f and suf are replaced by the operators chop and slice, corresponding to Kleene's regular operators · and *, thus enabling formulas to express regular sets of paths. The main result is that, in expressive power, PL<RPL, the hard part being in showing that PL≤RPL. It is argued that this version of PL comes closer to the desired goal of a natural and powerful (yet decidable) logic for reasoning about the ongoing behavior of programs.
UR - http://www.scopus.com/inward/record.url?scp=0021934868&partnerID=8YFLogxK
U2 - 10.1016/0304-3975(85)90225-7
DO - 10.1016/0304-3975(85)90225-7
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0021934868
SN - 0304-3975
VL - 38
SP - 307
EP - 322
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - C
ER -