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



Título del documento: An Implementation of the Task Algebra, a Formal Specification for the Task Model in the Discovery Method
Revue: Journal of applied research and technology
Base de datos: PERIÓDICA
Número de sistema: 000380510
ISSN: 1665-6423
Autores: 1
2
Instituciones: 1Universidad Tecnológica de la Mixteca, Instituto de Computación, Huajuapan de León, Oaxaca. México
2University of Sheffield, Department of Computer Science, Sheffield, Yorkshire. Reino Unido
Año:
Periodo: Oct
Volumen: 12
Número: 5
Paginación: 908-918
País: México
Idioma: Inglés
Tipo de documento: Artículo
Enfoque: Experimental, aplicado
Resumen en inglés 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
Disciplinas: Ciencias de la computación,
Matemáticas
Palabras clave: Programación,
Matemáticas aplicadas,
Tareas jerárquicas,
Flujo de trabajo,
Especificación formal,
Algebra
Keyword: Computer science,
Mathematics,
Programming,
Applied mathematics,
Hierarchical tasks,
Workflow,
Formal specification,
Algebra
Texte intégral: Texto completo (Ver HTML)