On the expressive power of Dynamic Logic (Preliminary Report)
暂无分享,去创建一个
We show that “looping” of while-programs can be expressed in Regular First-Order Dynamic Logic, disproving a conjecture made in [Harel-Pratt 1978].
In addition we show that the expressive power of quantifier-free Dynamic Logic increases when nondeterminism is introduced in the programs that are part of formulae of Dynamic Logic. Allowing assignments of random values to variables increases the expressive power even further.
[1] Charles Rackoff,et al. The Emptiness Problem for Automata on Infinite Trees , 1972, SWAT.
[2] Vaughan R. Pratt,et al. SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.
[3] D. Harel. LOGICS OF PROGRAMS: AXIOMATICS AND DESCRIPTIVE POWER , 1978 .
[4] David Harel,et al. Nondeterminism in logics of programs , 1978, POPL.