Determinism and non-determinism in PDL (Q1177157)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Determinism and non-determinism in PDL |
scientific article; zbMATH DE number 20014
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determinism and non-determinism in PDL |
scientific article; zbMATH DE number 20014 |
Statements
Determinism and non-determinism in PDL (English)
0 references
26 June 1992
0 references
In a previous paper of the author it is proven that if we add the iteration to SPDL (strict propositional dynamic logic) then the new system has the same expressive power as PDL (propositional dynamic logic). Under review the case of nondeterminism is studied. The main theorem of the paper claims that if we add the nondeterministic choice to SPDL then the new system has less expressive power than PDL. In the last section of the paper the author defines a new system PPL (propositional program logic) by adding to SPDL the nondeterministic choice and propositional variables and it is proven that the system PPL and PDL have the same expressive power.
0 references
strict propositional dynamic logic
0 references
propositional dynamic logic
0 references