The fsmActions package

[Tags:bsd3, library]

This is a library for representing and manipulating finite state machines (FSMs) in Haskell, with an emphasis on computing the effects of sequences of transitions across entire machines (which we call actions), and in particular investigating action equivalences between such sequences.


[Skip to Readme]

Properties

Versions 0.1, 0.2.0, 0.3.0, 0.4.0, 0.4.1, 0.4.2, 0.4.3, 0.4.4
Dependencies base (>=3 && <5), bytestring, containers, mtl, parsec, pretty [details]
License BSD3
Author Andy Gimblett <haskell@gimbo.org.uk>
Maintainer Andy Gimblett <haskell@gimbo.org.uk>
Stability Unknown
Category Data
Uploaded Tue Jun 30 16:28:43 UTC 2009 by AndyGimblett
Distributions NixOS:0.4.4
Downloads 1680 total (13 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for fsmActions

Readme for fsmActions-0.1

fsmActions
==========

This is a library for representing and manipulating finite state
machines (FSMs) in Haskell, with an emphasis on computing the effects
of sequences of transitions across entire machines (which we call
actions), and in particular investigating action equivalences between
such sequences.

The motivation for writing this library is investigating models of
user interfaces; in this context, states are implicit, transitions
correspond to UI events (e.g. button presses), and sequences of
transitions correspond to sequences of user actions.  We're interested
in comparing actions, which are the effects of sequences of
transitions across the whole device (for example, noticing when some
action is in fact an undo); for that we need a representation geared
towards such comparisons -- hence this library, and its idiosyncratic
view of FSMs.

See doc/fsmActions.pdf for more information.