Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/87640
Title: | A colored petri net for the France-Paris metro |
Authors: | Spiteri Staines, Tony |
Keywords: | Graph grammars Petri nets Modeling Transport theory |
Issue Date: | 2012 |
Publisher: | North Atlantic University Union |
Citation: | Spiteri Staines, A. (2012). A colored petri net for the France-Paris metro. NAUN International Journal of Computers, 6(2), 111-118. |
Abstract: | This work tries to explain how colored Petri nets (CPNs) can be useful for modeling a real life complex networked transport system. Petri nets are expressive graphical formalisms that are useful for modeling discrete system behavior. Petri nets are well documented and have an extensive amount of well researched areas and interesting applications. Colored Petri nets (CPNs) are very useful extensions to traditional Petri nets, increasing their expressivity and modeling power. An underground metro system is a good case of complexity. The real French Paris Metro system that forms part of the RER is considered and analyzed with part of it being modeled as a colored Petri net or (CPN). The CPN used is as close as possible to the real life system and is fully executable. Different scenarios and results are obtainable from this apart from its usefulness for validation and verification. This paper thus assesses the suitability of colored Petri nets for modeling real world high complexity transport systems. The findings are briefly discussed. |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/87640 |
ISSN: | 1998-4308 |
Appears in Collections: | Scholarly Works - FacICTCIS |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
A_colored_petri_net_for_the_France_Paris_metro.pdf Restricted Access | 1.65 MB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.