Pages that link to "Item:Q3766825"
From MaRDI portal
The following pages link to “Sometimes” and “not never” revisited (Q3766825):
Displaying 50 items.
- A new combination procedure for the word problem that generalizes fusion decidability results in modal logics (Q2432763) (← links)
- Verification of gap-order constraint abstractions of counter systems (Q2435309) (← links)
- Model checking abilities of agents: a closer look (Q2481560) (← links)
- Incompleteness of states w.r.t. traces in model checking (Q2492186) (← links)
- A clausal resolution method for extended computation tree logic ECTL (Q2495388) (← 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)
- Characterizing EF and EX tree logics (Q2503041) (← links)
- An axiomatization of PCTL* (Q2566222) (← links)
- Probabilistic temporal logics via the modal mu-calculus (Q2566296) (← links)
- On obligations and normative ability: Towards a logical analysis of the social contract (Q2568339) (← links)
- Relating word and tree automata (Q2576943) (← links)
- Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509) (← links)
- Interleaving set temporal logic (Q2639046) (← links)
- Unified temporal logic (Q2661764) (← links)
- Simulating and model checking membrane systems using strategies in Maude (Q2667188) (← links)
- Metalevel transformation of strategies (Q2667189) (← links)
- A tableau construction for finite linear-time temporal logic (Q2669249) (← links)
- Cooperative concurrent games (Q2680769) (← links)
- Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments (Q2817939) (← links)
- Egalitarian State-Transition Systems (Q2827838) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Verification of Gap-Order Constraint Abstractions of Counter Systems (Q2891403) (← links)
- Model-checking CTL* over flat Presburger counter systems (Q2901199) (← links)
- Branching Time? Pruning Time! (Q2908510) (← links)
- Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics (Q2919451) (← links)
- Reasoning About Strategies (Q2946746) (← links)
- Reasoning About Substructures and Games (Q2957764) (← links)
- Logics of Repeating Values on Data Trees and Branching Counter Systems (Q2988368) (← links)
- COMPUTABLE SEMANTICS FOR <i>CTL*</i> ON DISCRETE-TIME AND CONTINUOUS-SPACE DYNAMIC SYSTEMS (Q3016218) (← links)
- dCTL: A Branching Time Temporal Logic for Fault-Tolerant System Verification (Q3095236) (← links)
- Specification and Verification of Multi-Agent Systems (Q3166991) (← links)
- Introduction to Model Checking (Q3176359) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- On the Hybrid Extension of CTL and CTL + (Q3182944) (← links)
- (Q3343431) (← links)
- (Q3384161) (← links)
- (Q3384177) (← links)
- Easy Yet Hard: Model Checking Strategies of Agents (Q3393378) (← links)
- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic (Q3447697) (← links)
- A Dynamic Logic with Traces and Coinduction (Q3455778) (← links)
- Quantified Differential Temporal Dynamic Logic for Verifying Properties of Distributed Hybrid Systems (Q3455848) (← links)
- Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- Correcting a Space-Efficient Simulation Algorithm (Q3512514) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- On the Complexity of Branching-Time Logics (Q3644771) (← links)
- Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems (Q3646256) (← links)
- TTL : a formalism to describe local and global properties of distributed systems (Q3992090) (← links)
- Church's Problem Revisited (Q4262605) (← links)
