Pages that link to "Item:Q789895"
From MaRDI portal
The following pages link to The temporal logic of branching time (Q789895):
Displaying 50 items.
- A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations (Q2401638) (← links)
- To be fair, use bundles (Q2408744) (← links)
- Model checking open systems with alternating projection temporal logic (Q2424878) (← links)
- A propositional linear time logic with time flow isomorphic to \(\omega^2\) (Q2447179) (← links)
- On temporal logic S4Dbr (Q2471628) (← links)
- A multiset-based model of synchronizing agents: Computability and robustness (Q2474434) (← links)
- Characterizing CTL-like logics on finite trees. (Q2490815) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- Quantification over sets of possible worlds in branching-time semantics (Q2500778) (← links)
- Interleaving set temporal logic (Q2639046) (← links)
- Prediction in branching time logic (Q2720329) (← links)
- Extensions of the branching-time logic programming language CACTUS (Q2758304) (← links)
- Weak completeness theorem for propositional linear time temporal logic (Q2852161) (← links)
- Exogenous probabilistic computation tree logic (Q2870286) (← links)
- A compositional automata-based approach for model checking multi-agent systems (Q2873614) (← links)
- On Hamblin's 15 Tense Theorem (Q2901190) (← links)
- Temporal Specifications with Accumulative Values (Q2946736) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- One-Pass Tableaux for Computation Tree Logic (Q3498455) (← links)
- Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC (Q3512441) (← links)
- SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR (Q3512442) (← links)
- Branching-time type operators on finite pseudo-Boolean algebras (Q3546132) (← links)
- On the Complexity of Branching-Time Logics (Q3644771) (← links)
- (Q3757893) (← links)
- TTL : a formalism to describe local and global properties of distributed systems (Q3992090) (← links)
- Non-definability of the class of complete bundled trees (Q4238504) (← links)
- Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL (Q4276172) (← links)
- On Binary Computation Structures (Q4336700) (← links)
- Proving correctness of labeled transition systems by semantic tableaux (Q4610332) (← links)
- A tableau calculus for first-order branching time logic (Q4632314) (← links)
- (Q4733384) (← links)
- A Branching Time Logical System for Open Distributed Systems Development (Q4916209) (← links)
- Model Theoretic Syntax and Parsing (Q4923571) (← links)
- (Q4929426) (← links)
- (Q4941936) (← links)
- An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability (Q4982121) (← links)
- (Q5015285) (← links)
- A propositional dense time logic (Q5044765) (← links)
- Quantifying Bounds in Strategy Logic (Q5079747) (← links)
- Meanings of Model Checking (Q5187832) (← links)
- Optimal Tableau Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-Time Temporal Logic ATL <sup>+</sup> (Q5277905) (← links)
- Hybrid Systems: Computation and Control (Q5307929) (← links)
- (Q5365522) (← links)
- A resolution calculus for the branching-time temporal logic CTL (Q5410337) (← links)
- On the Satisfiability and Model Checking for one Parameterized Extension of Linear-time Temporal Logic (Q5870862) (← links)
- Correct Hardware Design and Verification Methods (Q5897075) (← links)
- One-pass Context-based Tableaux Systems for CTL and ECTL (Q6060101) (← links)
- Probabilistic Verification of Neural Networks Against Group Fairness (Q6488462) (← links)
