Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Inferring Compact Models of Communication Protocol Entities
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
2010 (English)In: Leveraging Applications of Formal Methods, Verification, and Validation: Part I / [ed] Margaria, Tiziana; Steffen, Bernhard, Springer, 2010, 658-672 p.Conference paper, Published paper (Refereed)
Abstract [en]

Our overall goal is to support model-based approaches to verification and validation of communication protocols by techniques that automatically generate models of communication protocol entities from observations of their external behavior, using techniques based on regular inference (aka automata learning). In this paper, we address the problem that existing regular inference techniques produce "flat" state machines, whereas practically useful protocol models structure the internal state in terms of control locations and state variables, and describes dynamic behavior in a suitable (abstract) programming notation. We present a technique for introducing structure of an unstructured finite-state machine by introducing state variables and program-like descriptions of dynamic behavior, given a certain amount of user guidance. Our technique groups states with "similar control behavior" into control locations, and obtain program-like descriptions by means of decision tree generation. We have applied parts of our approach to an executable state machine specification of the Mobile Arts Advanced Mobile Location Center (A-MLC) protocol and evaluated the results by comparing them to the original specification.

Place, publisher, year, edition, pages
Springer, 2010. 658-672 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6415
Keyword [en]
STATE MACHINES; REGULAR INFERENCE; VERIFICATION; INTEGRATION; COMPONENTS
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-49443DOI: 10.1007/978-3-642-16558-0_53ISI: 000289493100053Scopus ID: 2-s2.0-78650291305ISBN: 978-3-642-16557-3 (print)OAI: oai:DiVA.org:kth-49443DiVA: diva2:459653
Conference
4th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation Heraklion, GREECE, OCT 18-21, 2010
Note
QC 20111216Available from: 2011-12-16 Created: 2011-11-27 Last updated: 2011-12-16Bibliographically approved

Open Access in DiVA

main.pdf(238 kB)153 downloads
File information
File name FULLTEXT01.pdfFile size 238 kBChecksum SHA-512
135e8e4dcbbedb71c245127ad15198eb158e59a767a5deea5055530f8a167b9816fb2a92393a224ddbb01030ed60e891aaf684cb0c1e6b8e3ab58a16a4122703
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusSpringer link

Search in DiVA

By author/editor
Soleimanifard, Siavash
By organisation
Theoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 153 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 67 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf