When are two workflows the same?

A.J.H. Hidders, M. Dumas, W.M.P. Aalst, van der, A.H.M. Hofstede, ter, J. Verelst

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

9 Citations (Scopus)

Abstract

In the area of workflow management, one is confronted with a large number of competing languages and the relations between them (e.g. relative expressiveness) are usually not clear. Moreover, even within the same language it is generally possible to express the same workflow in different ways, a feature known as variability. This paper aims at providing some of the formal groundwork for studying relative expressiveness and variability by defining notions of equivalence capturing different views on how workflow systems operate. Firstly, a notion of observational equivalence in the absence of silent steps is defined and related to classical bisimulation. Secondly, a number of equivalence notions in the presence of silent steps are defined. A distinction is made between the case where silent steps are visible (but not controllable) by the environment and the case where silent steps are not visible, i.e., there is an alternation between system events and environment interactions. It is shown that these notions of equivalence are different and do not coincide with classical notions of bisimulation with silent steps (e.g. weak and branching).
Original languageEnglish
Title of host publicationProceedings of Computing: The 11th Australasian Theory Symposium, (CATS'2005)
EditorsM. Atkinson, F. Dehne
Place of PublicationNewcastle, Australia
PublisherAustralian Computer Society
Pages3-11
ISBN (Print)978-192068223-1
Publication statusPublished - 2005

Publication series

NameConferences in Research and Practice in Information Technology
Volume41
ISSN (Print)1445-1336

Fingerprint Dive into the research topics of 'When are two workflows the same?'. Together they form a unique fingerprint.

Cite this