Petri net + nested relational calculus = dataflow

Hidders, Jan and Kwasnikowska, N. and Sroka, J. and Tyszkiewicz, J. and Van den Bussche, J. (2005) Petri net + nested relational calculus = dataflow. In: Meersman, R. and Tari, Z. and Hacid, M.-S. and Mylopoulos, J. and Pernici, B. and Babaoglu, O. and Jacobsen, H.-A. and Loyall, J.P. and M., Kifer and Spaccapietra, S. (eds.) On the Move to Meaningful Internet Systems 2005. Lecture Notes in Computer Science 3760. Springer, pp. 220-237. ISBN 9783540297369.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/11575771\_16

Abstract

In this paper we propose a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated and the structure of the manipulated data is reflected in the structure of the workflow. It is a common extension of Petri nets, which are responsible for the organization of the processing tasks, and Nested relational calculus, which is a database query language over complex objects, and is responsible for handling collections of data items (in particular, for iteration) and for the typing system. We demonstrate that dataflows constructed in hierarchical manner, according to a set of refinement rules we propose, are sound: initiated with a single token (which may represent a complex scientific data collection) in the input node, terminate with a single token in the output node (which represents the output data collection). In particular they always process all of the input data, leave no ”debris data” behind and the output is always eventually computed.

Metadata

Item Type:	Book Section
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	13 Apr 2021 17:48
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43882

Statistics

Archive Staff Only (login required)

Edit/View Item