On undecidability of propositional temporal logics on trace systems

DOI10.1016/0020-0190(92)90007-IzbMath0771.03006MaRDI QIDQ1199555

Wojciech Penczek

Publication date: 16 January 1993

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

zbMATH Keywords

satisfiabilityexpressive powerconcurrencyconcurrent actionpartial order temporal logicstrace systems

Mathematics Subject Classification ID

Decidability and field theory (12L05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Other applications of logic (03B80)

Related Items (6)

Logics and decidability for labelled pre- and partially ordered Kripke structures ⋮ The decidability border of hereditary history preserving bisimilarity ⋮ Undecidability of partial order logics ⋮ Towards automata for branching time and partial order ⋮ Deciding global partial-order properties ⋮ Difficult configurations -- on the complexity of LTrL

Cites Work

• Using branching time temporal logic to synthesize synchronization skeletons
• Concurrent systems and inevitability
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• Synthesis of Communicating Processes from Temporal Logic Specifications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On undecidability of propositional temporal logics on trace systems