scientific article; zbMATH DE number 512851

MaRDI QIDQ4281547zbMATH OpenFDO

Authors Wojciech Penczek

Publication date 10 March 1994

zbMATH Keywords

concurrencypartial order temporal logicstrace systems

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Distributed algorithms (68W15)

Recommendations

• Publication:4864475
• scientific article; zbMATH DE number 1059322
• On undecidability of propositional temporal logics on trace systems
• Completeness of temporal logics over infinite intervals.

Cited in

(12)

• On undecidability of propositional temporal logics on trace systems
• Completeness of temporal logics over infinite intervals.
• scientific article; zbMATH DE number 4170873 (Why is no real title available?)
• Axiomatizing Extended Temporal Logic Fragments Via Instantiation
• Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
• TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION
• scientific article; zbMATH DE number 708661 (Why is no real title available?)
• scientific article; zbMATH DE number 1059322 (Why is no real title available?)
• scientific article; zbMATH DE number 1104444 (Why is no real title available?)
• scientific article; zbMATH DE number 845931 (Why is no real title available?)
• Axioms for Obligation and Robustness with Temporal Logic
• Polynomials, fragments of temporal logic and the variety DA over traces

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 Q4281547)