scientific article; zbMATH DE number 149521
From MaRDI portal
Publication:4032313
complexitycompletenesssoundnessautomata-theoretic decision procedurelinear-time propositional temporal logicreasoning about computer systemsreasoning about concurrencysince/until temporal logic
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)
Recommendations
- scientific article; zbMATH DE number 3974944
- 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
Cited in
(9)- scientific article; zbMATH DE number 3872670 (Why is no real title available?)
- Past is for free: on the complexity of verifying linear temporal properties with past
- scientific article; zbMATH DE number 3974944 (Why is no real title available?)
- A decision procedure for combinations of propositional temporal logic and other specialized theories
- Propositional Projection Temporal Logic, B $\ddot{u}$ chi Automata and ω-Regular Expressions
- scientific article; zbMATH DE number 6423748 (Why is no real title available?)
- scientific article; zbMATH DE number 1876860 (Why is no real title available?)
- scientific article; zbMATH DE number 139828 (Why is no real title available?)
- PITL2MONA: Implementing a Decision Procedure for Propositional Interval Temporal Logic
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)
