Process logic: Expressiveness, decidability, completeness

DOI10.1016/0022-0000(82)90003-4MaRDI QIDQ1168965zbMATH OpenOpenAlexFDO

Authors David Harel, Dexter Kozen, Rohit Parikh

Publication date 1982

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(82)90003-4

zbMATH Keywords

axiomatizationtemporal logicprocess logicextending propositional dynamic logic

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65)

Cites work

• scientific article; zbMATH DE number 3704559 (Why is no real title available?)
• scientific article; zbMATH DE number 3729438 (Why is no real title available?)
• scientific article; zbMATH DE number 3510287 (Why is no real title available?)
• scientific article; zbMATH DE number 3558938 (Why is no real title available?)
• scientific article; zbMATH DE number 3624762 (Why is no real title available?)
• scientific article; zbMATH DE number 3628347 (Why is no real title available?)
• scientific article; zbMATH DE number 3299715 (Why is no real title available?)
• scientific article; zbMATH DE number 3315203 (Why is no real title available?)
• A near-optimal method for reasoning about action
• A practical decision method for propositional dynamic logic (preliminary report)
• An elementary proof of the completeness of PDL
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Definability in dynamic logic
• Descriptively complete process logic
• Equations between Regular Terms and an Application to Process Logic
• First-order dynamic logic
• Propositional dynamic logic of regular programs
• Two results on process logic

Cited in

(31)

• A survey on temporal logics for specifying and verifying real-time systems
• Dynamic linear time temporal logic
• A dynamic logic with branching modalities
• Modal logic for modelling actions and agents
• Computation paths logic: an expressive, yet elementary, process logic
• Strategies in games: a logic-automata study
• Computation paths logic: An expressive, yet elementary, process logic
• Compositional reasoning using intervals and time reversal
• Computable execution traces
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• A decision procedure for propositional projection temporal logic with infinite models
• Mathematical modal logic: A view of its evolution
• On proving properties of completion strategies
• Calculational design of a regular model checker by abstract interpretation
• An overview of transaction logic
• Natural strategic ability
• From Monadic Logic to PSL
• Compositionality of Hennessy-Milner logic by structural operational semantics
• Functional specification of hardware via temporal logic
• A program logic to verify signal temporal logic specifications of hybrid systems
• Branching versus linear logics yet again
• From Philosophical to Industrial Logics
• Complexity of propositional projection temporal logic with star
• Alternative semantics for temporal logics
• Trace Semantics for IPDL
• A simple deduction method for modal logic
• R-generability, and definability in branching time logics
• Process logic with regular formulas
• Process and action: Relevant theory and logics
• Execution trace sets for real computation
• The complementation problem for Büchi automata with applications to temporal logic

This page was built for publication: Process logic: Expressiveness, decidability, completeness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168965)