Deciding full branching time logic
From MaRDI portal
Publication:3722471
Recommendations
Cited in
(77)- Automata-theoretic techniques for modal logics of programs
- A decision procedure for combinations of propositional temporal logic and other specialized theories
- Uniform inevitability is tree automaton ineffable
- Characterizing finite Kripke structures in propositional temporal logic
- TABLEAUX: A general theorem prover for modal logics
- A model checker for linear time temporal logic
- CTL^* and ECTL^* as fragments of the modal -calculus
- A branching time logic with past operators
- Determinization and memoryless winning strategies
- Axiomatising extended computation tree logic
- Sublogics of a branching time logic of robustness
- Inconsistency-tolerant temporal reasoning with hierarchical information
- CTL^ with graded path modalities
- Module checking
- A transformation-based synthesis of temporal specification
- A propositional probabilistic logic with discrete linear time for reasoning about evidence
- Branching time agents logics, satisfiability problem by rules in reduced form
- A logic with revocable and refinable strategies
- A goal-directed decision procedure for hybrid PDL
- To be fair, use bundles
- A clausal resolution method for extended computation tree logic ECTL
- An axiomatization of PCTL*
- Relating word and tree automata
- An axiomatization of full computation tree logic
- A rooted tableau for \(\mathrm{BCTL}^*\)
- Decidability and expressivity of Ockhamist propositional dynamic logics
- Satisfiability games for branching-time logics
- Branching time? Pruning time!
- Specification and Verification of Multi-Agent Systems
- Temporal logic and fair discrete systems
- Deciding \(\mathsf {ATL}^*\) satisfiability by tableaux
- A tableau for bundled strategies
- Logic programming approach to automata-based decision procedures
- Deciding full branching time logic by program transformation
- A Labeled Natural Deduction System for a Fragment of CTL *
- Büchi Complementation and Size-Change Termination
- The decision problem for branching time logic
- scientific article; zbMATH DE number 3972842 (Why is no real title available?)
- scientific article; zbMATH DE number 4006233 (Why is no real title available?)
- scientific article; zbMATH DE number 4027441 (Why is no real title available?)
- TTL : a formalism to describe local and global properties of distributed systems
- Church's Problem Revisited
- The Complexity of Tree Automata and Logics of Programs
- A tableau-based decision procedure for CTL^*
- scientific article; zbMATH DE number 1114349 (Why is no real title available?)
- Complexity of synthesis of composite service with correctness guarantee
- \textit{Once} and \textit{for all}
- A clausal resolution method for CTL branching-time temporal logic
- Temporal Logics with Reference Pointers and Computation Tree Logics
- scientific article; zbMATH DE number 2038753 (Why is no real title available?)
- On Non-local Propositional and Weak Monodic Quantified CTL*
- scientific article; zbMATH DE number 2080198 (Why is no real title available?)
- Expressiveness and succinctness of a logic of robustness
- Linear temporal logic symbolic model checking
- Branching-depth hierarchies
- Model Theoretic Syntax and Parsing
- Verification and comparison of transition systems
- scientific article; zbMATH DE number 7577569 (Why is no real title available?)
- An automata-based approach for \(\text{CTL}^{*}\) with constraints
- scientific article; zbMATH DE number 3892598 (Why is no real title available?)
- Rewrite rules for \(\mathrm{CTL}^\ast\)
- Alternating automata: unifying truth and validity checking for temporal logics
- From LTL to Symbolically Represented Deterministic Automata
- A decision procedure for \(\mathrm{CTL}^{*}\) based on tableaux and automata
- Automata on infinite objects and their applications to logic and programming
- Axiomatising extended computation tree logic
- Incremental reasoning on monadic second-order logics with logic programming
- Completeness of a branching-time logic with possible choices
- Automated temporal reasoning about reactive systems
- QLTL model-checking
- Constraint automata on infinite data trees: from \(\mathrm{CTL}(\mathbb{Z})/\mathrm{CTL}^*(\mathbb{Z})\) to decision procedures
- Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures
- Arbitrary-arity tree automata for QCTL
- Verification of multi-agent systems with public actions against strategy logic
- Experiments with deterministic -automata for formulas of linear temporal logic
- A clausal resolution method for branching-time logic \(\text{ECTL}^+\)
- An optimal decision procedure for right propositional neighborhood logic
This page was built for publication: Deciding full branching time logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3722471)
