oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Priced Timed Petri Nets  [PDF]
Richard M. Mayr,Parosh Aziz Abdulla
Computer Science , 2013, DOI: 10.2168/LMCS-9(4:10)2013
Abstract: We consider priced timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Furthermore, our cost model assigns token storage costs per time unit to places, and firing costs to transitions. This general model strictly subsumes both priced timed automata and unbounded priced Petri nets. We study the cost of computations that reach a given control-state. In general, a computation with minimal cost may not exist, due to strict inequalities in the time constraints. However, we show that the infimum of the costs to reach a given control-state is computable in the case where all place and transition costs are non-negative. On the other hand, if negative costs are allowed, then the question whether a given control-state is reachable with zero overall cost becomes undecidable. In fact, this negative result holds even in the simpler case of discrete time (i.e., integer-valued clocks).
Overview of Stochastic Timed Petri Nets
随机时间Petri网综述

LU Guang-Song,GE Yun-jian,
卢光松
,葛运建

计算机科学 , 2005,
Abstract: Stochastic Timed Petri nets are a powerfu1 modeling formalism,widely used for the performance and de- pendability evaluation of computer and communication systems. The state of the art of the research for the main sub- classes of Stochastic Timed Petri nets as well as their development histories is systematically described. Some of the basic concepts about Stochastic Timed Petri nets are first introduced. General Stochastic Petri nets and the approach- es to deal with the state space explosion problems are then reviewed Non-Markovian Stochastic Petri nets are dis- cussed,along with the analysis techniques. Finally the Fluid Stochastic Petri net formalism and its application are e- laborated.
MODELLING PERFORMANCE MONITORING OF IT INFRASTRUCTURE COMPONENTS USING TIMED PETRI NETS
Ammu Qudsiya .A,Dr. K. Rangarajan
Indian Journal of Computer Science and Engineering , 2012,
Abstract: This paper focuses on utilization of Petri Nets as a modelling and simulation tool for analyzing performance monitoring of IT infrastructure. In order to make informed fine tuning decisions, modelling and simulation based performance analysis is essential. Petri Nets allows study of performance parameters and dynamic systembehavior graphically. Mapping of performance monitoring scenarios in IT infrastructures to Timed Petri Nets and its structural analysis is illustrated in this paper
Model Checking of Timed Petri Nets to Semantically Equivalent Timed Automata Based on Uppaal
基于Uppaal的时延Petri网到时间自动机等价模型验证

ZHOU Qing-lei,WANG Jing,
周清雷
,王静

