scientific article; zbMATH DE number 177248
From MaRDI portal
Publication:4037099
Recommendations
Cited in
(26)- An explicit transition system construction approach to LTL satisfiability checking
- On a class of timer hybrid systems reducible to finite state automata
- Iterative bounded synthesis for efficient cycle detection in parametric timed automata
- GSTE is partitioned model checking
- Distributed breadth-first search LTL model checking
- Optimized temporal monitors for SystemcC
- Analysing sanity of requirements for avionics systems
- Explicit-state model checking
- Partial-Order Reduction
- From Philosophical to Industrial Logics
- Survey on Directed Model Checking
- Hierarchical Adaptive State Space Caching Based on Level Sampling
- Automata-Based Termination Proofs
- Checking timed Büchi automata emptiness using LU-abstractions
- scientific article; zbMATH DE number 177519 (Why is no real title available?)
- Automated verification of parallel nested DFS
- Alternating automata: unifying truth and validity checking for temporal logics
- Model checking of biological systems
- On Locally Checkable Properties
- Flash memory efficient LTL model checking
- “On the fly” verification of behavioural equivalences and preorders
- Bounded-memory algorithms for verification on-the-fly
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- AutoHyper: explicit-state model checking for HyperLTL
- Checking timed Büchi automata emptiness efficiently
- Theoretical foundations of handling large substitution sets in temporal integrity monitoring
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037099)
