Correctness by Construction with Logic-Labeled Finite-State Machines - Comparison with Event-B
File version
Author(s)
Hexel, Rene
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Alan Fekete & Fethi Rabhi
Date
Size
File type(s)
Location
Sydney, AUSTRALIA
License
Abstract
Formal methods have seen emergent success re- cently with the deployment of Event-B. However, Event-B ex- plicitly postulates that models there are not executable. This seems to contradict the parallel emergence of model-driven development (MDD). We show here that logic-labeled finite-state machines (LLFSMs) are effective in carrying out the "correct from construction" agenda of formal methods such as Event- B and simultaneously achieve the aims of MDD. As a result, we obtain models that are directly interpretable, compilable, and executable enabling traceability, transparency and rapid maintainability; while at the same time enabling simulation, validation and formal verification with model checking. Moreover, the Event-B capacity to develop closed models is also very natural with arrangements of LLFSMs; and therefore further safety analysis such as failure-mode effects analysis (FMEA) can be performed. We demonstrate this with two well-known examples in the literature.
Journal Title
Conference Title
2014 23RD AUSTRALASIAN SOFTWARE ENGINEERING CONFERENCE (ASWEC)
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Software Engineering