Analysis of Petri Nets with Context-Free Structure Changes

2015/09/06 by Nils Erik Flick, Flick, Nils Erik, Björn Engelmann +1
Business, Management and Accounting · Computer Science · #Business Process Modeling and Analysis #Petri Nets in System Modeling #Service-Oriented Architecture and Web Services

paper · doi:10.14279/tuj.eceasst.71.1003.992

Abstract

Structure-changing Petri nets are Petri nets with transition replacement rules. In this paper, we investigate the restricted class of structure-changing workflow nets and show that two different reachability properties (concrete and abstract reachability) and word membership in the language of labelled firing sequences are decidable, while a language-based notion of correctness (containment of the language of labelled firing sequences in a regular language) is undecidable.

Citations

• Formalization of Petri Nets with Individual Tokens as Basis for DPO Net Transformations

Related

• Analysis of Petri Nets with Context-Free Structure Changes
• Acyclic Petri and Workflow Nets with Resets
• Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
• Language-Preserving Reduction Rules for Block-Structured Workflow Nets
• Soundness of reset workflow nets