An implementation of the task algebra, a formal specification for the task model in the discovery method Report as inadecuate




An implementation of the task algebra, a formal specification for the task model in the discovery method - Download this document for free, or read online. Document in PDF available to download.

A. J. H. Simons ;Journal of Applied Research and Technology 2014, 12 (5)

Author: C. A. Fernández-Fernández

Source: http://www.redalyc.org/


Teaser



Journal of Applied Research and Technology ISSN: 1665-6423 jart@aleph.cinstrum.unam.mx Centro de Ciencias Aplicadas y Desarrollo Tecnológico México Fernández-Fernández, C.
A.; Simons, A.
J.
H. An Implementation of the Task Algebra, a Formal Specification for the Task Model in the Discovery Method Journal of Applied Research and Technology, vol.
12, núm.
5, octubre, 2014, pp.
908-918 Centro de Ciencias Aplicadas y Desarrollo Tecnológico Distrito Federal, México Available in: http:--www.redalyc.org-articulo.oa?id=47432518009 How to cite Complete issue More information about this article Journals homepage in redalyc.org Scientific Information System Network of Scientific Journals from Latin America, the Caribbean, Spain and Portugal Non-profit academic project, developed under the open access initiative   An Implementation of the Task Algebra, a Formal Specification for the Task Model in the Discovery Method C.A.
Fernández-Fernández*1 and A.J.H.
Simons2 1 Instituto de Computación Universidad Tecnológica de la Mixteca Huajuapan de León, Oax., México *caff@mixteco.utm.mx 2 Department of Computer Science The University of Sheffield Sheffield, South Yorkshire, United Kingdom ABSTRACT 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. Keywords: soft...





Related documents