Hackage :: [Package]

fsmActions: Finite state machines and FSM actions

[ bsd3, data, library ] [ Propose Tags ] [ Report a vulnerability ]

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]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 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), containers, fgl (>=5.4.2.0), filepath, graphviz (>=2999.14.0.0), MissingH, mtl, parsec (>=3), pretty [details]
License BSD-3-Clause
Copyright Andy Gimblett <haskell@gimbo.org.uk>
Author Andy Gimblett <haskell@gimbo.org.uk>
Maintainer Andy Gimblett <haskell@gimbo.org.uk>
Category Data
Home page http://projects.haskell.org/fsmActions/
Source repo head: darcs get http://code.haskell.org/fsmActions
Uploaded by AndyGimblett at 2012-12-14T17:19:53Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 6508 total (10 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for fsmActions-0.4.4

[back to package description] 
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.