A Formal Model of Extended Finite State Machines (Q7361502)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Extended_Finite_State_Machines
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Formal Model of Extended Finite State Machines |
AFP entry Extended_Finite_State_Machines |
Statements
7 September 2020
0 references
Michael Foster
0 references
Achim D. Brucker
0 references
Ramsay G. Taylor
0 references
John Derrick
0 references
A Formal Model of Extended Finite State Machines (English)
0 references
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.
0 references
