This example shows how the CP-net from Simple Protocol can be modified so that the retransmission of messages is controlled by a simple timer – modeled by means of two places and two transitions. The CP-net is not using time stamps and hence it should not be confused with the Timed Protocol. The files for this net can be found in a subdir of cpntools […]
Ethernet Network Parametric Models
These models are contributed by Dmitry Zaitsev. We list models without going thru them in too much detail, so listing does not imply that we endorse them or any papers listed, only that we provide them as inspiration. Parametric model has constant structure for any given switched Ethernet network. It contains one copy of each component: switch, workstation, server. A given topology is put as […]
Ethernet Network
This model is contributed by Dmitry Zaitsev. We list models without going thru them in too much detail, so listing does not imply that we endorse them or any papers listed, only that we provide them as inspiration. The model of a given network is composed of submodels of Ethernet switches, workstations and servers. It reflects the process of frames delivery by switches using the […]
Ensemble Coordination for Discrete Event Control
This example was contributed by John C. Sloan. We list models without going thru them in too much detail, so listing does not imply that we endorse them or any papers listed, only that we provide them as inspiration. This example models a distributed ensemble of four controllers that enact a fault triage scheme for a particular remote submersible machine. The case study focuses on […]
Edge Router Discovery Protocol
This protocol models a protocol for routers routing packets between a mobile ad-hod network and a traditional network. The protocol is described in L.M. Kristensen and K. Jensen: “Specification and Validation of an Edge Router Discovery Protocol for Mobile Ad Hoc Networks“, In: Integration of Software Specification Techniques for Applications in Engineering, pages 248-269. Volume 3147 of Lecture Notes in Computer Science — Springer-Verlag, September […]
E6 Network Dynamic Routing
This model is contributed by Dmitry Zaitsev. We list models without going thru them in too much detail, so listing does not imply that we endorse them or any papers listed, only that we provide them as inspiration. The model of a given E6 network is composed of E6 switching-router (SRE6) submodels supplied with traffic generators. SRE6 model contains submodels of ports and routing procedures: […]
Dynamic MANET On-demand Routing Protocol
This model implements the IEFT protocol Dynamic MANET On-demand Routing Protocol (or DYMO). The protocol is described in K.L. Espensen, M.K. Kjeldsen, and L.M.Kristensen: “Modelling and Initial Validation of the DYMO Routing Protocol for Mobile Ad-Hoc Networks“, In: Applications and Theory of Petri Nets, 29th International Conference, PETRI NETS 2008, pages 152-170. Volume 5062 of Lecture Notes in Computer Science — Springer-Verlag, June 2008. If […]
Dining philosophers example
This is a small toy example which is well-suited as an introduction to state spaces (also called occurrence graphs). The analysis of the state space is described in great detail and a large number of different queries are illustrated. The CPN model describes how a number of processes (philosophers) share common resources (chopsticks). The Dining Philosophers is one of the traditional examples used by computer […]
Telephone example
This is a small toy example which describes how the public telephone system – as it is conceived by a user (and not by a telephone technician). We ignore time-outs and special services such as conference calls etc. The example is taken from Sect. 3.2 of Vol. 1 of K. Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, Monographs on Theoretical Computer […]
Simple protocol example
This is a small toy example which is well-suited as an introduction to occurrence graphs. The analysis of the occurrence graph is described in great detail. The CPN model describes a simple protocol by which a sender can transfer a number of packets to a receiver. The model is identical to the Simple Protocol presented in Introductory Examples (which we recommend to study before this […]
