Propositional dynamic logic of flowcharts
D Harel, R Sherman - Information and Control, 1985 - Elsevier
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs
are nondeterministic finite automata over atomic programs and tests (ie, flowcharts), rather
than regular expressions. While the resulting version of PDL, call it APDL, is clearly
equivalent in expressive power to PDL, it is also (in the worst case) exponentially more
succinct. In particular, deciding its validity problem by reducing it to that of PDL leads to a
double exponential time procedure, although PDL itself is decidable in exponential time. We …
are nondeterministic finite automata over atomic programs and tests (ie, flowcharts), rather
than regular expressions. While the resulting version of PDL, call it APDL, is clearly
equivalent in expressive power to PDL, it is also (in the worst case) exponentially more
succinct. In particular, deciding its validity problem by reducing it to that of PDL leads to a
double exponential time procedure, although PDL itself is decidable in exponential time. We …
Propositional dynamic logic of flowcharts
D Harel, R Sherman - International Conference on Fundamentals of …, 1983 - Springer
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs
are nondeterministic finite automata over atomic programs and tests (ie, flowcharts), rather
than regular expressions. While the resulting version of PDL, call it APDL, is clearly
equivalent in expressive power to PDL, it is also (in the worst case) exponentially more
succinct. In particular, deciding its validity problem by reducing it to that of PDL leads to a
double exponential time procedure, although PDL itself is decidable in exponential time. We …
are nondeterministic finite automata over atomic programs and tests (ie, flowcharts), rather
than regular expressions. While the resulting version of PDL, call it APDL, is clearly
equivalent in expressive power to PDL, it is also (in the worst case) exponentially more
succinct. In particular, deciding its validity problem by reducing it to that of PDL leads to a
double exponential time procedure, although PDL itself is decidable in exponential time. We …
Showing the best results for this search. See all results