### 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.

### License

BSD License

### Topics

- Computer science/Automata and formal languages

### Session Extended_Finite_State_Machines

- Trilean
- Value
- VName
- Value_Lexorder
- AExp
- AExp_Lexorder
- GExp
- GExp_Lexorder
- FSet_Utils
- Transition
- Transition_Lexorder
- EFSM
- EFSM_LTL
- Drinks_Machine
- Drinks_Machine_2
- Drinks_Machine_LTL

### Depends on

- Code Generation for Functions as Data

### Used by

- Inference of Extended Finite State Machines

### Auto-related entries

- Paraconsistency

## Cite

×

Extended_Finite_State_Machines-AFP

    @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   = {September},
      year    = {2020},
      note    = {\url{https://isa-afp.org/entries/Extended_Finite_State_Machines.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Sep 19, 2020 : Isabelle2020