By Topic

IEEE Transactions on Software Engineering

Issue 9 • Date Sept. 1996

Filter Results

Displaying Results 1 - 8 of 8
  • Guest Editorial Introduction to the Special Section

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (231 KB)
    Freely Available from IEEE
  • Efficient discrete-event simulation of colored Petri nets

    Publication Year: 1996, Page(s):629 - 639
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB)

    Colored Petri nets are a powerful formalism for the description of complex, asynchronous distributed systems. They can express in a very concise way the behavior of very large systems, especially in case these systems are composed of many replications of a few basic components that individually behave in a similar way. The simulation of such models is, however, difficult to perform in a computatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sufficient conditions for existence of a fixed point in stochastic reward net-based iterative models

    Publication Year: 1996, Page(s):640 - 653
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1268 KB)

    Stochastic Petri net models of large systems that are solved by generating the underlying Markov chain pose the problem of largeness of the state-space of the Markov chain. Hierarchical and iterative models of systems have been used extensively to solve this problem. A problem with models which use fixed-point iteration is the theoretical proof of the existence, uniqueness and convergence of the f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Numerical analysis of superposed GSPNs

    Publication Year: 1996, Page(s):615 - 628
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1364 KB)

    The numerical analysis of various modeling formalisms profits from a structured representation for the generator matrix Q of the underlying continuous-time Markov chain, where Q is described by a sum of tensor (Kronecker) products of much smaller matrices. In this paper, we describe such a representation for the class of superposed generalized stochastic Petri nets (GSPNs), which is less restricti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate mean value analysis for stochastic marked graphs

    Publication Year: 1996, Page(s):654 - 664
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    An iterative technique for the computation of approximate performance indices of a class of stochastic Petri net models is presented. The proposed technique is derived from the mean value analysis algorithm for product-form solution stochastic Petri nets. In this paper, we apply the approximation technique to stochastic marked graphs. In principle, the proposed technique can be used for other stoc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for the generation of state-level representations of stochastic activity networks with general reward structures

    Publication Year: 1996, Page(s):603 - 614
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1244 KB)

    Stochastic Petri nets (SPNs) and extensions are a popular method for evaluating a wide variety of systems. In most cases, their numerical solution requires generating a state-level stochastic process, which captures the behavior of the SPN with respect to a set of specified performance measures. These measures are commonly defined at the net level by means of a reward variable. In this paper, we d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Total variance approach to software reliability estimation

    Publication Year: 1996, Page(s):687 - 688
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    This paper presents a mathematical model for a new approach to calculating the confidence intervals for software reliability projections. Unlike those calculated by current methods, these confidence intervals account for any uncertainty concerning the operational profile of the system View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Derivation of data intensive algorithms by formal transformation: the Schnorr-Waite graph marking algorithm

    Publication Year: 1996, Page(s):665 - 686
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1868 KB)

    Considers a particular class of algorithms which present certain difficulties to formal verification. These are algorithms which use a single data structure for two or more purposes, which combine program control information with other data structures or which are developed as a combination of a basic idea with an implementation technique. Our approach is based on applying proven semantics-preserv... 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
tse-eic@computer.org