A survey of behaviour and equivalence preserving refinements of Petri nets
APN 90 Proceedings on Advances in Petri nets 1990
Rule-based refinement of high-level nets preserving safety properties
Science of Computer Programming - Specical issue on fundamental approaches to software engineering
On the analysis and synthesis of free choice systems
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
Free Choice Petri Nets (Cambridge Tracts in Theoretical Computer Science)
Free Choice Petri Nets (Cambridge Tracts in Theoretical Computer Science)
On the relationship between workflow models and document types
Information Systems
The Behavior Properties of Refinement of Petri Nets and Application in Parallel Programming
CSIE '09 Proceedings of the 2009 WRI World Congress on Computer Science and Information Engineering - Volume 03
Soundness and separability of workflow nets in the stepwise refinement approach
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
A top-down Petri net-based approach for dynamic workflow modeling
BPM'03 Proceedings of the 2003 international conference on Business process management
Soundness of workflow nets: classification, decidability, and analysis
Formal Aspects of Computing
On Generating *-Sound Nets with Substitution
ACSD '11 Proceedings of the 2011 Eleventh International Conference on Application of Concurrency to System Design
Structuring acyclic process models
Information Systems
Understanding business process models: the costs and benefits of structuredness
CAiSE'12 Proceedings of the 24th international conference on Advanced Information Systems Engineering
Determining Sound Markings in Structured Nets
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
| Hi-index | 0.00 |
We present a method for hierarchically generating sound workflow nets by substitution of nets with multiple inputs and outputs. We show that this method is correct and generalizes the class of nets generated by other hierarchical approaches. The method involves a new notion of soundness which is preserved by the generalized type of substitution that is presented in this paper. We show that this notion is better suited than @?-soundness for use with the presented type of generalized substitution, since @?-soundness is not preserved by it. It is moreover shown that it is in some sense the optimal notion of soundness for the purpose of generating sound nets by the presented type of substitution.