Enhancing Card Swipe Machines using Mathematical Model with JFLAP Formal Methods and Automation: A Mathematical Model with JFLAP

Authors

  • Farrukh Arslan Department of Electrical Engineering, University of Engineering and Technology (UET), Lahore, Pakistan;
  • Sana Hameed Department of Software Engineering, Lahore Garrison University, Lahore, Pakistan
  • Naveed Imran Department of Software Engineering, Wuhan University, Wuhan, China
  • Zaid Bin Faheem Department of Computer Science IT, The Islamia University of Bahawalpur, Bahawalpur, Pakistan
  • Mubashir Ali Department of Software Engineering, Lahore Garrison University, Lahore, Pakistan & Shenzhen Institute of Advanced Technology, Shenzhen, China.

DOI:

https://doi.org/10.21015/vtm.v11i1.1208

Abstract

Automation is a novel approach that can enhance production capacity, work quality, and working environment, while minimizing labor disputes by automating all handling parameters. Formal methods are scientific techniques used to design complex mathematical systems. They involve specifying requirements and verifying software systems. The card swipe machine is a widely used point-ofsale terminal in supermarkets, medical centers, and shopping malls. Customers can easily make payments through these machines, which also provide detailed receipts of all transactions, including reversed transactions. This resolves cash management issues, improves customer service, and supports marketing. While multiple conventional machines are available in the market, they lack visual representations, making it difficult to understand their working mechanism without graphical representations. Deterministic finite automata (DFA) is a mathematical model that has limited states and moves from one state to another based on input and transition functions. This study proposes the use of the JFLAP software to create a mathematical model of card swipe machine transactions. The proposed model allows for viewing each processing step in a card swipe machine, offering a new approach to understanding their working mechanism.

References

F. J. Kaunang, “Penerapan konsep finite state automata (fsa) pada mesin pembuat ice cream otomatis,”

TeIKa, vol. 9, no. 2, pp. 129–137, 2019.

K. F. Ali, V. Kalyan, and K. A. Kumar, “Design and implementation of ludo game using automata theory,” in 2019 Innovations in Power and Advanced Computing Technologies (i-PACT), vol. 1. IEEE, 2019, pp. 1–6.

D. D’Souza and P. Shankar, Modern applications of automata theory. World Scientific, 2012, vol. 2.

F. J. Kaunang and J. Waworundeng, “Implementation of finite state automata in an amusement park automatic ticket selling machine,” in Abstract Proceedings International Scholars Conference, vol. 7, no. 1, 2019, pp. 1801–1810.

A. C. Say and A. Yakaryılmaz, “Quantum finite automata: A modern introduction,” in Computing with New Resources. Springer, 2014, pp. 208–222.

Y. M. R. Putra, “Sentence analysis with artificial intelligence machine learning using finite state automata,” Proxies: Jurnal Informatika, vol. 1, no. 1, pp. 1–6, 2017.

A. Solihin, E. W. Hidayat, and A. P. Aldya, “Application of the finite state machine algorithm on 2d platformer rabbit games vs zombies,” Jurnal Online Informatika, vol. 4, no. 1, pp. 33–38, 2019.

M. Herrmannsdörfer, S. Konrad, and B. Berenbach, “Tabular notations for state machine-based specifications,” Crosstalk, vol. 21, no. 3, pp. 18–23, 2008.

S. Meilisa, N. Im Manik, and D. Santoso, “Testing deterministic finite automata and non-deterministic finite automata using java program,” Far East Journal of Mathematical Sciences, vol. 82, no. 2, p. 209, 2013.

A. Jamil, A. Ullah, and M. Rehman, “An infinite runner game design using automata theory,” International Journal of Computer Science and Software Engineering, vol. 5, no. 7, p. 119, 2016.

J. H. Poikonen, E. Lehtonen, M. Laiho, and T. Knuutila, “Implementation of nondeterministic finite automata

in an autoassociative cam circuit,” in 2015 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, 2015, pp. 1342–1345.

M. U. P. Pisolkar and S. R. Lahane, “A review on deterministic finite automata compression techniques for efficient pattern matching process,” International Journal of Computer Science and Information Technologies, vol. 5, no. 6, pp. 7323–7325, 2014.

A. Alrehily, R. Fallatah, and V. Thayananthan, “Design of vending machine using finite state machine and visual automata simulator,” International Journal of Computer Applications, vol. 115, no. 18, 2015.

