• Login
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage StatisticsView Google Analytics Statistics

    Testing Labelled Transition System

    Thumbnail
    View/Open
    201511025 (935.2Kb)
    Date
    2017
    Author
    Christian, Ruzvelt
    Metadata
    Show full item record
    Abstract
    "For a successful interaction among computer systems from distinct manufactures, standardize communication protocol are being generated and specified. Implementation of those protocol are required that conforms to those specification. Testing is a process of checking the accuracy of protocol implementation with respect to their specifications. This is called as the protocol conformance testing. In this thesis we will study the formal approach to protocol conformance testing. The final aim of the thesis is to derive approach for the derivation of useful test sets from formal specifications. The test cases that we have derived should not detect any kind of errors. In addition to it, the test cases that we have derived should be meaningful. Starting to this point chapter 1 gives the introduction of the thesis. The idea of testing are being introduced in chapter 1. Also the difference between testing and verification is being introduced. Chapter 2 introduce labelled transition systems in detail. The detail definition and representation have been introduced in this chapter. In chapter 3 relations are proposed using the standard of observation: the behavior of an implementation is true if all observations made of the implementation by an environment, can be explained from the behavior of the specification. In chapter 4, for a particular relation conf, test generation algorithms are developed. These algorithms are used to derive tests from an LTS specification, which should be complete and correct. An implementation relation that we have discussed in chapter 3 and the test derivation algorithm id chapter 4 assume that the tester and the implementation communicate with each other via synchronous communication. Chapter 5 shows that if the implementation and tester interact via a FIFO buffer than it is not applicable. To demonstrate this a queue operator is define to create asynchronous communication among the tester and the implementation. The queue operator consist two queues, one is an input queue and the othe one is an output queue. Any system that interact asynchronously with its environment is called a queue context. Finally, chapter 6 conclude this thesis. By adding the input queue and outputqueue we have converted behaviour of asynchronous system into synchronous system."
    URI
    http://drsr.daiict.ac.in//handle/123456789/676
    Collections
    • M Tech Dissertations [923]

    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     


    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV