Generating models of infinite-state communication protocols using regular inference with abstraction
type: Item
instance of: scholarly article
title: Generating models of infinite-state communication protocols using regular inference with abstraction
zbMATH Open document ID: 1322.68131
author: Fides Aarts
author: Bengt Jonsson
author: Johan Uijen
author: F. Vaandrager
published in: Formal Methods in System Design
publication date: 2015-03-24T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6418978
zbMATH Keywords: active automata learning
zbMATH Keywords: Mealy machines
zbMATH Keywords: abstraction techniques
zbMATH Keywords: communication protocols
zbMATH Keywords: session initiation protocol
zbMATH Keywords: transmission control protocol
describes a project that uses: SLAM
describes a project that uses: LearnLib
describes a project that uses: SpecExplorer
describes a project that uses: ns-2
MaRDI profile type: Publication
full work available at URL: s10703-014-0216-x
OpenAlex ID: W2561427878
cites work: Automata Learning through Counterexample Guided Abstraction Refinement
cites work: A Theory of History Dependent Abstractions for Learning Interface Automata
cites work: Improving active Mealy machine learning for protocol conformance testing
cites work: Inference of finite automata using homing sequences
cites work: Mining specifications
cites work: Learning regular sets from queries and counterexamples
cites work: Handbook of process algebra
cites work: Model-based testing of reactive systems. Advanced lectures.
cites work: A Succinct Canonical Register Automaton Model
cites work: Counterexample-guided abstraction refinement for symbolic model checking
cites work: Q4417936
cites work: Language identification in the limit
cites work: Network invariants for real-time systems
cites work: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
cites work: Q4472253
cites work: 25 years of model checking. History, achievements, perspectives
cites work: Q4738314
cites work: Lazy abstraction
cites work: Automata Learning with Automated Alphabet Abstraction Refinement
cites work: Property preserving abstractions for the verification of concurrent systems
cites work: Computer Aided Verification
cites work: Integration Testing of Distributed Components Based on Learning Parameterized I/O Models
cites work: Demonstrating Learning of Register Automata
cites work: Q3992568
cites work: Q4942015
cites work: Q4293119
cites work: Symbolic finite state transducers
DOI: 10.1007/S10703-014-0216-X
description: scientific article; zbMATH DE number 6418978