Is the interesting part of process logic uninteresting. : A translation from PL to PDL
Journal Article
·
· SIAM J. Comput.; (United States)
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 into a program /zeta/(p) of propositional dynamic logic (PDL) such that a finite path satisfies p iff it belongs to /zeta/(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 PL are expressible in PDL. The translation, however, is of nonelementary time complexity. The significance of the result to the search for natural and powerful logics of programs is discussed.
- Research Organization:
- Department of Applied Mathematics, The Weizmann Institute of Science, Rehovot 76100
- OSTI ID:
- 6084107
- Journal Information:
- SIAM J. Comput.; (United States), Journal Name: SIAM J. Comput.; (United States) Vol. 13:4; ISSN SMJCA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Satisfiability of logic programming based on radial basis function neural networks
Quantificational logic of context
A logic-based method for integer programming
Journal Article
·
Thu Jul 10 00:00:00 EDT 2014
· AIP Conference Proceedings
·
OSTI ID:22306155
Quantificational logic of context
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:430715
A logic-based method for integer programming
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36139