Efficient decision procedures for model checking of linear time logic properties
From MaRDI portal
Recommendations
- Truly on-the-fly LTL model checking
- Efficient model checking of safety properties
- Efficient model checking via Büchi tableau automata
- Symbolic systems, explicit properties: On hybrid approaches for LTL symbolic model checking
- An explicit transition system construction approach to LTL satisfiability checking
Cited in
(17)- Quantitative model checking of linear-time properties based on generalized possibility measures
- Combining static analysis and case-based search space partitioning for reducing peak memory in model checking
- Automata-driven partial order reduction and guided search for LTL model checking
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- Compositional SCC analysis for language emptiness
- Using heuristic search for finding deadlocks in concurrent systems
- Functional specification of hardware via temporal logic
- Practical Efficient Modular Linear-Time Model-Checking
- Survey on Directed Model Checking
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
- A first-order logic characterization of safety and co-safety languages
- A truly symbolic linear-time algorithm for SCC decomposition
- Abstract reduction in directed model checking CCS processes
- \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes
- 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
- Linear temporal logic with until and next, logical consecutions
- Embedding finite automata within regular expressions
This page was built for publication: Efficient decision procedures for model checking of linear time logic properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4817546)
