The following pages link to (Q2771059):
Displaying 20 items.
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Weak, strong, and strong cyclic planning via symbolic model checking (Q814470) (← links)
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography (Q953531) (← links)
- A complete coalition logic of temporal knowledge for multi-agent systems (Q1633064) (← links)
- Model-based safety assessment of a triple modular generator with xSAP (Q2026377) (← links)
- Temporal logic with recursion (Q2051830) (← links)
- Counterexample-preserving reduction for symbolic model checking (Q2336646) (← links)
- On the logic of cooperation and propositional control (Q2457673) (← links)
- Incompleteness of states w.r.t. traces in model checking (Q2492186) (← links)
- Size-Change Termination and Satisfiability for Linear-Time Temporal Logics (Q3172880) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- Functional Specification of Hardware via Temporal Logic (Q3176382) (← links)
- Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic (Q3393380) (← links)
- Linear-Time Model Checking: Automata Theory in Practice (Q3503888) (← links)
- Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Model-checking Timed Temporal Logics (Q4982129) (← links)
- Meanings of Model Checking (Q5187832) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Automata-Theoretic Model Checking Revisited (Q5452603) (← links)
