Pages that link to "Item:Q2265815"
From MaRDI portal
The following pages link to Alternative semantics for temporal logics (Q2265815):
Displaying 18 items.
- A tableau-based decision procedure for CTL\(^*\) (Q432138) (← links)
- Branching versus linear logics yet again (Q911747) (← links)
- The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
- \(R\)-generability, and definability in branching time logics (Q1197983) (← links)
- Verification of distributed programs using representative interleaving sequences (Q1200917) (← links)
- Time-extraction for temporal logic -- logic programming and local process time (Q1333399) (← links)
- Safety, liveness and fairness in temporal logic (Q1343862) (← links)
- Axiomatising extended computation tree logic (Q1389439) (← links)
- Spanning the spectrum from safety to liveness (Q1629750) (← links)
- Decision procedures and expressiveness in the temporal logic of branching time (Q2265816) (← links)
- Infinite unfair shuffles and associativity (Q2373763) (← links)
- Interleaving set temporal logic (Q2639046) (← links)
- (Q3343431) (← links)
- A Labeled Natural Deduction System for a Fragment of CTL * (Q3605539) (← links)
- TTL : a formalism to describe local and global properties of distributed systems (Q3992090) (← links)
- Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
- Reasoning about programs by exploiting the environment (Q4632437) (← links)
- Axiomatising extended computation tree logic (Q5878903) (← links)
