Branching vs. linear time: Final showdown
From MaRDI portal
Recommendations
Cited in
(27)- A complete coalition logic of temporal knowledge for multi-agent systems
- Model-based safety assessment of a triple modular generator with xSAP
- Temporal logic with recursion
- Counterexample-preserving reduction for symbolic model checking
- On the logic of cooperation and propositional control
- Incompleteness of states w.r.t. traces in model checking
- Size-change termination and satisfiability for linear-time temporal logics
- Temporal logic and fair discrete systems
- Functional specification of hardware via temporal logic
- Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic
- Linear-Time Model Checking: Automata Theory in Practice
- Branching vs. Linear Time: Semantical Perspective
- From Philosophical to Industrial Logics
- “Sometimes” and “not never” revisited
- Sometimes and not never re-revisited: On branching versus linear time
- How linear can branching-time be?
- Linear temporal logic symbolic model checking
- Model-checking timed temporal logics
- Meanings of model checking
- From Monadic Logic to PSL
- Automata-Theoretic Model Checking Revisited
- Programming Languages and Systems
- Programming and reasoning about actors that share state
- Convex language semantics for nondeterministic probabilistic automata
- Weak, strong, and strong cyclic planning via symbolic model checking
- Branching versus linear logics yet again
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
This page was built for publication: Branching vs. linear time: Final showdown
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2771059)