V. Thayananthan, A. Alrehily, and R. Fallatah, “Automata design with time complexity for intelligent vending machine based on visual automata simulator,” in IEEE 17th International Conference on Computer Modelling and Simulation, UK, 2015, pp. 159–164.

D. Ather, R. Singh, and V. Katiyar, “An algorithm to design finite automata that accept strings over input symbol a and b having exactly x number of a & y number of b,” in 2013 International Conference on Information Systems and Computer Networks. IEEE, 2013, pp. 1–4.

F. J. Kaunang, “Penerapan konsep finite state automata (fsa) pada mesin pembuat ice cream otomatis,” TeIKa, vol. 9, no. 2, pp. 129–137, 2019.

N. S. Qureshi, Z. Abbas, M. Sohaib, M. Arshad, R. A. Sabir, and A. Maqsood, “A roller coaster game design using automata theory,” International Journal Of Multidisciplinary Sciences And Engineering, vol. 3, no. 5, 2012.

A. Jamhour and C. García, “Automation of industrial serial processes based on finite state machines,” Procedia Engineering, vol. 42, pp. 186–196, 2012.

H. Kim and K.-I. Choi, “A pipelined non-deterministic finite automaton-based string matching scheme using merged state transitions in an fpga,” PloS one, vol. 11, no. 10, p. e0163535, 2016.

A. A. G. Tulashiram B. Pisal, “Auto generation of dfa with starting and ending constraints,” IJAECS, vol. 3, 2016.

T. Jastrzab, “On parallel induction of nondeterministic finite automata,” Procedia Computer Science, vol. 80, pp. 257–268, 2016.

W. Wieczorek, “Induction of non-deterministic finite automata on supercomputers,” in International Conference on Grammatical Inference. PMLR, 2012, pp. 237–242.

R. Chauhan and C. Trivedi, “A novel approach for construction of minimal deterministic finite automata-rc algorithm.”

D. Liu, Z. Huang, Y. Zhang, X. Guo, and S. Su, “Efficient deterministic finite automata minimization based on backward depth information,” PloS one, vol. 11, no. 11, p. e0165864, 2016.

P. Sarkar and C. Kar, “Adaptive e-learning using deterministic finite automata,” International Journal of Computer Applications, vol. 97, no. 21, 2014.

W. Pacharoen, T. Aoki, P. Bhattarakosol, and A. Surarerks, “Active learning of nondeterministic finite state machines,” Mathematical Problems in Engineering, vol. 2013, 2013.

N. S. Qureshi, H. Mushtaq, M. S. Aslam, M. Ahsan, M. Ali, and M. A. Atta, “Computing game design with automata theory,” International Journal of Multidisciplinary Sciences and Engineering, vol. 3, no. 5, pp. 13–21, 2012.

V. S. Shekhar, A. Agarwalla, A. Agarwal, B. Nitish, and V. Kumar, “Enhancing jflap with automata construction problems and automated feedback,” in 2014 Seventh International Conference on Contemporary Computing (IC3). IEEE, 2014, pp. 19–23.

I. Bezáková, K. Fluet, E. Hemaspaandra, H. Miller, and D. E. Narváez, “Effective feedback for introductory cs theory: A jflap extension and student persistence,” arXiv preprint arXiv:2012.01546, 2020.

R. Alur, L. D’Antoni, S. Gulwani, D. Kini, and M. Viswanathan, “Automated grading of dfa constructions.”

D. Ather, R. Singh, and V. Katiyar, “Simplifying designing techniques: To design dfa that accept strings over?={a, b} having at least x number of a and y number of b,” International Journal of Computer Applications, vol. 91, no. 7, 2014.

S. Devakumar, D. B. Naik, and S. Ramakrishna, “A tool for visualisation of parsers: Jflap,” 2014.

Downloads

Published

2023-03-31

How to Cite

Arslan, F., Hameed, S., Imran, N., Faheem, Z. B., & Ali, M. (2023). Enhancing Card Swipe Machines using Mathematical Model with JFLAP Formal Methods and Automation: A Mathematical Model with JFLAP. VAWKUM Transactions on Computer Sciences, 11(1), 108–122. https://doi.org/10.21015/vtm.v11i1.1208

Issue

Vol. 11 No. 1 (2023): January-June

Section

Articles

License

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC-By) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).

                                      

This work is licensed under a Creative Commons Attribution  License CC BY