Analysis of Petri Nets with Context-Free Structure Changes
DOI:
https://doi.org/10.14279/tuj.eceasst.71.1003Abstract
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.Downloads
Published
2015-09-06
How to Cite
[1]
N. E. Flick and B. Engelmann, “Analysis of Petri Nets with Context-Free Structure Changes”, eceasst, vol. 71, Sep. 2015.
Issue
Section
Articles
License
Copyright (c) 2015 Electronic Communications of the EASST
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.