Skip to content

Formal verification of automated teller machine systems using SPIN

License

Notifications You must be signed in to change notification settings

ikhwan12/formal-verification-atm-spin

Repository files navigation

formal-verification-atm-spin

Formal verification of automated teller machine systems using SPIN

Formal verification is a technique for ensuring the correctness of systems. This work focuses on verifying a model of the Automated Teller Machine (ATM) system against some specifications. We construct the model as a state transition diagram that is suitable for verification. The specifications are expressed as Linear Temporal Logic (LTL) formulas. We use Simple Promela Interpreter (SPIN) model checker to check whether the model satisfies the formula. This model checker accepts models written in Process Meta Language (PROMELA), and its specifications are specified in LTL formulas.

Full Article : https://aip.scitation.org/doi/pdf/10.1063/1.4994448

About

Formal verification of automated teller machine systems using SPIN

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published