Sciweavers

58 search results - page 1 / 12
» Inferring Compact Models of Communication Protocol Entities
Sort
View
ISOLA
2010
Springer
13 years 3 months ago
Inferring Compact Models of Communication Protocol Entities
Therese Bohlin, Bengt Jonsson, Siavash Soleimanifa...
FSEN
2007
Springer
13 years 10 months ago
Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata
Abstract. A communication protocol consists of a sequence of messages used by peer entities to communicate. Each entity in a network is equipped by at least one protocol stack. Due...
Mahdi Niamanesh, Rasool Jalili
FASE
2008
Springer
13 years 6 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt
FASE
2006
Springer
13 years 8 months ago
Regular Inference for State Machines with Parameters
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
Therese Berg, Bengt Jonsson, Harald Raffelt
EVOW
2004
Springer
13 years 10 months ago
A Scenario-Based Approach to Protocol Design Using Evolutionary Techniques
An evolutionary approach to design communication protocols from scenario-based specifications is presented. It enables to automatically generate finite-state models of protocol ent...
Sérgio G. Araújo, Antônio C. M...