Interval logics and their decision procedures. I: An interval logic
DOI10.1016/0304-3975(95)00254-5zbMath0872.03019OpenAlexW1533229737WikidataQ127554605 ScholiaQ127554605MaRDI QIDQ671639
Y. S. Ramakrishna, G. Kutty, L. K. Dillon, 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
back-of-the envelope timing diagramsemptiness problem for Büchi automatafuture interval logicpast operatorsspecification and verification of concurrent systems
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Other applications of logic (03B80)
Related Items (4)
Cites Work
- 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
- 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
This page was built for publication: Interval logics and their decision procedures. I: An interval logic