Two results on process logic
Reference (4)
- et al.
Nondeterminism in logics of programs
Proc. 5th ACM Symp. on Principles of Programming Languages
(Jan. 1978) A decidability result for a second order process logic
Proc. 19th IEEE Symp. on Foundations of Computer Science
(Oct. 1978)
There are more references available in the full text version of this article.
Cited by (13)
Process logic with regular formulas
1985, Theoretical Computer ScienceDeterministic process logic is elementary
1983, Information and ControlProcess logic: Expressiveness, decidability, completeness
1982, Journal of Computer and System SciencesDecidability in pratt's process logics
1986, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Model theory of propositional logics of programs, some open problems
1985, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Process logics: Two decidability results
1984, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1979 Published by Elsevier B.V.