Process logic with regular formulas

DOI10.1016/0304-3975(85)90225-7zbMath0572.03010OpenAlexW2044206530MaRDI QIDQ1062047

David Harel, David Peleg

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90225-7

zbMATH Keywords

regular expressionsslicecomplete axiomatizationchopdecidable propositional process logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65)

Related Items (7)

Functional Specification of Hardware via Temporal Logic ⋮ From Philosophical to Industrial Logics ⋮ From Monadic Logic to PSL ⋮ On the Reconciliation of Logics of Agency and Logics of Event Types ⋮ Computation paths logic: An expressive, yet elementary, process logic ⋮ Computation paths logic: An expressive, yet elementary, process logic ⋮ Process logic with regular formulas

Cites Work

• Two results on process logic
• Process logic with regular formulas
• Descriptively complete process logic
• An elementary proof of the completeness of PDL
• Process logic: Expressiveness, decidability, completeness
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Propositional dynamic logic of regular programs
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• Temporal logic can be more expressive
• Is the Interesting Part of Process Logic uninteresting?: A Translation from PL to PDL
• The complexity of propositional linear temporal logics
• Star-free regular sets of ω-sequences
• An axiomatic basis for computer programming
• Algorithmic properties of structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Process logic with regular formulas