Decidability of k -Soundness for Workflow Nets with an Unbounded Resource

A resource workflow net (RWF-net) is a workflow net, supplied with an additional set of initially marked resource places. Resources can be consumed and/or produced by transitions. Neither the intermediate nor final resource markings are constrained, hence a net can have an infinite number of different reachable states.

[1]  Dan C. Marinescu,et al.  Structural soundness of workflow nets is decidable , 2005, Inf. Process. Lett..

[2]  Kees M. van Hee,et al.  Soundness of Resource-Constrained Workflow Nets , 2005, ICATPN.

[3]  Vladimir A. Bashkin.  Formalization of semantics of systems with unreliable agents by means of nets of active resources , 2010, Programming and Computer Software.

[4]  R. A. van der Toorn,et al.  Component-based software design with Petri nets : an approach based on inheritance of behavior , 2004 .

[5]  Victor E. Malyshkin,et al.  Parallel computing technologies , 2011, The Journal of Supercomputing.

[6]  Vladimir A. Bashkin,et al.  Similarity of Generalized Resources in Petri Nets , 2005, PaCT.

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

[8]  Kees M. van Hee,et al.  Checking Properties of Adaptive Workflow Nets , 2007, Fundam. Informaticae.

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

[10]  Irina A. Lomazova,et al.  Analyzing Compatibility of Services via Resource Conformance , 2013, Fundam. Informaticae.

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

[12]  Vladimir A. Bashkin,et al.  Cellular Resource-Driven Automata , 2012, Fundam. Informaticae.

[13]  Mathias Weske,et al.  Interaction Soundness for Service Orchestrations , 2006, ICSOC.

[14]  Kees M. van Hee,et al.  Generalised Soundness of Workflow Nets Is Decidable , 2004, ICATPN.

[15]  Vladimir A. Bashkin,et al.  Resource Driven Automata Nets , 2011, Fundam. Informaticae.

[16]  Juliane Dehnert,et al.  Relaxed Soundness of Business Processes , 2001, CAiSE.

[17]  Vladimir A. Bashkin,et al.  Resource Similarities in Petri Net Models of Distributed Systems , 2003 .

[18]  Wolfgang Reisig,et al.  Applications and Theory of Petri Nets 2004 , 2004, Lecture Notes in Computer Science.

[19]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

[20]  Parosh Aziz Abdulla,et al.  Simulation Is Decidable for One-Counter Nets (Extended Abstract) , 1998, CONCUR.

[21]  John E. Hopcroft,et al.  On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..

[22]  Vladimir A. Bashkin,et al.  Soundness of Workflow Nets with an Unbounded Resource is Decidable , 2013, PNSE+ModPE.

[23]  Vladimir A. Bashkin,et al.  Petri nets and resource bisimulation , 2003, Fundam. Informaticae.

[24]  Natalia Sidorova,et al.  Soundness for Resource-Constrained Workflow Nets Is Decidable , 2013, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[25]  Winfried Lamersdorf,et al.  Service-Oriented Computing - ICSOC 2006, 4th International Conference, Chicago, IL, USA, December 4-7, 2006, Proceedings , 2006, ICSOC.

[26]  Vladimir A. Bashkin,et al.  Modelling multiagent systems with the help of generalized nets of active resources , 2011 .

[27]  Gianfranco Ciardo,et al.  Applications and Theory of Petri Nets 2005, 26th International Conference, ICATPN 2005, Miami, USA, June 20-25, 2005, Proceedings , 2005, ICATPN.

[28]  Vladimir A. Bashkin.  Modular nets of active resources , 2012, Automatic Control and Computer Sciences.

[29]  Kees M. van Hee,et al.  Workflow Management: Models, Methods, and Systems , 2002, Cooperative information systems.