scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Timed Petri nets and their application to communication protocol specification

J.J. Zhu1, R.T. Denton1
23 Oct 1988-pp 195-199
TL;DR: The authors present a model to represent a timer in order to model real communication systems properly and the results provided show that communication protocols involving timers and transmission errors can be modeled.
Abstract: A generalized timed Petri net representation is defined and several time Petri net models compared. By introducing a new way to include a time variable in the Petri net and the firing rules, the authors realized a new timed Petri net that includes the other two principal types of timed Petri nets. This new timed Petri net seems to take a more general form than other types of time Petri nets defined so far. Therefore, complex systems are expected to be modeled with it. The authors present a model to represent a timer in order to model real communication systems properly. An example is given in which the timed Petri net representation and the timer model are applied to a communication protocol. With the results provided, communication protocols involving timers and transmission errors can be modeled. >
Citations
More filters
Journal ArticleDOI
Jiacun Wang1
01 Jul 2007
TL;DR: A timed Petri net model is built to support the analysis of the charging system performance versus various factors when the system works in the normal status, which gives the maximum supportable busy hour call attempts of the GPRS network.
Abstract: Charging is one of the most important functionalities in a telecommunication service system In a general packet radio service (GPRS) wireless network, the load of charging information flow depends on the intensity of call traffic and the size of charging records During busy hours, the GPRS network might not be able to transfer charging records on a timely basis if new charging records are generated too fast On the other hand, when a call happens, the related charging information must be collected and transferred to the billing system If a failure of the data link occurs, a secondary data link must be employed to transfer the charging information However, this redundant operation might result in charging information duplication This paper formally addresses these two issues A timed Petri net model is built to support the analysis of the charging system performance versus various factors when the system works in the normal status, which, in particular, gives the maximum supportable busy hour call attempts of the GPRS network The Petri net approach is also used to model and verify the correctness of the redundancy operation in case a connection failure occurs

14 citations


Cites background or methods from "Timed Petri nets and their applicat..."

  • ...are very well suitable for the modeling and analysis of communication protocols and networks [3], [4], [7], [9], [17]....

    [...]

  • ...We can find the charging information collection throughput either based on theoretical analysis [11], [17], or through simu-...

    [...]

Journal ArticleDOI
TL;DR: The focus of the paper is how to model autonomous behaviours of heterogeneous multi-agent systems such that it can be verified that they will always operate within predefined mission requirements and constraints using formal methods with an abstraction of the behaviours modelling and model checking for their verification.
Abstract: The focus of the paper is how to model autonomous behaviours of heterogeneous multi-agent systems such that it can be verified that they will always operate within predefined mission requirements and constraints. This is done by using formal methods with an abstraction of the behaviours modelling and model checking for their verification. Three case studies are presented to verify the decision-making behaviours of heterogeneous multi-agent system using a convoy mission scenario. The multi-agent system in a case study has been extended by increasing the number of agents and function complexity gradually. For automatic verification, model checker for multi-agent systems (MCMAS) is adopted due to its novel capability to accommodate the multi-agent system and successfully verifies the targeting behaviours of the team-level autonomous systems. The verification results help retrospectively the design of decision-making algorithms improved by considering additional agents and behaviours during three steps of sce...

11 citations


Cites background from "Timed Petri nets and their applicat..."

  • ...To tackle these types of systems, various types of canonical PNs are considered such as timed-PNs (Walter 1983; Zhu and Denton 1988; He 1991; Ohta and Hisamura 1993), stochastic PNs (Molloy 1982) and generic PNs (Bi, Zhang, and Li 2001)....

    [...]

Dissertation
25 Sep 2013
TL;DR: The feasibility of model checking algorithms as a verification tool of a multi- agent system in an initial design stage is demonstrated and can be an important first step of the certification of multi-agent autonomous systems for the domains of robotics, aerospace and aeronautics.
Abstract: An autonomous system has been widely applied for various civil/military research because of its versatile capability of understanding high-level intent and direction of a surrounding environment and targets of interest. However, as autonomous systems can be out of control to cause serious loss, injury, or death in the worst case, the verification of their functionalities has got increasing attention. For that reason, this study is focused on the verification of a heterogeneous multi-agent autonomous system. The thesis first presents an overview of formal methods, especially focuses on model checking for autonomous systems verification. Then, six case studies are presented to verify the decision making behaviours of multi-agent system using two basic scenarios: surveillance and convoy. The initial system considered in the surveillance mission consists of a ground control system and a micro aerial vehicle. Their decision-making behaviours are represented by means of Kripke model and computational tree logic is used to specify the properties of this system. For automatic verification, MCMAS (Model Checker for Multi-Agent Systems) is adopted due to its novel capability to accommodate the multi-agent system. After that, the initial system is extended to include a substitute micro aerial vehicle. These initial case studies are then further extended based on SEAS DTC exemplar 2 dealing with behaviours of convoy protection. This case study includes now a ground control system, an unmanned aerial vehicle, and an unmanned ground vehicle. The MCMAS successfully verifies the targeting behaviours of the team-level unmanned systems. Reversely, these verification results help retrospectively improve the design of decision-making algorithms by considering additional agents and behaviours during four steps of scenario modification. Consequently, the last scenario deals with the system composed of a ground control system, two unmanned aerial vehicles, and four unmanned ground vehicles with fault-tolerant and communications relay capabilities. In conclusion, this study demonstrates the feasibility of model checking algorithms as a verification tool of a multi-agent system in an initial design stage. Moreover, this research can be an important first step of the certification of multi-agent autonomous systems for the domains of robotics, aerospace and aeronautics. To My beloved father, mother, my handsome husband, and my lovely daughter

