The following pages link to (Q4817549):
Displaying 30 items.
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition (Q606997) (← links)
- Tableau-based automata construction for dynamic linear time temporal logic (Q862830) (← links)
- Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms (Q929294) (← links)
- Linear temporal logic with until and next, logical consecutions (Q947268) (← links)
- Reasoning about XML with temporal logics and automata (Q975873) (← links)
- Tool support for learning Büchi automata and linear temporal logic (Q1019031) (← links)
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- An explicit transition system construction approach to LTL satisfiability checking (Q1707341) (← links)
- A symbolic decision procedure for symbolic alternating finite automata (Q2130584) (← links)
- Transformation from PLTL to automata via NFGs (Q2253959) (← links)
- SAT-based explicit LTL reasoning and its application to satisfiability checking (Q2335900) (← links)
- From LTL to deterministic automata. A safraless compositional approach (Q2363815) (← links)
- GSTE is partitioned model checking (Q2385196) (← links)
- Optimized temporal monitors for SystemcC (Q2441724) (← links)
- More efficient on-the-fly LTL verification with Tarjan's algorithm (Q2575734) (← links)
- On the Relationship between LTL Normal Forms and Büchi Automata (Q2842641) (← links)
- A Logical Approach to Data-Aware Automated Sequence Generation (Q2889859) (← links)
- Büchi Store: An Open Repository of Büchi Automata (Q3000654) (← links)
- Inference Rules in Multi-agents’ Temporal Logics (Q3013073) (← links)
- Model Checking Probabilistic Systems (Q3176386) (← links)
- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL (Q3183543) (← links)
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking (Q5458321) (← links)
- GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic (Q5458337) (← links)
- Incremental reasoning on monadic second-order logics with logic programming (Q5963088) (← links)
- From linear temporal logics to Büchi automata: the early and simple principle (Q6041188) (← links)
- Bridging the gap between single- and multi-model predictive runtime verification (Q6108431) (← links)
- The effects of semantic simplifications on random \textit{BST}-like expression-trees (Q6124452) (← links)
