Undecidability of partial order logics

DOI10.1016/S0020-0190(99)00005-8zbMath1338.68165MaRDI QIDQ294640

Rajeev Alur, Doron A. 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

specification languagesprogram verificationprogram 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modeling concurrency with partial orders
• On undecidability of propositional temporal logics on trace systems
• Proving partial order properties
• An expressively complete linear time temporal logic for Mazurkiewicz traces
• Notes on finite asynchronous automata

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