February 01, 2011
Mark Wielaard: New GPG key.
Finally created a new GPG key using gnupg. The old one was a DSA/1024 bits one and 8 years old. The new one is a RSA/2048 bits one. I will use the new one in the future to sign any release tarballs I might create. pub 2048R/57816A6A 2011-01-29 Key f...
More »
February 01, 2011
Andrew Hughes: [SECURITY] IcedTea6 1.7.8, 1.8.5, 1.9.5 Released!.
We are pleased to announce a new set of security releases, IcedTea6 1.7.8, IcedTea6 1.8.5 and IcedTea6 1.9.5.
This update contains the following security updates:
The IcedTea project provides a harness to build the source code from OpenJDK6 u...
More »
December/2024
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 |
24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | | | | |
|
|
New Article: Finite State Machine Supporting Concurrent States
We've just published Jeff Lowery's new article on developing finite state machines in Java. Jeff's article demonstrates how Java enums and EnumSets can be applied to define and validate states and state transitions.
Finite state machines (FSMs) are finding increasing application today. This type of modeling reminds me of my education in physics and chemistry, where a set of distinct potential states exist, and the physical universe toggles among those possibilities. The notion of "in between" doesn't really exist in such a universe. Yet, when you think of electrons jumping between energy states, or quantum mechanics -- you realize that the basis of much of our understanding of the physical universe relies on conceiving the micro-universe as being a kind of finite state machine.
Hence, the growing recognition of the validity of applying states and state transitions to a wide variety of practical problems does indeed make a lot of sense. The macro-scale universe reflects the finite state machine nature that appears to model the micro-scale universe well.
Jeff's article starts out with describing how a typical application can be understood as consisting of a set of states and transitions between those states:
A typical application will go through multiple states during a runtime session, e.g., RUNNING -> PAUSED -> RESTARTED, or (in the case of a data entry form) ENTER -> VALIDATE -> SAVE. The state tr...
Date: September, 09 2009
Url: http://www.java.net/blog/editor/archive/2009/09/09/new-article-finite-state-machine-supporting-concurrent-states
Others News
|