By Topic

Software Engineering, IEEE Transactions on

Issue 10 • Date Oct. 2002

Filter Results

Displaying Results 1 - 8 of 8
  • Introduction to the special section on petri nets and performance models

    Publication Year: 2002 , Page(s): 913 - 914
    Save to Project icon | Request Permissions | PDF file iconPDF (230 KB)  
    Freely Available from IEEE
  • The Mobius framework and its implementation

    Publication Year: 2002 , Page(s): 956 - 969
    Cited by:  Papers (78)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (580 KB) |  | HTML iconHTML  

    The Mobius framework is an environment for supporting multiple modeling formalisms and solution techniques. Models expressed in formalisms that are compatible with the framework are translated into equivalent models using Mobius framework components. This translation preserves the structure of the models, allowing efficient solutions. The framework is implemented in the tool by a well-defined abstract functional interface. Models and solution techniques interact with one another through the use of the standard interface, allowing them to interact with Mobius framework components, not formalism components. This permits novel combinations of modeling techniques, and will be a catalyst for new research in modeling techniques. This paper describes our approach, focusing on the "atomic model". We describe the formal description of the Mobius components as well as their implementations in our software tool. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time domain analysis of non-Markovian stochastic Petri nets with PRI transitions

    Publication Year: 2002 , Page(s): 933 - 943
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (403 KB) |  | HTML iconHTML  

    The time domain analysis of non-Markovian stochastic Petri nets with pre-emptive repeat identical (PRI) type transitions is considered in this paper. The set of "time domain" equations describing the evolution of the marking process is provided. The relation of the time domain and formerly available transform domain description is discussed. Based on the time domain description of the process, a simple numerical procedure is provided to analyze the transient behavior. Two examples are calculated to illustrate the proposed numerical method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Better reliability assessment and prediction through data clustering

    Publication Year: 2002 , Page(s): 997 - 1007
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (400 KB) |  | HTML iconHTML  

    This paper presents a new approach to software reliability modeling by grouping data into clusters of homogeneous failure intensities. This series of data clusters associated with different time segments can be directly used as a piecewise linear model for reliability assessment and problem identification, which can produce meaningful results early in the testing process. The dual model fits traditional software reliability growth models (SRGMs) to these grouped data to provide long-term reliability assessments and predictions. These models were evaluated in the testing of two large software systems from IBM. Compared with existing SRGMs fitted to raw data, our models are generally more stable over time and produce more consistent and accurate reliability assessments and predictions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fluid stochastic Petri nets augmented with flush-out arcs: a transient analysis technique

    Publication Year: 2002 , Page(s): 944 - 955
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (472 KB) |  | HTML iconHTML  

    Fluid stochastic (or hybrid) Petri nets with flush-out arcs are Petri net-based models with two classes of places: discrete places that carry a natural number of distinct objects (tokens), and fluid places that hold a positive amount of fluid, represented by a real number. For this kind of formalisms, equations can be automatically derived from the model. Such equations, however, are often too complex to be solved analytically and simple discretization techniques usually can be successfully applied only to simple cases. In this paper, we present a particular solution technique for transient solution that makes use of the Kronecker-algebra. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compositional schedulability analysis of real-time systems using time Petri nets

    Publication Year: 2002 , Page(s): 984 - 996
    Cited by:  Papers (25)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (452 KB)  

    This paper presents an approach to the schedulability analysis of real-time systems modeled in time Petri nets by separating timing properties from other behavioral properties. The analysis of behavioral properties is conducted based on the reachability graph of the underlying Petri net, whereas timing constraints are checked in terms of absolute and relative firing domains. If a specific task execution is schedulable, we calculate the time span of the task execution, and pinpoint nonschedulable transitions to help adjust timing constraints. A technique for compositional timing analysis is also proposed to deal with complex task sequences, which not only improves efficiency but also facilitates the discussion of the reachability issue with regard to schedulability. We identified a class of well-structured time Petri nets such that their reachability can be easily analyzed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recovering traceability links between code and documentation

    Publication Year: 2002 , Page(s): 970 - 983
    Cited by:  Papers (260)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (793 KB) |  | HTML iconHTML  

    Software system documentation is almost always expressed informally in natural language and free text. Examples include requirement specifications, design documents, manual pages, system development journals, error logs, and related maintenance reports. We propose a method based on information retrieval to recover traceability links between source code and free text documents. A premise of our work is that programmers use meaningful names for program items, such as functions, variables, types, classes, and methods. We believe that the application-domain knowledge that programmers process when writing the code is often captured by the mnemonics for identifiers; therefore, the analysis of these mnemonics can help to associate high-level concepts with program concepts and vice-versa. We apply both a probabilistic and a vector space information retrieval model in two case studies to trace C++ source code onto manual pages and Java code to functional requirements. We compare the results of applying the two models, discuss the benefits and limitations, and describe directions for improvements. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Product form solution for generalized stochastic Petri nets

    Publication Year: 2002 , Page(s): 915 - 932
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (590 KB) |  | HTML iconHTML  

    In this paper, we show the structural characteristics that a particular class of generalized stochastic Petri nets must exhibit in order for their stationary probabilities to have a product-form. Sufficient conditions for identifying such a class are derived and proven with the development of a series of transformations that can also be used to construct, for any GSPN of the class, an equivalent SPN. These resulting SPNs represent the structures that can be analyzed with standard methods for product-form SPNs to establish whether the original GSPNs have product-form solutions and to compute their performance indices with effective approaches based on computationally efficient algorithms that avoid the generation of their underlying state spaces. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

The IEEE Transactions on Software Engineering is interested in well-defined theoretical results and empirical studies that have potential impact on the construction, analysis, or management of software. The scope of this Transactions ranges from the mechanisms through the development of principles to the application of those principles to specific environments. Specific topic areas include: a) development and maintenance methods and models, e.g., techniques and principles for the specification, design, and implementation of software systems, including notations and process models; b) assessment methods, e.g., software tests and validation, reliability models, test and diagnosis procedures, software redundancy and design for error control, and the measurements and evaluation of various aspects of the process and product; c) software project management, e.g., productivity factors, cost models, schedule and organizational issues, standards; d) tools and environments, e.g., specific tools, integrated tool environments including the associated architectures, databases, and parallel and distributed processing issues; e) system issues, e.g., hardware-software trade-off; and f) state-of-the-art surveys that provide a synthesis and comprehensive review of the historical development of one particular area of interest.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Matthew B. Dwyer
Dept. Computer Science and Engineering
256 Avery Hall
University of Nebraska-Lincoln
Lincoln, NE 68588-0115 USA
tseeicdwyer@computer.org