Petri nets with semi-structured data

This paper proposes Structured Data Nets (SDN), a Petri net extension that describes transactional systems with data. In these nets, tokens are semi-structured documents. Each transition is attached to a query, guarded by patterns, (logical assertions on the contents of its preset) and transforms tokens. We define SDNs and their semantics. We then consider their formal properties: coverability of a marking, termination and soundness of transactions. Unrestricted SDNs are Turing complete , so these properties are undecidable. We thus use an order on documents , and show that under reasonable restrictions on documents and on the expressiveness of patterns and queries, SDNs are well-structured transition systems, for which coverability, termination and soundness are decidable.

[1]  Matjaz B. Juric,et al.  Business process execution language for web services , 2004 .

[2]  Guoli Ding,et al.  Subgraphs and well-quasi-ordering , 1992, J. Graph Theory.

[3]  Joël Ouaknine,et al.  Nets with Tokens which Carry Data , 2008, Fundam. Informaticae.

[4]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[5]  Francesco Tiezzi,et al.  A calculus for orchestration of web services , 2012, J. Appl. Log..

[6]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[7]  Richard Hull,et al.  Introducing the Guard-Stage-Milestone Approach for Specifying Business Entity Lifecycles , 2010, WS-FM.

[8]  Loïc Hélouët,et al.  Sessions with an Unbounded Number of Agents , 2014, 2014 14th International Conference on Application of Concurrency to System Design.

[9]  Anil Nigam,et al.  Business artifacts: An approach to operational specification , 2003, IBM Syst. J..

[10]  Ioana Manolescu,et al.  Active XML: A Data-Centric Perspective on Web Services , 2004, Web Dynamics.

[11]  Nobuko Yoshida,et al.  Multiparty asynchronous session types , 2008, POPL '08.

[12]  Serge Abiteboul,et al.  Positive active XML , 2004, PODS '04.

[13]  Wil M. P. van der Aalst.  Business Process Execution Language , 2009, Encyclopedia of Database Systems.

[14]  Loïc Hélouët,et al.  A grammatical approach to data-centric case management in a distributed collaborative environment , 2014, SAC.

[15]  Philippe Schnoebelen,et al.  Reset Nets Between Decidability and Undecidability , 1998, ICALP.

[16]  Thomas A. Henzinger,et al.  Forward Analysis of Depth-Bounded Processes , 2010, FoSSaCS.

[17]  Jan Mendling.  Business Process Execution Language for Web Service (BPEL) , 2006 .

[18]  Roberto Bruni,et al.  Multiparty Sessions in SOC , 2008, COORDINATION.

[19]  Lucia Acciai,et al.  Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types , 2009, ICALP.

[20]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[21]  Irena Holubová,et al.  Statistical Analysis of Real XML Data Collections , 2006, COMAD.

[22]  Francisca Santana Robles,et al.  Coloured Petri Nets Basic Concepts, Analysis Methods and Practical Use , 2015 .

[23]  Alin Deutsch,et al.  Artifact systems with data dependencies and arithmetic , 2011, ICDT '11.

[24]  Roberto Bruni,et al.  Sessions and Pipelines for Structured Service Programming , 2008, FMOODS.

[25]  Jayadev Misra,et al.  Computation Orchestration , 2007, Software & Systems Modeling.

[26]  Anca Muscholl,et al.  Verifying Recursive Active Documents with Positive Data Tree Rewriting , 2010, FSTTCS.

[27]  Francisco Curbera,et al.  Web Services Business Process Execution Language Version 2.0 , 2007 .