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

Versions0.1, 0.2.0, 0.3.0, 0.4.0, 0.4.1, 0.4.2, 0.4.3, 0.4.4
Change logNone available
Dependenciesbase (>=3 && <5), containers, fgl, graphviz (>=2999.1.0.1), mtl, parsec, pretty [details]
LicenseBSD3
CopyrightAndy Gimblett <haskell@gimbo.org.uk>
AuthorAndy Gimblett <haskell@gimbo.org.uk>
MaintainerAndy Gimblett <haskell@gimbo.org.uk>
StabilityAlpha
CategoryData
Home pagehttp://projects.haskell.org/fsmActions/
Source repositoryhead: darcs get http://code.haskell.org/fsmActions
UploadedMon Jul 20 15:02:30 UTC 2009 by AndyGimblett
Downloads1278 total (64 in last 30 days)
Votes
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for fsmActions-0.3.0

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.