Undecidability of partial order logics

DOI10.1016/S0020-0190(99)00005-8MaRDI QIDQ294640zbMATHFDO

Authors Rajeev Alur, Doron Peled

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019099000058?np=y

zbMATH Keywords

program verificationspecification languagesprogram correctness

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Recommendations

• The decision problem for linear temporal logic
• scientific article; zbMATH DE number 3995064
• On undecidability of propositional temporal logics on trace systems
• Publication:4864475
• Decidability and incompleteness results for first-order temporal logics of linear time

Cites work

• scientific article; zbMATH DE number 3963175 (Why is no real title available?)
• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 4112050 (Why is no real title available?)
• scientific article; zbMATH DE number 3714896 (Why is no real title available?)
• scientific article; zbMATH DE number 1223711 (Why is no real title available?)
• An expressively complete linear time temporal logic for Mazurkiewicz traces
• Modeling concurrency with partial orders
• Notes on finite asynchronous automata
• On undecidability of propositional temporal logics on trace systems
• Proving partial order properties

Cited in

(3)

• Temporal logics with incommensurable distances are undecidable
• Undecidability of compass logic
• Undecidability of the Logic of Partial Quasiary Predicates

This page was built for publication: Undecidability of partial order logics

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