An Implementation of the Task Algebra, a Formal Specification for the Task Model in the Discovery Method

This paper describes an implementation of the Task Algebra, a formal model of hierarchical tasks and workflows, in the Haskell programming language. Previously we presented the Task Algebra as a formal, unambiguous notation capturing the kinds of activity and workflow typically seen in business anal...

Full description

Saved in:
Bibliographic Details
Published in:Journal of applied research and technology 2014-10, Vol.12 (5), p.908-918
Main Authors: Fernández-Fernández, C.A., Simons, A.J.H.
Format: Article
Language:English
Subjects:
formal specification
lightweight formal methods
software modeling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper describes an implementation of the Task Algebra, a formal model of hierarchical tasks and workflows, in the Haskell programming language. Previously we presented the Task Algebra as a formal, unambiguous notation capturing the kinds of activity and workflow typically seen in business analysis diagrams, similar to UML use case and activity diagrams. Here, we show how the abstract syntax for the Task Algebra may be parsed and then semantically analysed, by a suite of Haskell functions, to compute the execution traces of a system. The approach is illustrated with a case study of a journal management system. The results show how it is possible to automate the semantic analysis of requirements diagrams, as a precursor to developing a logical design.
ISSN:1665-6423
DOI:10.1016/S1665-6423(14)70597-8