CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Analysis and representation of test cases generated from LOTOS
Authors
B. Sarikaya
P. Tripathy
Publication date
1 January 1995
Publisher
'Elsevier BV'
Doi
Cite
Abstract
Cataloged from PDF version of article.This paper presents a method to generate, analyse and represent test cases from protocol specification. The language of temporal ordering specification (LOTOS) is mapped into an extended finite state machine (EFSM). Test cases are generated from EFSM. The generated test cases are modelled as a dependence graph. Predicate slices are used to identify infeasible test cases that must be eliminated. Redundant assignments and predicates in all the feasible test cases are removed by reducing the test case dependence graph. The reduced test case dependence graph is adapted for a local single-layer (LS) architecture. The reduced test cases for the LS architecture are enhanced to represent the tester's behaviour. The dynamic behaviour of the test cases is represented in the form of control graphs by inverting the events, assigning verdicts to the events in the enhanced dependence graph. © 1995
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Bilkent University Institutional Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:repository.bilkent.edu.tr:...
Last time updated on 12/11/2016
Bilkent University Institutional Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:repository.bilkent.edu.tr:...
Last time updated on 12/11/2016