Decidability of a partial order based temporal logic
From MaRDI portal
Publication:4630294
DOI10.1007/3-540-56939-1_104zbMath1422.03027MaRDI QIDQ4630294
P. S. Thiagarajan, Kamal Lodaya, Ramaswamy Ramanujam
Publication date: 29 March 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-56939-1_104
03B25: Decidability of theories and sets of sentences
03B35: Mechanization of proofs and logical operations
03B44: Temporal logic
Related Items
Uses Software
Cites Work
- Automata-theoretic techniques for modal logics of programs
- Decidability for branching time
- Ten Years of Hoare's Logic: A Survey—Part I
- A Perspective in Theoretical Computer Science
- TEMPORAL LOGICS FOR COMMUNICATING SEQUENTIAL AGENTS: I
- Time, clocks, and the ordering of events in a distributed system
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Models and logics for true concurrency.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item