TY - CHAP AU - Foster, Michael AU - Taylor, Ramsay G. AU - Brucker, Achim D. AU - Derrick, John ED - Dong, Jin Song ED - Sun, Jing PY - 2018 DA - 2018// TI - Formalising Extended Finite State Machine Transition Merging BT - ICFEM T3 - Lecture Notes in Computer Science SP - 373 EP - 387 IS - 11232 PB - Springer-Verlag CY - Heidelberg KW - model inference, state machine models, EFSM AB - Model inference from system traces, e.g. for analysing legacy components or generating security tests for distributed components, is a common problem. Extended Finite State Machine (EFSM) models, managing an internal state as a set of registers, are particular well suited for capturing the behaviour of stateful components however, existing inference techniques for (E)FSMs lack the ability to infer the internal state and its updates functions. In this paper, we present a novel approach for inferring EFSMs from system traces that also infers the updates of the internal state. Our approach supports the merging of transitions that update the internal data state. Finally, our model is formalised in Isabelle/HOL, allowing for the machine-checked verification of system properties. SN - 978-3-030-02449-9 L1 - https://www.brucker.ch/bibliography/download/2018/foster.ea-efsm-2018.pdf UR - https://www.brucker.ch/bibliography/abstract/foster.ea-efsm-2018 UR - https://doi.org/10.1007/978-3-030-02450-5 DO - 10.1007/978-3-030-02450-5 LA - USenglish ID - foster.ea:efsm:2018 ER -