×
This reduction has two immediate corollaries: 1) validity in this PL can be tested by testing validity of formulas in PDL; 2) all state properties expressible ...
With the (necessary) condition that atomic programs in PL be binary, we present an algorithm for the translation of a PL formula X into a PDL program τ (X) ...
With the (necessary) condition that atomic programs in process logic (PL) be binary, the authors present an algorithm for the translation of a PL formula p ...
This reduction has two immediate corollaries: 1) validity in this PL can be tested by testing validity of formulas in PDL; 2) all state properties expressible ...
In this paper with an “aggressive” title, the authors described an algorithm for the translation of a formula of Process Logic (PL) into a program of ...
IS THE INTERESTING PART OF PROCESS LOGIC UNINTERESTING - A TRANSLATION FROM PL TO PDL. R SHERMAN, Amir Pnueli and David Harel Show details for 3 authors.
IS THE INTERESTING PART OF PROCESS LOGIC UNINTERESTING? A TRANSLATION FROM PL TO PDL. R. Sherman*, A. Pnueli, D. Harel. *Corresponding author for this work.
Rivi Sherman, Amir Pnueli, David Harel Is the Interesting Part of Process Logic Uninteresting — A Translation from PL to PDL POPL, 1982. POPL 1982 ...
translation algorithm from PL to PDL. However, no such translation is possible without ensuring the compatibility between models of PL and PDL. To this end ...