8 citations


Cites background from "Timed Petri nets and their applicat..."

  • ...To tackle these type of systems, various type of canonical Petri nets are considered such as timed-Petri nets [62, 63, 64] and stochastic Petri nets [65]....

    [...]

Proceedings ArticleDOI
27 Oct 2002
TL;DR: An extension of Petri net named generalized differential Petri nets (GDPN) is proposed to model HDS that have a combination of discrete-event evolution and continuous state evolution.
Abstract: There has been considerable interest in the modeling and simulation of hybrid dynamic systems (HDS). As an effective modeling tool of discrete event dynamic systems, Petri nets have a dual nature of a graphical tool and a mathematical object. In this paper, an extension of Petri net named generalized differential Petri nets (GDPN) is proposed to model HDS that have a combination of discrete-event evolution and continuous state evolution. Differential place and differential transition defined by Demongodin et al. (1998) are used to model the numeral simulation of the continuous dynamic process, and the weights defined on the directed arcs that connects the differential transitions and places are extended from real numbers to real matrices. The marking of differential place are also enlarged from real numbers to real vectors. Then the evolution rules and modeling method of HDS with GDPN are introduced. Two examples are used to illustrate the modeling power of GDPN in HDS.

7 citations

01 Jan 2007
TL;DR: This research addresses an important aspect of mul that addresses issues among distributed, interconnected and intelligent systems such as conflicts of interests, global constraints, and sharing of resources.
Abstract: Multi-agent systems have emerged as a new field that addresses issues among distributed, interconnected and intelligent systems such as conflicts of interests, global constraints, and sharing of resources. Our research addresses an important aspect of mul

5 citations


Cites methods from "Timed Petri nets and their applicat..."

  • ...For example, PNs serve as a popular tool for flexible and au­ tomated manufacturing systems [Moore and Gupta, 1996], for performance evaluation [Ra­ mamoorthy and Ho, 1990], for communication networks [Gressier, 1985; Zhu and Denton, 1988], for traffic control systems [Mandrioli et al....

    [...]

References
More filters
Book
01 Jan 1981

3,509 citations

Journal ArticleDOI
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

Book
01 Nov 1989
TL;DR: An extended timed Petri net model is used to model clearly the synchronization involved in these systems, and it is found that the computational complexity involved increases in the same order as they are listed above.
Abstract: Some analysis techniques for real-time asynchronous concurrent systems are presented. In order to model clearly the synchronization involved in these systems, an extended timed Petri net model is used. The system to be studied is first modeled by a Petri net. Based on the Petri net model, a system is classified into either: 1) a consistent system; or 2) an inconsistent system. Most real-world systems fall into the first class which is further subclassified into i) decision-free systems; ii) safe persistent systems; and iii) general systems. Procedures for predicting and verifying the system performance of all three types are presented. It is found that the computational complexity involved increases in the same order as they are listed above.

553 citations

Journal ArticleDOI
TL;DR: In this article, an extended timed Petri net model is used to model the synchronization involved in real-time asynchronous concurrent systems, and procedures for predicting and verifying the system performance are presented.
Abstract: Some analysis techniques for real-time asynchronous concurrent systems are presented. In order to model clearly the synchronization involved in these systems, an extended timed Petri net model is used. The system to be studied is first modeled by a Petri net. Based on the Petri net model, a system is classified into either: 1) a consistent system; or 2) an inconsistent system. Most real-world systems fall into the first class which is further subclassified into i) decision-free systems; ii) safe persistent systems; and iii) general systems. Procedures for predicting and verifying the system performance of all three types are presented. It is found that the computational complexity involved increases in the same order as they are listed above.

503 citations