Skip to search formSkip to main contentSkip to account menu

Extended finite-state machine

Known as: EFSM (disambiguation), Efsm, Extended finite state machine 
In a conventional finite state machine, the transition is associated with a set of input Boolean conditions and a set of output Boolean functions. In… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Extended Finite State Machines (EFSMs) are widely used when deriving tests for checking whether a software implementation meets… 
2015
2015
We present a black-box active learning algorithm for inferring extended finite state machines (EFSM)s by dynamic black-box… 
2014
2014
In this paper, we consider the problem of test derivation based on an Extended Finite State Machine EFSM) that is widely used for… 
2009
2009
The extended finite state machine is a powerful model that can capture almost all the aspects of a system. However, testing from… 
2009
2009
This paper is devoted to the derivation of distinguishing sequences for timed Finite State Machines (FSM). Such distinguishing… 
2008
2008
Slicing is a program analysis technique that has been used to remove unnecessary program statements with respect to a criterion… 
2007
2007
An approach for combined modeling of role-based access control systems (RBAC) together with business workflows is presented. The… 
2001
2001
Compared with other test generation methods, the problem of automatically generating executable test cases is addressed in this… 
2001
2001
In this paper, we investigate the low-power synthesis for Extended Finite State Machines (EFSM). It is based on the general…