Communication in concurrent dynamic logic

Abrahamson, 1980, Decidability and Expressiveness of Logics of Processes

Apt, 1980, A Proof System for Communicating Sequential Processes, Vol. 2

Barringer, 1984, Now you may compose temporal logic specification, 51

Chandra, 1974, The Power of Parallelism and Nondeterminism in Programming, IFIP, 461

Chandra, 1981, Alternation, J. Assoc. Comput. Mach., 28, 114, 10.1145/322234.322243

Processes,” Tech. Report No. TR-98, University of Texas.

Clocksin, 1981

Francez, 1979, Semantics of nondeterminism, concurrency, and communication, J. Comput. System Sci., 19, 290, 10.1016/0022-0000(79)90006-0

Fischer, 1979, Propositional Dynamic Logic of Regular Programs, J. Comput. System Sci., 18, 194, 10.1016/0022-0000(79)90046-1

Francez, 1980, A linear history semantics for distributed languages, 143

Harel, 1984, dynamic logic, 497

Harel, 1986, Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness, J. Assoc. Comput. Mach., 33, 224, 10.1145/4904.4993

Harel, 1985, Recurring dominoes: Making the highly undecidable highly understandable, Annals Discrete Math., 24, 51

Harel, 1980, And/Or Programs: a New Approach to Structured Programming, Vol. 2, 1

Hoare, 1978, Communicating sequential processes, Comm. ACM, 21, 666, 10.1145/359576.359585

Hoare, 1981, A Theory of Communicating Processes

Harel, 1985, A programming language for the inductive sets, and applications, Inform. and Control, 63, 118, 10.1016/S0019-9958(84)80045-5

No. CS82-09, The Weizmann Institute of Science, Rehobot, Israel, revised version Sci. Comput. Programming, in press.

Harel, 1983, Propositional dynamic logic of nonregular programs, J. Comput. System Sci., 26, 222, 10.1016/0022-0000(83)90014-4

Kowalski, 1983, Logic for Problem Solving

Manna, 1970, The correctness of nondeterministic programs, Artificial Intelligence, 1, 1, 10.1016/0004-3702(70)90002-0

Milner, 1980, A Calculus of Communicating Systems, Vol. 92

Manna, 1982, Verification of concurrent programs: The temporal framework, 215

Manna, 1982, Verification of concurrent programs: Temporal proof principles, Vol. 131, 200

Milne, 1979, Concurrent processes and their syntax, J. Assoc. Comput. Mach., 26, 302, 10.1145/322123.322134

Meyer, 1981, Definability in dynamic logic, J. Comput. System Sci., 23, 279, 10.1016/0022-0000(81)90016-7

Peleg, 1987, Concurrent Dynamic Logic, J. Assoc. Comput. Mach., 10.1145/23005.23008

Peleg, 1984

Peleg, 1984

Pnueli, 1977, The temporal logic of programs, 46

Weizmann Institute of Science, Rehovot, Israel.

Shapiro, 1984, Alternation and the computational complexity of logic programs, J. Logic Programming, 1, 10.1016/0743-1066(84)90021-9

Streett, 1982, Propositional logic of looping and converse is elementarily decidable, Inform. and Control, 54, 121, 10.1016/S0019-9958(82)91258-X

Tiomkin, 1983, Extensions of Propostional Dynamic Logic