Finite State Machines
Edit Page
Report
Scan day: 03 March 2014 UTC
20
Virus safety - good
Description: Java package which allows the specification and automatic translation of Finite State Machines. FSMs can be used to model a wide variety of processes, behaviours and interactions in arguably more suitable ways than just using Java alone. [Freeware]
Finite State Machine Specification and Generation in Java SIGPLAN Notices Paper on Hybrid State Machine Notation Finite state machines (FSM) have become a standard model for representing object behavior. UML adopted this model. Experts from the software industry advocate use of state machines. Many real-time systems can be classified as FSMs. Numerous specification notations are based on the concept of FSMs. UML and SDL incorporate FSM notations. A FSM is defined by the following: a finite set of states, a finite set of event categories and transitions mapping some state-event pairs to other states. Actions are normally associated with transitions. Since the level of FSM specifications is pretty low, Harel introduced hierarchical statecharts in order to reduce the size of the specifications. State machines can be constructed from regular expressions. Regular expressions are a more capacious notation, but in general, they are not a good fit for specification of software units categorized as FSMs because regular expressions lack hooks for attaching actions.
Size: 1071 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Finite State Machines |
| Keywords: | |
| Description: | |
| IP-address: | 67.210.110.85 |
WHOIS Info
| NS | Name Server: NS1.LUNARMANIA.COM Name Server: NS2.LUNARMANIA.COM |
| WHOIS | Status: clientTransferProhibited |
| Date | Creation Date: 18-jun-2002 Expiration Date: 18-jun-2015 |