by David Harel, Dexter Kozen, Rohit Parikh
http://www.wisdom.weizmann.ac.il/~dharel/SCANNED.PAPERS/ProcessLogic.pdf
Add To MetaCart
Abstract:
A process logic (PL) is defined that subsumes Pratt's process logic, Parikh's SOAPL, Nishimura's process logic, and Pnueli's Temporal Logic in expressiveness. The language of PL is an extension of the language of Propositional Dynamic Logic (PDL). A deductive system for PL is given which includes the Segerberg axioms for PDL and it is proved that it is complete. It is also shown that PL is decidable. 1.
Citations
|
809
|
The temporal logic of programs
– Pnueli
- 1977
|
|
285
|
Propositional dynamic logic of regular programs
– Fischer, Ladner
- 1979
|
|
210
|
On the temporal analysis of fairness
– Gabbay, Pnueli, et al.
- 1980
|
|
192
|
Decidability of second-order theories and automata on infinite trees
– Rabin
- 1969
|
|
189
|
Tense Logic and the Theory of Linear Order
– Kamp
- 1968
|
|
155
|
Considerations on floyd-hoare logic
– Pratt
- 1976
|
|
81
|
Models of program logic
– Pratt
- 1979
|
|
34
|
A completeness theorem in the modal logic of programs
– Segerberg
- 1977
|
|
30
|
A near-optimal method for reasoning about action
– Pratt
- 1980
|
|
28
|
A practical decision method for propositional dynamic logic
– Pratt
- 1978
|
|
27
|
Process logic
– Pratt
- 1979
|
|
13
|
Dynamic algebras and the nature of induction
– PRATT
- 1980
|
|
11
|
On the duality of dynamic algebras and Kripke models
– Kozen
- 1981
|
|
10
|
A representation theorem for models of -free PDL
– Kozen
- 1980
|
|
8
|
An elementary proof of the completeness of PDL. Theoret
– Kozen, Parikh
- 1981
|
|
8
|
Descriptively complete process logic
– Nishimura
- 1980
|
|
4
|
Definability in dynamic logic
– Meyer, Parikh
- 1981
|
|
2
|
Axiomatizations of Logics of Programs, manuscript
– GABBAY
- 1977
|
|
2
|
On the Representation of Dynamic Algebras
– KOZEN
- 1979
|
|
2
|
On the Representation of Dynamic Algebras II
– KOZEN
- 1980
|
|
1
|
RASlOWA AND A. SALWICKI, "An introduction to Algorithmic Logic
– BANACHOWSKI, KRECZMAR, et al.
- 1977
|
|
1
|
Finite models of deterministic propositional dynamic logic
– BN-Am, HALPRN, et al.
- 1981
|
|
1
|
Equations between regular terms and an application to
– CHANDRA, HALPERN, et al.
- 1981
|
|
1
|
First-Order Dynamic logic, "Lecture Notes in Computer Science 68" (Goos and Hartlmanis
– HAaL
- 1979
|
|
1
|
Two results on process logic
– HAREL
- 1979
|
|
1
|
Weak monadie second order theory of successor is not elementary recursive
– MEYER
|
|
1
|
Ten thousand and one logics of programming
– MEYER
|
|
1
|
A completeness result for PDL, in "Symp
– PAmKH
- 1978
|
|
1
|
A decidability result for second order process logic
– PARroll
- 1978
|
|
1
|
The temporal semantics of concurrent programs
– PSUELI
- 1979
|
|
1
|
Formalized algorithmic languages
– SALWlCKI
- 1970
|
|
1
|
Logic of Effective Definitions," manuscript
– TIURYN
- 1979
|