计算机应用研究 , 2005,
Abstract: Both timed Petri nets and timed automata can carry on behavior simulation and performance analysis to the real-time system effectively.Utilizes a translation algorithm (referred to as TPN-to-TA translation) which can map a timed Petri nets model of real-time system into a collect of semantically equivalent timed automata, use a mature model checker Uppaal for timed automata to verify the performance of this timed Petri nets model.
Computing Optimal Coverability Costs in Priced Timed Petri Nets  [PDF]
Parosh Aziz Abdulla,Richard Mayr
Computer Science , 2011,
Abstract: We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Our cost model assigns token storage costs per time unit to places, and firing costs to transitions. We study the cost to reach a given control-state. In general, a cost-optimal run may not exist. However, we show that the infimum of the costs is computable.
A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
Alexandre David,Lasse Jacobsen,Morten Jacobsen,Ji?í Srba
Electronic Proceedings in Theoretical Computer Science , 2012, DOI: 10.4204/eptcs.102.12
Abstract: Timed-arc Petri nets (TAPN) are a well-known time extension of the Petri net model and several translations to networks of timed automata have been proposed for this model. We present a direct, DBM-based algorithm for forward reachability analysis of bounded TAPNs extended with transport arcs, inhibitor arcs and age invariants. We also give a complete proof of its correctness, including reduction techniques based on symmetries and extrapolation. Finally, we augment the algorithm with a novel state-space reduction technique introducing a monotonic ordering on markings and prove its soundness even in the presence of monotonicity-breaking features like age invariants and inhibitor arcs. We implement the algorithm within the model-checker TAPAAL and the experimental results document an encouraging performance compared to verification approaches that translate TAPN models to UPPAAL timed automata.
Modeling of Osteoporosis Diagnose By Using Timed Petri Nets
Davut Hanbay,Ibrahim Turkoglu,Yakup Dem r
Asian Journal of Information Technology , 2012,
Abstract: In this study, we suggest an alternative approach based on Timed Petri net model (TPN) for diagnose (diagnosing) osteoporosis disease. We inspired from the decision tree which has been obtained from the physician`s questionnaire. Data mining had (has) been used to form this decision tree. Consequently, the proposed method is carried out on 60 female patients for diagnosis application and the results are compared with the clinical diagnosis. The overall success is about 90%.
Timed Test Case Generation Using Labeled Prioritized Time Petri Nets
Noureddine Adjir,Pierre De Saqui Sannes,Kamel Rahmouni,Abdelkader Adla
International Journal of Computer Science Issues , 2012,
Abstract: Model-based testing of software and hardware systems uses behavioral and formal models of the systems. The paper presents a technique for model-based black-box conformance testing of real-time systems using Labeled Prioritized Time Petri Nets (LPrTPN). The Timed Input/Output Conformance (tioco) relation, which takes environment assumptions into account, serves as reference to decide of implementation correctness. Test suites are derived automatically from a LPrTPN made up of two concurrent sub-nets that respectively specify the system under test and its environment. The result is optimal in the sense that test cases have the shortest possible accumulated time to be executed. Test cases selection combines test purposes and structural coverage criteria associated with the model. A test purpose or a coverage criterion is specified in a SE-LTL formula. The TIme Petri Net Analyzer TINA has been extended to support concurrent composed subnets. Automatic generation of time-optimal test suites with the Tina toolbox combines the model checker selt and the path analyzer plan. selt outputs a sequence that satisfies the logic formula. plan computes the fastest execution of this sequence which will be transformed in a test cases suite.
Timed Test Case Generation Using Labeled Prioritized Time Petri Nets  [PDF]
Noureddine Adjir,Pierre de Saqui Sannes,M. Kamel Rahmouni,Abdelkader Adla
Computer Science , 2012,
Abstract: Model-based testing of software and hardware systems uses behavioral and formal models of the systems. The paper presents a technique for model-based black-box conformance testing of real-time systems using Labeled Prioritized Time Petri Nets (LPrTPN). The Timed Input/Output Conformance (tioco) relation, which takes environment assumptions into account, serves as reference to decide of implementation correctness. Test suites are derived automatically from a LPrTPN made up of two concurrent sub-nets that respectively specify the system under test and its environment. The result is optimal in the sense that test cases have the shortest possible accumulated time to be executed. Test cases selection combines test purposes and structural coverage criteria associated with the model. A test purpose or a coverage criterion is specified in a SE-LTL formula. The TIme Petri Net Analyzer TINA has been extended to support concurrent composed subnets. Automatic generation of time-optimal test suites with the Tina toolbox combines the model checker selt and the path analyzer plan. selt outputs a sequence that satisfies the logic formula. plan computes the fastest execution of this sequence which will be transformed in a test cases suite.
The Lookahead Study in Distributed Simulation of Timed Petri Nets
时延Petri网分布式模拟的先行值研究

FANG Xian-Wen,WU Zhe-Hui,LIU Shi-Xi,
方贤文
,吴哲辉,刘士喜

计算机科学 , 2006,
Abstract: Lookahead computation is a good method that improves the distributed simulation performance of timed Petri nets. In the paper, we give four basic architectures about the look,ahead computation of time Petri nets, also obtain the algorithm of prediction graph to having cyclic and complex Petri nets architecture. By prediction graph, static and dynarnic lookahead can be computed easily. In distributed simulation, we can use lookahead to analyze the architecture having concurrency and blocking, which is foundation on net partitioning for running in parallel nodes.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.