scientific article; zbMATH DE number 1786650

MaRDI QIDQ4547958zbMATH OpenFDO

Authors M. Kacprzak

Publication date 21 August 2002

zbMATH Keywords

branching time temporal logiccomplete axiomatizationnondeterministie programsproof systemstrong completeness

Mathematics Subject Classification ID

Temporal logic (03B44) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Verification of temporal properties of nondeterministic algorithms
• scientific article; zbMATH DE number 17797
• scientific article; zbMATH DE number 5790393
• The temporal logic of branching time
• Complete axiomatization for projection temporal logic with finite time

Cited in

(15)

• PTL sequent calculus system
• A complete deductive-system for since-until branching-time logic
• Adequacy and complete axiomatization for timed modal logic
• Axiomatic semantics of projection temporal logic programs
• Complete axiomatization for projection temporal logic with finite time
• On Process-Algebraic Extensions of Metric Temporal Logic
• Verification of temporal properties of nondeterministic algorithms
• scientific article; zbMATH DE number 17797 (Why is no real title available?)
• scientific article; zbMATH DE number 1267564 (Why is no real title available?)
• Full Axiomatisation of Timed Processes of Interval-Timed Petri Nets
• Complete Proof System for QPTL
• scientific article; zbMATH DE number 845931 (Why is no real title available?)
• Verification of temporal properties
• A hierarchical completeness proof for propositional temporal logic
• scientific article; zbMATH DE number 2196589 (Why is no real title available?)

This page was built for publication:

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