On performance bounds for interval time petri nets
27 Sep 2004-pp 50-59
TL;DR: The proposed method consists in computing performance bounds to partially characterize the quantitative behavior of interval time Petri nets by exploiting their structural properties and/or by applying operational laws.
Abstract: Interval time Petri nets are Petri nets in which time intervals are associated to transitions. Their quantitative analysis basically consists in applying enumerative techniques that suffer the well known state space explosion problem. To overcome this problem several methods have been proposed in the literature, that either allow to obtain equivalent nets with a reduced state space or avoid the construction of the whole state space. The alternative method proposed here consists in computing performance bounds to partially characterize the quantitative behavior of interval time Petri nets by exploiting their structural properties and/or by applying operational laws. The performance bound computation is not a new technique: it has been proposed for timed Petri nets. In this paper we present the results obtained from a preliminary investigation on the applicability of bounding techniques of timed Petri nets to interval time Petri nets.
Citations
More filters
25 Mar 2009
TL;DR: The main functionalities of GreatSPN2.0 are reviewed and some recently added features that significantly enhance the efficacy of the tool are presented.
Abstract: GreatSPN is a tool that supports the design and the qualitative and quantitative analysis of Generalized Stochastic Petri Nets (GSPN) and of Stochastic Well-Formed Nets (SWN). The very first version of GreatSPN saw the light in the late eighties of last century: since then two main releases where developed and widely distributed to the research community: GreatSPN1.7 [13], and GreatSPN2.0 [8]. This paper reviews the main functionalities of GreatSPN2.0 and presents some recently added features that significantly enhance the efficacy of the tool.
131 citations
TL;DR: The method customizes the Australian standard risk management process, where the system context is the UML-based software specification, enriched with standard MARTE profile annotations to capture nonfunctional system properties.
Abstract: Software systems that do not meet their timing constraints can cause risks. In this work, we propose a comprehensive method for assessing the risk of timing failure by evaluating the software design. We show how to apply best practises in software engineering and well-known Time Petri Net (TPN) modeling and analysis techniques, and we demonstrate the effectiveness of the method with reference to a case study in the domain of real-time embedded systems. The method customizes the Australian standard risk management process, where the system context is the UML-based software specification, enriched with standard MARTE profile annotations to capture nonfunctional system properties. During the risk analysis, a TPN is derived, via model transformation, from the software design specification and TPN bound techniques are applied to estimate the probability of timing failure. TPN bound techniques are also exploited, within the risk evaluation and treatment steps, to identify the risk causes in the software design.
53 citations
TL;DR: This paper proposes a method that consists in computing performance bounds to predict the average operational behavior of TPNs by exploiting their structural properties and by applying operational laws.
Abstract: Time Petri nets (TPNs) have been widely used for the verification and validation of real-time systems during the software development process. Their quantitative analysis consists in applying enumerative techniques that suffer the well known state space explosion problem. To overcome this problem, several methods have been proposed in the literature, that either provide rules to obtain equivalent nets with a reduced state space or avoid the construction of the whole state space. In this paper, we propose a method that consists in computing performance bounds to predict the average operational behavior of TPNs by exploiting their structural properties and by applying operational laws. Performance bound computation was first proposed for timed (Timed PNs) and stochastic Petri nets (SPNs). We generalize the results obtained for Timed PNs and SPNs to make the technique applicable to TPNs and their extended stochastic versions: TPN with firing frequency intervals (TPNFs) and extended TPNs (XTPNs). Finally, we apply the proposed bounding techniques on the case study of a robot-control application taken from the literature.
39 citations
01 Aug 1995
TL;DR: This paper provides a method to efficiently compute upper and lower bounds for the throughputs and mean token numbers for a large class of stochastic timed Petri nets based on uniformization technique and linear programming.
Abstract: Stochastic timed Petri nets are a useful tool in performance analysis of concurrent systems such as parallel computers, communication networks and flexible manufacturing systems. In general, performance measures of stochastic timed Petri nets are difficult to obtain for problems of practical sizes. In this paper, we provide a method to compute efficiently upper and lower bounds for the throughputs and mean token numbers in general Markovian timed Petri nets. Our approach is based on uniformization technique and linear programming
28 citations
01 Feb 2013
TL;DR: This paper proposes a min-max problem to compute the cycle time of a transition under optimistic assumptions, and demonstrates that such a problem is related to a maximization linear programming problem (LP-max) previously stated in the literature, to computed the throughput upper bound of the transition.
Abstract: The time Petri net with firing frequency intervals (TPNF) is a modeling formalism used to specify system behavior under timing and frequency constraints. Efficient techniques exist to evaluate the performance of TPNF models based on the computation of bounds of performance metrics (e.g., transition throughput, place marking). In this paper, we propose a min-max problem to compute the cycle time of a transition under optimistic assumptions. That is, we are interested in computing the lower bound. We will demonstrate that such a problem is related to a maximization linear programming problem (LP-max) previously stated in the literature, to compute the throughput upper bound of the transition. The main advantage of the min-max problem compared to the LP-max is that, in addition to the optimal value, the optimal solutions provide useful feedback to the analyst on the system behavior (e.g., performance bottlenecks). We have implemented two solution algorithms, using CPLEX APIs, to solve the min-max problem, and have compared their performance using a benchmark of TPNF models, several of these being case studies. Finally, we have applied the min-max technique for the vulnerability analysis of a critical infrastructure, i.e., the Saudi Arabian crude-oil distribution network.
15 citations
Cites methods from "On performance bounds for interval ..."
...We have gathered 40 TPNF models, several of them being case studies from the literature [1], [2], [6]–[14]....
[...]
References
More filters
01 Apr 1989
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Abstract: Starts with a brief review of the history and the application areas considered in the literature. The author then proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis. In particular, one section is devoted to marked graphs, the concurrent system model most amenable to analysis. Introductory discussions on stochastic nets with their application to performance modeling, and on high-level nets with their application to logic programming, are provided. Also included are recent results on reachability criteria. Suggestions are provided for further reading on many subject areas of Petri nets. >
10,755 citations
"On performance bounds for interval ..." refers background in this paper
...Place/Transition (P/T) Petri nets [17] have been extended in the literature with suitable time interpretations for the modelling and analysis of real-time systems or with a performance evaluation perspective....
[...]
Book•
01 Mar 1984TL;DR: This book shows the quantitative system performance computer system analysis using queuing network models as your friend in spending the time.
Abstract: Reading a book is also kind of better solution when you have no enough money or time to get your own adventure. This is one of the reasons we show the quantitative system performance computer system analysis using queuing network models as your friend in spending the time. For more representative collections, this book not only offers it's strategically book resource. It can be a good friend, really good friend with much knowledge.
1,200 citations
"On performance bounds for interval ..." refers methods in this paper
...This set of constraints is derived from the enabling operational law applied on Petri Nets (or utilization law with classical queueing systems terminology [13]); they take into account of the timing information of the net, that is the static interval function I ....
[...]
TL;DR: An enumerative method is proposed in order to exhaustively validate the behavior of Merlin's time Petri net model and it is applied to the specification and verification of the alternating bit protocol as a simple illustrative example.
Abstract: A description and analysis of concurrent systems, such as communication systems, whose behavior is dependent on explicit values of time is presented. An enumerative method is proposed in order to exhaustively validate the behavior of P. Merlin's time Petri net model, (1974). This method allows formal verification of time-dependent systems. It is applied to the specification and verification of the alternating bit protocol as a simple illustrative example. >
1,129 citations
"On performance bounds for interval ..." refers methods in this paper
...The quantitative analysis of such kind of nets basically consists in applying enumerative techniques, i.e., based on the construction of the graph of the state class [ 3 , 4] or of the discrete reachability graph [18] for TPNs and of the randomized state graph [21] for XTPNs, that suffer the well known state space explosion problem even in case of bounded nets....
[...]
TL;DR: The time-Petri net (TPN) appears to be a suitable model for the study of practical recoverable processes and several practical communication protocols are formally designed and analyzed using this new model.
Abstract: A study is presented which permits the formal analysis and synthesis of recoverable computer communication protocols. This study is based on a formal representation of processes by a model of computation, the Petri nets (PN's). The PN model is generalized to include a representation of the possible failures, and then, the concept of "recoverability" is formally defined. A set of necessary and sufficient conditions which a process must satisfy in order to be recoverable is derived. In the PN model, the processes that satisfy these conditions are shown to have some practical limitations. A new model, the time-Petri net (TPN), is introduced to remove these limitations. This new model allows the introduction of constraints in the execution times of its part. As shown in this paper, the TPN appears to be a suitable model for the study of practical recoverable processes. Several practical communication protocols are formally designed and analyzed using this new model, and some interesting properties of these protocols are formally derived.
917 citations
Dissertation•
01 Feb 1974
TL;DR: This thesis is concerned with the modeling and performance analysis of systems which consist of concurrently acting components, an example of which is an asynchronous pipelined processor.
Abstract: This thesis is concerned with the modeling and performance analysis of systems which consist of concurrently acting components, an example of which is an asynchronous pipelined processor. The work is divided into two parts. In the first part, a suitable model is developed for describing the structure of asynchronous concurrent systems. In conventional automata theory, the finite-state machine model is used to describe the behavior of systems; the problem with this is that a large number of states results when practical systems are modeled. In this thesis, each system component is modeled as a finite-state machine, and a system is viewed as an ensemble of interconnected finite-state machines. This has the advantage that the size of a system model grows linearly rather than exponentially with the number of system components. A subclass of Petri nets known as SMD (State Machine Decomposable) Petri nets is identified in order to formalize the notions of finite-state machines and their inter-connection. For convenience, systems of interest are divided into two broad categories: (a) deterministic, or decision free, (b) non-deterministic, or systems with decisions. SMD Petri nets are used to model both classes of systems; in addition, a subclass of Petri nets known as LSP Petri nets is used to model those deterministic systems that cannot be modeled by SMD Petri nets. The second part of the thesis is concerned with finding the computation rate of activities in real-world asynchronous concurrent systems. Practical systems are constructed from devices which have a finite speed of operation. Since Petri nets do not have time parameters as part of their definition, they can model the structure of systems but cannot be used to study their computation rate. The definition of Petri nets is augmented to model the speed of operation of a device in a system by assuming that the corresponding activity in the Petri net has a finite, non-zero time duration. The resulting nets are termed timed Petri nets, and methods are given for finding the computation rate of activities in times SMD and LSP Petri nets. The results are applied to the analysis of several asynchronous systems drawn from areas within and outside the domain of computer systems.
912 citations
"On performance bounds for interval ..." refers methods in this paper
...The analysis method proposed here can be considered as a generalization of the existing well established performance bound computation techniques for timed Petri nets (in the sense of Ramchandani [20]) and stochastic Petri nets [7, 6, 8, 10, 14], since the Petri nets that we consider now preserve a higher level of non-determinism both in the duration of activities (interval time specification) and conflict resolution (interval firing frequencies)....
[...]