Interval logics and their decision procedures. I: An interval logic

DOI10.1016/0304-3975(95)00254-5zbMath0872.03019MaRDI QIDQ671639

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

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00254-5

zbMATH Keywords

back-of-the envelope timing diagrams; emptiness problem for Büchi automata; future interval logic; past operators; specification and verification of concurrent systems

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

03B45: Modal logic (including the logic of norms)

03B25: Decidability of theories and sets of sentences

03B80: Other applications of logic

Related Items

Distributed processes and location failures, Interval logics and their decision procedures. II: A real-time interval logic, Relational dual tableaux for interval temporal logics ★

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Interval logics and their decision procedures. II: A real-time interval logic
• Defining liveness
• Automata-theoretic techniques for modal logics of programs
• Recognizing safety and liveness
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Relationships between nondeterministic and deterministic tape complexities
• On theories with a combinatorial definition of 'equivalence'
• The Weak Byzantine Generals Problem
• The complexity of propositional linear temporal logics
• A propositional modal logic of time intervals
• Decidability of Second-Order Theories and Automata on Infinite Trees