Concurrent dynamic logic
- 1 April 1987
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 34 (2) , 450-479
- https://doi.org/10.1145/23005.23008
Abstract
In this paper concurrent dynamic logic (CDL) is introduced as an extension of dynamic logic tailored toward handling concurrent programs. Properties of CDL are discussed, both on the propositional and first-order level, and the extension is shown to possess most of the desirable properties of DL. Its relationships with the &mgr;-calculus, game logic, DL with recursive procedures, and PTIME are further explored, revealing natural connections between concurrency, recursion, and alternation.Keywords
This publication has 18 references indexed in Scilit:
- More on looping vs. repeating in dynamic logicInformation Processing Letters, 1985
- Process logic with regular formulasTheoretical Computer Science, 1985
- A programming language for the inductive sets, and applicationsInformation and Control, 1984
- On static logics, dynamic logics, and complexity classesInformation and Control, 1984
- Process logic: Expressiveness, decidability, completenessJournal of Computer and System Sciences, 1982
- Results on the propositional μ-calculusPublished by Springer Nature ,1982
- AlternationJournal of the ACM, 1981
- And/Or Programs: A New Approach to Structured ProgrammingACM Transactions on Programming Languages and Systems, 1980
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979
- The correctness of nondeterministic programsArtificial Intelligence, 1970