Generating models of infinite-state communication protocols using regular inference with abstraction

DOI10.1007/s10703-014-0216-xzbMath1322.68131OpenAlexW2561427878MaRDI QIDQ2018056

Fides Aarts, Bengt Jonsson, Johan Uijen, Frits W. Vaandrager

Publication date: 24 March 2015

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-014-0216-x

zbMATH Keywords

session initiation protocolcommunication protocolsabstraction techniquesactive automata learningMealy machinestransmission control protocol

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)

Related Items

History-preserving bisimilarity for higher-dimensional automata via open maps, Fingerprinting and analysis of Bluetooth devices with automata learning, A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees, Generating models of infinite-state communication protocols using regular inference with abstraction, Active learning for extended finite state machines, A Myhill-Nerode theorem for register automata and symbolic trace languages

Uses Software

• SLAM
• LearnLib
• SpecExplorer
• ns-2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving active Mealy machine learning for protocol conformance testing
• 25 years of model checking. History, achievements, perspectives
• Network invariants for real-time systems
• Learning regular sets from queries and counterexamples
• Property preserving abstractions for the verification of concurrent systems
• Generating models of infinite-state communication protocols using regular inference with abstraction
• Inference of finite automata using homing sequences
• Model-based testing of reactive systems. Advanced lectures.
• Demonstrating Learning of Register Automata
• A Theory of History Dependent Abstractions for Learning Interface Automata
• Symbolic finite state transducers
• Automata Learning with Automated Alphabet Abstraction Refinement
• A Succinct Canonical Register Automaton Model
• Counterexample-guided abstraction refinement for symbolic model checking
• Integration Testing of Distributed Components Based on Learning Parameterized I/O Models
• Automata Learning through Counterexample Guided Abstraction Refinement
• Mining specifications
• Lazy abstraction
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Language identification in the limit
• Computer Aided Verification