Transient analysis of Markov Regenerative Processes (MRPs) can be performed through the solution of Markov renewal equations defined by global and local kernels, which respectively characterize the occurrence of regenerations and transient probabilities between them. To derive kernels from stochastic models (e.g., stochastic Petri nets), existing methods exclusively address the case where at mo...

Local area networks are representative of a growing class of distributed systems which demand more sophisticated methods and tools to evaluate system behavior in the presence of faults. In particular, since they are likely to exhibit degradable performance, the concept of performability can provide more re ned assessments of their ability to perform under fault and error conditions. This paper ...

There is a need for modeling and performance evaluation techniques and tools for a fast and reliable design of workkow systems. This paper introduces a modeling methodology based on colored stochastic Petri nets. It allows the integration of functional, organizational, and timing aspects in one modeling framework. The processing delays include stochastic distributions in addition to determinist...

This paper presents an efficient method to derive the first passage time of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine which is a semi-Markov process. The mean and the variance of the first passage time are derived by algebraic manipulations with ...

In this work, we address the problem of transient and steadystate analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but without any additional constraint. Rather than computing an approximate distribution of the model (as done in previous methods), we develop an exact analysis of an approximate model. The design of this method leads to a uniform...

This paper describes a symbolic model checking approach for the Continuous Stochastic Reward Logic (CSRL) and stochastic reward nets, stochastic Petri nets augmented with rate rewards. CSRL model checking requires the computation of the joint distribution of time and accumulated reward, which is done by Markovian approximation. An implementation is available in the model checker MARCIE. It appl...

Existing mobile agent-enabled anomaly detection schemes have not considered temporal behavior for their correct functioning and detection of temporal anomalies. This study employs a holistic system approach to design an Enhanced mobile Agent-enabled Anomaly Detection System (EAADS) by designing two new algorithms. The proposed algorithms are not only important for the completeness of the EAADS,...

Stochastic Petri nets generalize the notion of queueing systems and are a useful model in performance evaluation of parallel and distributed systems. We give necessary and sufficient conditions for the boundedness of a stochastic process related to these nets. A.M.S. Classification : 60 G 40, 68 M 20, 60 K 25 Research partially supported by project PA86-0028 of the Spanish Comisión Interministe...

We consider equivalence relations for Fluid Stochastic Petri Nets (FSPNs). Based on equivalence relations for Stochastic Petri Nets (SPNs), which are derived from lumpability for Markov Chains, and from lumpability for certain classes of differential equations, we define an equivalence relation for FSPNs. Lumpability for the differential equations is based on a finite discretization approach an...

We present SPNP, a powerful GSPN package developed at Duke University. SPNP allows the modeling of complex system behaviors. Advanced constructs are available, such as markingdependent arc multiplicities, enabling functions, arrays of places or transitions, and subnets; in addition, the full expressive power of the C programming language is available to increase the flexibility of the net descr...