Pages that link to "Item:Q789895"

The following pages link to The temporal logic of branching time (Q789895):

Displaying 41 items.

• Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
• Axiomatization of a branching time logic with indistinguishability relations (Q288245) (← links)
• The modeling library of eavesdropping methods in quantum cryptography protocols by model checking (Q518056) (← links)
• A hierarchy of temporal logics with past (Q672329) (← links)
• The expressive power of implicit specifications (Q685409) (← links)
• Encapsulating deontic and branching time specifications (Q714879) (← links)
• The temporal logic of branching time (Q789895) (← links)
• Branching versus linear logics yet again (Q911747) (← links)
• Proof systems for satisfiability in Hennessy-Milner logic with recursion (Q912592) (← links)
• SnS can be modally characterized (Q914397) (← links)
• Deductive verification of alternating systems (Q939163) (← links)
• Branching-time logics repeatedly referring to states (Q1047801) (← links)
• A multiprocess network logic with temporal and spatial modalities (Q1058846) (← links)
• Synthesis of communicating process skeletons from temporal-spatial logic specifications (Q1116944) (← links)
• Characterizing finite Kripke structures in propositional temporal logic (Q1123183) (← links)
• TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
• Formal timing analysis of distributed systems (Q1193762) (← links)
• CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
• Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL (Q1395428) (← links)
• Mathematical modal logic: A view of its evolution (Q1422628) (← links)
• Quantitative program logic and expected time bounds in probabilistic distributed algorithms. (Q1603711) (← links)
• An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
• Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models (Q2095426) (← links)
• Automatic and hierarchical verification for concurrent systems (Q2277847) (← links)
• A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
• 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)
• 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)
• Interleaving set temporal logic (Q2639046) (← links)
• Exogenous Probabilistic Computation Tree Logic (Q2870286) (← links)
• A Compositional Automata-based Approach for Model Checking Multi-Agent Systems (Q2873614) (← links)
• Temporal Specifications with Accumulative Values (Q2946736) (← links)
• Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
• Proving correctness of labeled transition systems by semantic tableaux (Q4610332) (← links)
• An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability (Q4982121) (← links)
• Quantifying Bounds in Strategy Logic (Q5079747) (← links)
• One-pass Context-based Tableaux Systems for CTL and ECTL (Q6060101) (← links)