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

Main Article Content

C.A. Fernández-Fernández
A.J.H. Simons

Abstract

This paper describes an implementation of the Task Algebra, a formal model of hierarchical tasks and workflows, inthe Haskell programming language. Previously we presented the Task Algebra as a formal, unambiguous notationcapturing the kinds of activity and workflow typically seen in business analysis diagrams, similar to UML use case andactivity diagrams. Here, we show how the abstract syntax for the Task Algebra may be parsed and then semanticallyanalysed, by a suite of Haskell functions, to compute the execution traces of a system. The approach is illustratedwith a case study of a journal management system. The results show how it is possible to automate the semanticanalysis of requirements diagrams, as a precursor to developing a logical design.

Article Details

How to Cite
Fernández-Fernández, C., & Simons, A. (2014). An Implementation of the Task Algebra, a Formal Specification for the Task Model in the Discovery Method. Journal of Applied Research and Technology, 12(5). https://doi.org/10.1016/S1665-6423(14)70597-8
Section
Articles