| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
A Formal Model of Extended Finite State Machines
| Title: | A Formal Model of Extended Finite State Machines |
| Authors: | Michael Foster (jmafoster1 /at/ sheffield /dot/ ac /dot/ uk), Achim D. Brucker (a /dot/ brucker /at/ exeter /dot/ ac /dot/ uk), Ramsay G. Taylor (r /dot/ g /dot/ taylor /at/ sheffield /dot/ ac /dot/ uk) and John Derrick (j /dot/ derrick /at/ sheffield /dot/ ac /dot/ uk) |
| Submission date: | 2020-09-07 |
| Abstract: | In this AFP entry, we provide a formalisation of extended finite state machines (EFSMs) where models are represented as finite sets of transitions between states. EFSMs execute traces to produce observable outputs. We also define various simulation and equality metrics for EFSMs in terms of traces and prove their strengths in relation to each other. Another key contribution is a framework of function definitions such that LTL properties can be phrased over EFSMs. Finally, we provide a simple example case study in the form of a drinks machine. |
| BibTeX: |
@article{Extended_Finite_State_Machines-AFP,
author = {Michael Foster and Achim D. Brucker and Ramsay G. Taylor and John Derrick},
title = {A Formal Model of Extended Finite State Machines},
journal = {Archive of Formal Proofs},
month = sep,
year = 2020,
note = {\url{http://isa-afp.org/entries/Extended_Finite_State_Machines.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Depends on: | FinFun |
| Used by: | Extended_Finite_State_Machine_Inference |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |