Pages that link to "Item:Q3719811"

The following pages link to Automatic verification of finite-state concurrent systems using temporal logic specifications (Q3719811):

Displaying 50 items.

• Exogenous probabilistic computation tree logic (Q2870286) (← links)
• Characteristic formulae for fixed-point semantics: a general framework (Q2883115) (← links)
• Complexity of Model Checking for Modal Dependence Logic (Q2891371) (← links)
• Using Evolution Graphs for Describing Topology-Aware Prediction Models in Large Clusters (Q2915044) (← links)
• Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization (Q2944566) (← links)
• Reasoning About Substructures and Games (Q2957764) (← links)
• COMPUTABLE SEMANTICS FOR <i>CTL*</i> ON DISCRETE-TIME AND CONTINUOUS-SPACE DYNAMIC SYSTEMS (Q3016218) (← links)
• FSP and FLTL framework for specification and verification of middle-agents (Q3016270) (← links)
• AN EXPRESSIVE EXTENSION OF TLC (Q3021958) (← links)
• Well (and Better) Quasi-Ordered Transition Systems (Q3067860) (← links)
• dCTL: A Branching Time Temporal Logic for Fault-Tolerant System Verification (Q3095236) (← links)
• Secure information flow by self-composition (Q3103613) (← links)
• Specification and Verification of Multi-Agent Systems (Q3166991) (← links)
• Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
• BDD-Based Symbolic Model Checking (Q3176366) (← links)
• Combining Model Checking and Testing (Q3176377) (← links)
• Model Checking Real-Time Systems (Q3176387) (← links)
• Verifying Systems of Resource-Bounded Agents (Q3188235) (← links)
• Proving Failure-Free Properties of Concurrent Systems Using Temporal Logic (Q3321430) (← links)
• Easy Yet Hard: Model Checking Strategies of Agents (Q3393378) (← links)
• Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall (Q3393383) (← links)
• Model Checking Value-Passing Modal Specifications (Q3455083) (← links)
• Linear-Time Model Checking: Automata Theory in Practice (Q3503888) (← links)
• Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
• Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
• The Birth of Model Checking (Q3512430) (← links)
• New Challenges in Model Checking (Q3512433) (← links)
• ATL* Satisfiability Is 2EXPTIME-Complete (Q3519515) (← links)
• Data Flow Analysis and Testing of Abstract State Machines (Q3535367) (← links)
• Inf-datalog, Modal Logic and Complexities (Q3549285) (← links)
• An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
• From Philosophical to Industrial Logics (Q3601803) (← links)
• A Logic for Reasoning about Rational Agents (Q3602940) (← links)
• Formal Verification for Components and Connectors (Q3638992) (← links)
• THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆ (Q3646173) (← links)
• Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems (Q3646256) (← links)
• BDD-based decision procedures for the modal logic K ★ (Q3647260) (← links)
• Constructive knowledge: what agents can achieve under imperfect information (Q3647280) (← links)
• Quantitative Analysis under Fairness Constraints (Q3648696) (← links)
• (Q3972532) (← links)
• TTL : a formalism to describe local and global properties of distributed systems (Q3992090) (← links)
• (Q4037371) (← links)
• TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION (Q4275182) (← links)
• On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
• A clausal resolution method for CTL branching-time temporal logic (Q4421285) (← links)
• (Q4499210) (← links)
• Symbolic model checking for probabilistic processes (Q4571974) (← links)
• Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
• Proving correctness of labeled transition systems by semantic tableaux (Q4610332) (← links)
• Local model checking for context-free processes (Q4630295) (← links)