Equations between regular terms and an application to process logic
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Temporal reasoning and termination of programs
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Transaction logic with external actions
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
A proposal for transactions in the semantic web
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
Compositionality of fixpoint logic with chop
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Hi-index | 0.00 |
We define a process logic PL 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). We give a deductive system for PL which includes the Segerberg axioms for PDL and prove that it is complete. We also show that PL is decidable.