scientific article

zbMATH Open0761.03005MaRDI QIDQ4032313FDOQ4032313

L. E. Moser, P. M. Melliar-Smith, L. K. Dillon, Y. S. Ramakrishna, G. Kutty

Publication date: 1 April 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

complexitycompletenesssoundnessautomata-theoretic decision procedurelinear-time propositional temporal logicreasoning about computer systemsreasoning about concurrencysince/until temporal logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Symbolic computation and algebraic computation (68W30) Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Cited In (8)

• Propositional Projection Temporal Logic, B $\ddot{u}$ chi Automata and ω-Regular Expressions
• Title not available (Why is that?)
• Past is for free: on the complexity of verifying linear temporal properties with past
• Title not available (Why is that?)
• Title not available (Why is that?)
• PITL2MONA: Implementing a Decision Procedure for Propositional Interval Temporal Logic
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Decision procedures and expressiveness in the temporal logic of branching time 👍 👎
• The complexity of the temporal logic with ``until over general linear time 👍 👎
• Propositional temporal logics: decidability and completeness 👍 👎
• A decision procedure for combinations of propositional temporal logic and other specialized theories 👍 👎

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