2006
DOI: 10.1201/9781420013641
|View full text |Cite
|
Sign up to set email alerts
|

Modeling Software with Finite State Machines

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
118
0
11

Year Published

2009
2009
2014
2014

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 185 publications
(129 citation statements)
references
References 0 publications
0
118
0
11
Order By: Relevance
“…An approach introduced by Von Neumann [9] was to approximate the potentially infinite number of states of such a system by a finite number of states, which may be inter-converted according to a set of transition rules, and calculating the state transitions that are assumed to occur over a series of discrete time intervals. This kind of model, termed a finite state machine [9][10][11] has been applied to a wide range of biological problems.…”
mentioning
confidence: 99%
“…An approach introduced by Von Neumann [9] was to approximate the potentially infinite number of states of such a system by a finite number of states, which may be inter-converted according to a set of transition rules, and calculating the state transitions that are assumed to occur over a series of discrete time intervals. This kind of model, termed a finite state machine [9][10][11] has been applied to a wide range of biological problems.…”
mentioning
confidence: 99%
“…• In [3], a formal specification and verification of secure routing protocols for mobile ad hoc networks (MANETs) is presented. In this work, authors used the Promela as specification languages and SPIN as verification tool.…”
Section: Related Workmentioning
confidence: 99%
“…In software engineering, formal specification is the expression in a formal language, and at an abstract level, a set of proprieties; that a system is designed to satisfy [3]. It is recognised that good specifications should be adequate, internally consistent, unambiguous, complete, minimal and satisfied by lower-level ones [2].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Thus a mouse agent's field of vision is equivalent to v. Mouse agents are dynamic agents in that they can change their location, direction, goal direction, turn direction and state. At the same time they are "intelligent" agents in that they can make decisions about which way to face and where to go.The operation of our mouse agent is founded on the well established concept of a Finite State Machine (FSM) [5,8]. FSM are used to model processes in terms of a finite set of states.…”
Section: The Mouse Agentmentioning
confidence: 99%