• Title/Summary/Keyword: stochastic Petri net

Search Result 40, Processing Time 0.028 seconds

Performance evaluation of telecommunication protocols using stochastic petri nets reward model (Stochastic Petri Nets Reward Model을 이용한 통신 프로토콜의 성능평가)

  • 로철우;장직현
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.4
    • /
    • pp.1-14
    • /
    • 1995
  • A new stochastic Petri nets model, called Stochastic Petri Nets Reward Model(SPNRM) is used for modeling and evaluating the performance of telecommunication protocols. We have developed a SPNRM of the TDX-10 Internal protocol, which has a packet data exchange facility between DCEs, Especially a timer and retransmission handling model is presented for error control of the data transmission phase. The stochastic Petri nets package(SPNP), a software package for SPNRM used in this paper, has been used to generate numerical results by analytical-numerical method rather than simulation. From the steady state solution of the net, it is possible to calculate automatically the performance measure of the protocol medeled with both end-to-end and link-by-link method, which are the mean response times and the throughputs.

  • PDF

A refinement and abstraction method of the SPZN formal model for intelligent networked vehicles systems

  • Yang Liu;Yingqi Fan;Ling Zhao;Bo Mi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.1
    • /
    • pp.64-88
    • /
    • 2024
  • Security and reliability are the utmost importance facts in intelligent networked vehicles. Stochastic Petri Net and Z (SPZN) as an excellent formal verification tool for modeling concurrent systems, can effectively handles concurrent operations within a system, establishes relationships among components, and conducts verification and reasoning to ensure the system's safety and reliability in practical applications. However, the application of a system with numerous nodes to Petri Net often leads to the issue of state explosion. To tackle these challenges, a refinement and abstraction method based on SPZN is proposed in this paper. This approach can not only refine and abstract the Stochastic Petri Net but also establish a corresponding relationship with the Z language. In determining the implementation rate of transitions in Stochastic Petri Net, we employ the interval average and weighted average method, which significantly reduces the time and space complexity compared to alternative techniques and is suitable for expert systems at various levels. This reduction facilitates subsequent comprehensive system analysis and module analysis. Furthermore, by analyzing the properties of Markov Chain isomorphism in the case study, recommendations for minimizing system risks in the application of intelligent parking within the intelligent networked vehicle system can be put forward.

Response Time Analysis of Web Service Systems with Mixedly Distributed Stochastic Timed Net (혼합 분포 확률 시간 넷을 이용한 웹 서비스 시스템의 응답 시간 분석)

  • Yim, Jae-Geol;Do, Jae-Su;Shim, Kyu-Bark
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.11
    • /
    • pp.1503-1514
    • /
    • 2006
  • Today, consumers can access Internet from everywhere, therefore most commercial and other organizations provide their services on the Web. As the result, countless Web service systems are already on the Internet and more systems are under construction. Therefore, many researches of verifying that the system to be constructed will not have any deadlock and will run successfully without any problem at the early stage of design have been performed. Several Petri net based verification methods have also been published. However, they have focused on building Petri net models of Web service systems and none of them introduces efficient analysis methods. As a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the initial marking in a timed net, the minimum cycle time method has been widely used in computer system analysis. A timed net is a modified version of a Petri net where a transition is associated with a delay time. A delay time used in a timed net is a constant even though the duration time associated with an event in the real world is a stochastic number in general. Therefore, this paper proposes 'Mixedly Distributed Stochastic Timed Net' where a transition can be associated with a stochastic number and introduce a minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net'. We also introduce a method of analysing a Web service system's response time with the minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net.'.

  • PDF

Stochastic Timed Net and Its Minimum Cycle Time Analysis (확률적 시간 넷과 최소 순회 시간 분석)

  • Yim Jae-Geol;Shim Kyu-Bark
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.5
    • /
    • pp.671-680
    • /
    • 2006
  • As a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the initial marking in a timed net, the minimum cycle time method has been widely used in computer system analysis. A timed net is a modified version of a Petri net where a transition is associated with a delay time. A delay time used in a timed net is a constant even though the duration time associated with an event in the world is a stochastic number in general. In the consequence, the result of minimum cycle time analysis is not realistic. Therefore, we propose ‘Stochastic Timed Net' where a transition can be associated with a stochastic number and introduce a minimum cycle time analysis method for ‘Stochastic Timed Net’ As an example of the application of ‘Stochastic Timed Net’, we introduce a ‘Stochastic Timed Net' model of a Location Based Service Providing Multimedia System and the result of minimum cycle time analysis of it. Whereas the typical form of the result of the existing minimum cycle time analysis is 'It takes at least 10 time units', the typical form of the result of minimum cycle time analysis of a ‘Stochastic Timed Net' is in the probability form such as "The probability of the events in which it finishes its job within 10 time units is 85%."

  • PDF

Intelligent Update of Environment Model in Dynamic Environments through Generalized Stochastic Petri Net (추계적 페트리넷을 통한 동적 환경에서의 지능적인 환경정보의 갱신)

  • Park, Joong-Tae;Lee, Yong-Ju;Song, Jae-Bok
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • pp.181-183
    • /
    • 2006
  • This paper proposes an intelligent decision framework for update of the environment model using GSPN(generalized stochastic petri nets). The GSPN has several advantages over direct use of the Markov Process. The modeling, analysis, and performance evaluation are conducted on the mathematical basis. By adopting the probabilistic approach, our decision framework helps the robot to decide the time to update the map. The robot navigates autonomously for a long time in dynamic environments. Experimental results show that the proposed scheme is useful for service robots which work semi-permanently and improves dependability of navigation in dynamic environments.

  • PDF

