Computation paths logic: An expressive, yet elementary, process logic

DOI10.1016/S0168-0072(98)00038-4zbMath0931.03044MaRDI QIDQ1295436

David Harel, Eli Singerman

Publication date: 20 July 1999

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

dynamic logictemporal logicconcurrent processesconcurrencyprocess logiccomputation paths logicelementary decidabilityexpressing properties of infinite computations

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Process logic with regular formulas
• An elementary proof of the completeness of PDL
• A calculus of communicating systems
• Process logic: Expressiveness, decidability, completeness
• Propositional dynamic logic of regular programs
• Looping vs. repeating in dynamic logic
• Is the Interesting Part of Process Logic uninteresting?: A Translation from PL to PDL
• Propositional dynamic logic of flowcharts

This page was built for publication: Computation paths logic: An expressive, yet elementary, process logic