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

DOI10.1007/3-540-63165-8_197zbMATH Open1401.03058OpenAlexW1600123197MaRDI QIDQ4571972FDOQ4571972

Authors: David Harel, Eli Singerman 

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_197

Recommendations

• Computation paths logic: An expressive, yet elementary, process logic
• scientific article; zbMATH DE number 4055020
• scientific article; zbMATH DE number 3876574
• Deterministic process logic is elementary
• scientific article; zbMATH DE number 3909727

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Propositional dynamic logic of regular programs
• An elementary proof of the completeness of PDL
• Title not available (Why is that?)
• Process logic: Expressiveness, decidability, completeness
• Looping vs. repeating in dynamic logic
• Process logic with regular formulas
• Is the Interesting Part of Process Logic uninteresting?: A Translation from PL to PDL
• Propositional dynamic logic of flowcharts

Cited In (1)

• Title not available (Why is that?)

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

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