Performance analysis of fieldbus systems using Petri net (페리네트를 이용한 필드버스 시스템의 성능 해석)

  • Park, Hong-Seong;Lee, Jae-Soo;Hong, Seong-Soo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.2 no.3
    • /
    • pp.220-228
    • /
    • 1996
  • This paper presents a extended stochastic Petri net (ESPN) model for CTN(Circulated Token with No duration) service in the data link layer of IEC/ISA fieldbus. It is assumed that a station on the fieldbus has a specified minimum token holding time, a finite capacity buffer, and one transmitter queue with the highest priority. The mean transmission (or service) time at a station and the mean token rotation time for the symmetric fieldbus system atr derived using the presented SPN model and the moment generating function. These performance measures are represented in terms of the minimum token holding time, the number of stations, the arrival rate of messages, and the mean length of messages. The presented performance measure are validated by computer simulations.

  • PDF

Availability Analysis of Computer Network using Petri-Nets

  • Ro, Cheul Woo;Pak, Artem
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.699-705
    • /
    • 2009
  • This paper reviews methods used to perform reliability and availability analysis of the network system composed by nodes and links. The combination of nodes and links forms virtual connections (VC). The failure of several VCs cause failure of whole network system. Petri Net models are used to analyze the reliability and availability. Stochastic reward nets (SRN) is an extension of stochastic Petri nets provides modelling facilities for network system analysis.

  • PDF

Analysis of Redundant System with Rejuvenation for High Availability of Networking Service (네트워크 서비스의 가용도 향상를 위한 재활기법의 다중화 시스템 분석)

  • Ryu, Hong-Rim;Shim, Jaechan;Ryu, Hoyong;Lee, Yutae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.9
    • /
    • pp.1717-1722
    • /
    • 2016
  • Availability, one of the important metrics used to assess the performance of network system, is defined as the probability that a system is operational at a given point in time under a given set of environmental conditions. To improve the availability of the network service, the redundancy models and the rejuvenation schemes are the effective schemes to be typically used. In this paper, we analyse the effect of 2N redundancy model and/or rejuvenation scheme on the availability of network service. The 2N redundancy model consists of one active and one standby component and the performance of time-based rejuvenation scheme mainly depends on its rejuvenation period. We design stochastic reward net model for the 2N redundancy model with time-based rejuvenation scheme and analyse the service availability of the model using stochastic Petri net package. We provide some numerical examples of the service availability, which shows that the system with rejuvenation has higher availability than the system without rejuvenation.

A Call Admission Control Technique of Wireless Networks using Stochastic Petri Nets (추계적 페트리 네트를 이용한 무선망에서의 호 수락 제어 기법)

  • 노철우
    • The Journal of the Korea Contents Association
    • /
    • v.3 no.4
    • /
    • pp.55-62
    • /
    • 2003
  • In this paper, a call admission contro(cac) technique is proposed to reduce the dropping probabilities of handoff calls in wireless networks while guaranteeing QoS to the users. The proposed technique is based on the estimated effective load for the target eel if a call is accepted. When the estimated effective load is higher than a predetermined threshold, a nu call is blocked and a handoff call is queued irrespective of the availability channels. The SRN, an extended Stochastic Petri Net, modes are constructed to compare the performance of the techniques. The SRN uses rewards concepts instead of the complicate numerical analysis required for the Markov chain modes. As a result, the SRN modeling techniques provide an easier way to carry out performance analysis for call admission control and channel allocation.

  • PDF

Modeling and Simulation of Ship Panel-block Assembly Line Using Petri Nets (Petri Nets을 이용한 조선소 패널 블록 조립 라인의 모델링과 시뮬레이션)

  • Han, Sang-Dong;Ryu, Cheol-Ho;Shin, Jong-Gye;Lee, Jong-Kun
    • Korean Journal of Computational Design and Engineering
    • /
    • v.13 no.1
    • /
    • pp.36-44
    • /
    • 2008
  • This paper proposes a modeling and simulation process of a panel production line (PPL) in a shipyard. The panel production line is an assembly process to produce a main panel of a flat block and a curved block. In this paper, its activity analysis is carried out using expression of IDEF0, and its process is qualitatively and quantitatively analyzed and modeled by Petri Nets. A commercial discrete event simulation tool, $QUEST^{TM}$, is used for virtual PPL and simulation. The modeling results by Petri Net are mapped to elements of the simulation tool. Finally, an integrated simulation environment of PPL is implemented in order to efficiently utilize the virtual PPL model. With the help of IDEF0 and Petri Nets, we could systematically analyze and describe the PPL process that are characterized as being concurrent, asynchronous, distributed, parallel, nondeterministic, and/or stochastic. Also, the dynamic and concurrent activities of a PPL system were able to be simulated. A timing concept can be included into the Petri nets model to evaluate performance and dependability issues of the system.