A programming language for the inductive sets, and applications
Information and Control
Journal of the ACM (JACM)
And/Or Programs: A New Approach to Structured Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Results on the Propositional µ-Calculus
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Relational queries computable in polynomial time (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Decidability and expressiveness of logics of processes
Decidability and expressiveness of logics of processes
Dynamics of Approximate Information Fusion
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
$\mathcal{CL}$: An Action-Based Logic for Reasoning about Contracts
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Agents in approximate environments
Games, Actions and Social Software
| Hi-index | 0.00 |
In this paper we investigate extensions of dynamic logic tailored towards handling concurrent programs, with or without communication. The basic version of concurrent dynamic logic, CDL, is a natural extension of regular DL, and is shown to possess most desirable properties of DL. We further explore its relationships with the &mgr;-calculus, DL with recursive procedures and PTIME, strengthening natural connections between concurrency, recursion and alternation.Communication is introduced into the program schemes of CDL by means of channels and shared variables. The effects of these mechanisms on issues of expressiveness and decidability are investigated. In general, we find that both respects are dominated by the extent to which the capabilities of synchronization and (unbounded) counting are enabled in the system. Connections with actual concurrent languages such as CSP are discussed on the first-order level.