Algorithmic properties of branching-time logics

MaRDI QIDQ2922686zbMATH OpenFDO

Authors Sebastian Bauer

Publication date 14 October 2014

Full work available at URL http://d-nb.info/983028249/34

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Cited in

(8)

• Sublogics of a branching time logic of robustness
• On the expressive power of hybrid branching-time logics
• Linear time Datalog and branching time logic
• scientific article; zbMATH DE number 4006233 (Why is no real title available?)
• scientific article; zbMATH DE number 6806035 (Why is no real title available?)
• Algebraic and logical characterizations of deterministic linear time classes
• On Computability of Logical Approaches to Branching-Time Property Verification of Programs
• Completeness of a branching-time logic with possible choices

This page was built for publication: Algorithmic properties of branching-time logics

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