Reduction rules for colored workflow nets

Javier Esparza, Philipp Hoffmann

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

21 Scopus citations

Abstract

We study Colored Workflow nets [8], a model based on Workflow nets [14] enriched with data. Based on earlier work by Esparza and Desel on the negotiation model of concurrency [3,4], we present reduction rules for our model. Contrary to previous work, our rules preserve not only soundness, but also the data flow semantics. For free choice nets, the rules reduce all sound nets (and only them) to a net with one single transition and the same data flow semantics. We give an explicit algorithm that requires only a polynomial number of rule applications.

Original languageEnglish
Title of host publicationFundamental Approaches to Software Engineering - 19th International Conference, FASE 2016 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Proceedings
EditorsAndrzej Wasowski, Perdita Stevens
PublisherSpringer Verlag
Pages342-358
Number of pages17
ISBN (Print)9783662496640
DOIs
StatePublished - 2016
Event19th International Conference on Fundamental Approaches to Software Engineering, FASE 2016 Held as Part of European Joint Conferences on Theory and Practice of Software, ETAPS 2016 - Eindhoven, Netherlands
Duration: 2 Apr 20168 Apr 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9633
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference19th International Conference on Fundamental Approaches to Software Engineering, FASE 2016 Held as Part of European Joint Conferences on Theory and Practice of Software, ETAPS 2016
Country/TerritoryNetherlands
CityEindhoven
Period2/04/168/04/16

Fingerprint

Dive into the research topics of 'Reduction rules for colored workflow nets'. Together they form a unique fingerprint.

Cite this