Inferring Network Invariants Automatically
From MaRDI portal
Recommendations
Cited in
(17)- Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
- Verification of asynchronous systems with an unspecified component
- Learning Meets Verification
- Inferring inductive invariants from phase structures
- FSM inference from long traces
- Benchmarking combinations of learning and testing algorithms for automata learning
- An invariant-based approach to the verification of asynchronous parameterized networks
- Regular inference as vertex coloring
- Network invariants for real-time systems
- Learning Transparent Data Automata
- Fundamental results for learning deterministic extended finite state machines from queries
- Unsupervised automata learning via discrete optimization
- Compositional automata learning of synchronous systems
- scientific article; zbMATH DE number 1927557 (Why is no real title available?)
- Learning Minimal Separating DFA’s for Compositional Verification
- Automatic verification of parameterized networks of processes
- Inferring regular languages and \(\omega\)-languages
This page was built for publication: Inferring Network Invariants Automatically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613429)