Pages that link to "Item:Q3722471"
From MaRDI portal
The following pages link to Deciding full branching time logic (Q3722471):
Displaying 50 items.
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- A tableau-based decision procedure for CTL\(^*\) (Q432138) (← links)
- Complexity of synthesis of composite service with correctness guarantee (Q439758) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- Completeness of a branching-time logic with possible choices (Q622622) (← links)
- Verification of multi-agent systems with public actions against strategy logic (Q785241) (← links)
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic (Q860862) (← links)
- A clausal resolution method for branching-time logic \(\text{ECTL}^+\) (Q862827) (← links)
- An optimal decision procedure for right propositional neighborhood logic (Q877892) (← links)
- Automata-theoretic techniques for modal logics of programs (Q1090675) (← links)
- A decision procedure for combinations of propositional temporal logic and other specialized theories (Q1097264) (← links)
- Uniform inevitability is tree automaton ineffable (Q1108048) (← links)
- Characterizing finite Kripke structures in propositional temporal logic (Q1123183) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- A model checker for linear time temporal logic (Q1192606) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- A branching time logic with past operators (Q1337463) (← links)
- Determinization and memoryless winning strategies (Q1357005) (← links)
- Axiomatising extended computation tree logic (Q1389439) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- Inconsistency-tolerant temporal reasoning with hierarchical information (Q1749966) (← links)
- CTL\(^\ast\) with graded path modalities (Q1784942) (← links)
- Module checking (Q1854407) (← links)
- A transformation-based synthesis of temporal specification (Q1906037) (← links)
- A propositional probabilistic logic with discrete linear time for reasoning about evidence (Q1928821) (← links)
- Branching time agents logics, satisfiability problem by rules in reduced form (Q2331127) (← links)
- A logic with revocable and refinable strategies (Q2346411) (← links)
- A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
- To be fair, use bundles (Q2408744) (← links)
- A clausal resolution method for extended computation tree logic ECTL (Q2495388) (← links)
- An axiomatization of PCTL* (Q2566222) (← links)
- Relating word and tree automata (Q2576943) (← links)
- An axiomatization of full Computation Tree Logic (Q2758043) (← links)
- A Rooted Tableau for BCTL* (Q2825414) (← links)
- Decidability and Expressivity of Ockhamist Propositional Dynamic Logics (Q2835868) (← links)
- Specification and Verification of Multi-Agent Systems (Q3166991) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- Deciding $$\mathsf {ATL^*}$$ Satisfiability by Tableaux (Q3454093) (← links)
- A Tableau for Bundled Strategies (Q3455759) (← links)
- A Labeled Natural Deduction System for a Fragment of CTL * (Q3605539) (← links)
- Büchi Complementation and Size-Change Termination (Q3617751) (← links)
- TTL : a formalism to describe local and global properties of distributed systems (Q3992090) (← links)
- Church's Problem Revisited (Q4262605) (← links)
- A clausal resolution method for CTL branching-time temporal logic (Q4421285) (← links)
- Temporal Logics with Reference Pointers and Computation Tree Logics (Q4443400) (← links)
- Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
- Model Theoretic Syntax and Parsing (Q4923571) (← links)
