On Generating Hierarchical Workflow Nets and their Extensions and Verifying Hierarchicality

[1]  Kees M. van Hee,et al.  Refinement of Synchronizable Places with Multi-workflow Nets , 2013, Fundam. Informaticae.

[2]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[3]  Kees M. van Hee,et al.  Soundness-Preserving Refinements of Service Compositions , 2010, WS-FM.

[4]  Michael Jackson,et al.  Principles of program design , 1975 .

[5]  Boualem Benatallah,et al.  A Top-Down Petri Net-Based Approach for Dynamic Workflow Modeling , 2003, Business Process Management.

[6]  Marlon Dumas,et al.  Structuring acyclic process models , 2012, Inf. Syst..

[7]  Giorgio De Michelis,et al.  Application and theory of Petri nets 1995 : 16th International Conference, Turin, Italy, June 26-30, 1995 : proceedings , 1995 .

[8]  Javier Esparza Reduction and Synthesis of Live and Bounded Free Choice Petri Nets , 1994, Inf. Comput..

[9]  Piotr Chrzastowski-Wachtel Determining Sound Markings in Structured Nets , 2006, Fundam. Informaticae.

[10]  Raymond R. Devillers,et al.  General parameterised refinement and recursion for the M-net calculus , 2003, Theor. Comput. Sci..

[11]  David G. Stork,et al.  Token-Controlled Place Refinement in Hierarchical Petri Nets with Application to Active Document Workflow , 2002, ICATPN.

[12]  Ichiro Suzuki,et al.  A Method for Stepwise Refinement and Abstraction of Petri Nets , 1983, J. Comput. Syst. Sci..

[13]  Manuel Silva Suárez,et al.  Top-down synthesis of live and bounded free choice nets , 1990, Applications and Theory of Petri Nets.

[14]  Hanna Klaudel,et al.  M-nets: a survey , 2008, Acta Informatica.

[15]  Claudia Ermel,et al.  Rule-based refinement of high-level nets preserving safety properties , 2001, Sci. Comput. Program..

[16]  Raymond R. Devillers,et al.  General Refinement for High Level Petri Nets , 1997, FSTTCS.

[17]  Moe Thandar Wynn,et al.  Soundness of workflow nets: classification, decidability, and analysis , 2011, Formal Aspects of Computing.

[18]  Daniel Moldt,et al.  Modelling Mobility and Mobile Agents Using Nets within Nets , 2003, ICATPN.

[19]  Kamel Barkaoui,et al.  Workflow Soundness Verification based on Structure Theory of Petri Nets , 2007 .

[20]  Hejiao Huang,et al.  Structure and behavior preservation by Petri-net-based refinements in system design , 2004, Theor. Comput. Sci..

[21]  Kamel Barkaoui,et al.  Uniform verification of workflow soundness , 2011 .

[22]  Gérard Berthelot Transformations and Decompositions of Nets , 1986 .

[23]  Zhijian Wang,et al.  Modeling Complex System Using T-subnet based Hierarchical Petri Nets , 2009, J. Comput..

[24]  Wolfgang Reisig,et al.  Petri Nets: Central Models and Their Properties , 1986, Lecture Notes in Computer Science.

[25]  Kees M. van Hee,et al.  On the relationship between workflow models and document types , 2009, Inf. Syst..

[26]  Jacek Sroka,et al.  On Generating *-Sound Nets with Substitution , 2011, 2011 Eleventh International Conference on Application of Concurrency to System Design.

[27]  Qi Mei,et al.  The Behavior Properties of Refinement of Petri Nets and Application in Parallel Programming , 2009, 2009 WRI World Congress on Computer Science and Information Engineering.

[28]  Kees M. van Hee,et al.  Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach , 2003, ICATPN.

[29]  Piotr Chrzastowski-Wachtel,et al.  Sound Recoveries of Structural Workflows with Synchronization , 2013, CS&P.

[30]  Manuel Silva Suárez,et al.  Compositional Synthesis of Live and Bounded Free Choice Petri Nets , 1991, CONCUR.

[31]  Manuel Silva Suárez,et al.  On the analysis and synthesis of free choice systems , 1991, Applications and Theory of Petri Nets.

[32]  Rüdiger Valk,et al.  Petri Nets as Token Objects: An Introduction to Elementary Object Nets , 1998, ICATPN.

[33]  Raymond R. Devillers,et al.  The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.

[34]  Wilfried Brauer,et al.  A survey of behaviour and equivalence preserving refinements of Petri nets , 1991, Applications and Theory of Petri Nets.

[35]  Moe Thandar Wynn,et al.  Reduction rules for YAWL workflows with cancellation regions and OR-joins , 2009, Inf. Softw. Technol..

[36]  Heiko Rölke,et al.  Dynamic Transition Refinement , 2007, FOCLASA.

[37]  Jacek Sroka,et al.  On Generating *-Sound Nets with Substitution , 2011, ACSD.