Process logic with regular formulas

DOI10.1016/0304-3975(85)90225-7MaRDI QIDQ1062047zbMATH OpenOpenAlexFDO

Authors 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

complete axiomatizationregular expressionsslicechopdecidable propositional process logic

Mathematics Subject Classification ID

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

Recommendations

• Equations between Regular Terms and an Application to Process Logic
• Flow logic for process calculi
• A logical process calculus
• Rule formats for nominal process calculi
• Rule formats for nominal process calculi
• Dynamic process logic
• scientific article; zbMATH DE number 3878341
• Logic program forms
• scientific article; zbMATH DE number 3876574
• scientific article; zbMATH DE number 1333607

Cites work

• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 3514944 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 1032009 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• scientific article; zbMATH DE number 3315203 (Why is no real title available?)
• Algorithmic properties of structures
• An axiomatic basis for computer programming
• An elementary proof of the completeness of PDL
• Descriptively complete process logic
• Is the Interesting Part of Process Logic uninteresting?: A Translation from PL to PDL
• Process logic with regular formulas
• Process logic: Expressiveness, decidability, completeness
• Propositional dynamic logic of regular programs
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• Star-free regular sets of ω-sequences
• Temporal logic can be more expressive
• The complexity of propositional linear temporal logics
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Two results on process logic

Cited in

(12)

• Process logic with regular formulas
• scientific article; zbMATH DE number 3917687 (Why is no real title available?)
• Equations between Regular Terms and an Application to Process Logic
• Is the Interesting Part of Process Logic uninteresting?: A Translation from PL to PDL
• scientific article; zbMATH DE number 4059362 (Why is no real title available?)
• scientific article; zbMATH DE number 3966037 (Why is no real title available?)
• Computation paths logic: an expressive, yet elementary, process logic
• Computation paths logic: An expressive, yet elementary, process logic
• From Philosophical to Industrial Logics
• On the reconciliation of logics of agency and logics of event types
• Functional specification of hardware via temporal logic
• From Monadic Logic to PSL

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

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