How linear can branching-time be?

DOI10.1007/BFB0013988MaRDI QIDQ4518423zbMATH OpenFDO

Authors Orna Grumberg, R. P. Kurshan

Publication date 28 November 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0013988

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Which branching-time properties are effectively linear?
• From linear time to branching time
• Branching vs. Linear Time: Semantical Perspective
• Branching vs. linear time: Final showdown
• Sometimes and not never re-revisited: On branching versus linear time
• From branching to linear time, coalgebraically
• From branching to linear time, coalgebraically
• Programming Languages and Systems

Cited in

(8)

• How good are branching rules in DPLL?
• Relating word and tree automata
• Which branching-time properties are effectively linear?
• Branching vs. linear time: Final showdown
• scientific article; zbMATH DE number 4016870 (Why is no real title available?)
• Branching vs. Linear Time: Semantical Perspective
• scientific article; zbMATH DE number 4119616 (Why is no real title available?)
• scientific article; zbMATH DE number 1860680 (Why is no real title available?)

This page was built for publication: How linear can branching-time be?

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