Petri net-based approach to modelling ATM and minimising logistic costs in ATM network Online publication date: Sat, 19-Jul-2014
by František Čapkovič
International Journal of Computational Intelligence Studies (IJCISTUDIES), Vol. 2, No. 3/4, 2013
Abstract: Modelling the automatic teller machines (ATMs) by means of place/transition Petri nets (P/T PN) is presented. Then the attendance on elementary machines in an ATM network is partially solved to replenish money from a depot with minimal logistic costs. Namely, a possibility of the marked graph (MG)-based solving the so called travelling salesman's problem (TSP) is pointed out. It utilises the siphons and traps of the MG (being a specific kind of P/T PN) to find Hamiltonian cycles (HCs) of a special weighted directed graph corresponding to MG. While the P/T PN-based ATM model makes possible to propose and analyse the safety policy in order to avoid money frauds, minimising the logistic costs makes possible not only to save the fuel of money transport vehicles but also a flexibly exchange the paths to avoid terroristic attacks. The agent cooperation based on supervising the discrete-event systems is utilised at ATM modelling.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Intelligence Studies (IJCISTUDIES):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook