Complexity of Reachability for Data-Aware Dynamic Systems

A formal model called database manipulating systems was introduced to model data-aware dynamic systems. Its semantics is given by an infinite labelled transition systems where a label can be an unbounded relational database. Reachability problem is undecidable over schemas consisting of either a binary relation or two unary relations. We study the reachability problem under schema restrictions and restrictions on the query language. We provide tight complexity bounds for different combinations of schema and query language, by reductions to/from standard formalism of infinite state systems such as Petri nets and counter systems. Our reductions throw light into the connections between these two seemingly unrelated models.

[1]  Diego Calvanese,et al.  Verification of data-aware commitment-based multiagent system , 2014, AAMAS.

[2]  Parosh Aziz Abdulla,et al.  Recency-Bounded Verification of Dynamic Database-Driven Systems , 2016, PODS.

[3]  Serge Abiteboul,et al.  Relational transducers for electronic commerce , 1998, J. Comput. Syst. Sci..

[4]  Alin Deutsch,et al.  Specification and verification of data-driven Web applications , 2007, J. Comput. Syst. Sci..

[5]  Alin Deutsch,et al.  Automatic verification of data-centric business processes , 2009, ICDT '09.

[6]  S. Rao Kosaraju,et al.  Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

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

[8]  Diego Calvanese,et al.  Foundations of data-aware process analysis: a database theory perspective , 2013, PODS.

[9]  Szymon Torunczyk,et al.  Verification of database-driven systems via amalgamation , 2013, PODS '13.

[10]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[11]  Diego Calvanese,et al.  Verification of relational data-centric dynamic systems with external services , 2012, PODS.

[12]  Giuseppe De Giacomo,et al.  Bounded situation calculus action theories , 2015, Artif. Intell..

[13]  Michal Pilipczuk,et al.  Shortest paths in one-counter systems , 2019, Log. Methods Comput. Sci..

[14]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[15]  Leslie G. Valiant,et al.  Deterministic One-Counter Automata , 1975, J. Comput. Syst. Sci..

[16]  Stéphane Demri,et al.  Reasoning about Data Repetitions with Counter Systems , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[17]  Diego Calvanese,et al.  Soundness of data-aware, case-centric processes , 2016, International Journal on Software Tools for Technology Transfer.

[18]  Diego Calvanese,et al.  Verification of Relational Multiagent Systems with Data Types , 2014, AAAI.

[19]  Alessio Lomuscio,et al.  Model Checking Unbounded Artifact-Centric Systems , 2014, KR.

[20]  Alessio Lomuscio,et al.  An Abstraction Technique for the Verification of Artifact-Centric Systems , 2012, KR.

[21]  Diego Calvanese,et al.  Description Logic Knowledge and Action Bases , 2014, J. Artif. Intell. Res..

[22]  Moshe Y. Vardi.  Model Checking for Database Theoreticians , 2005, ICDT.

[23]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[24]  Manfred Reichert,et al.  Process and Data: Two Sides of the Same Coin? , 2012, OTM Conferences.

[25]  Sylvain Schmitz,et al.  Demystifying Reachability in Vector Addition Systems , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[26]  Francesco Belardinelli,et al.  Verification of non-uniform and unbounded artifact-centric systems: decidability through abstraction , 2014, AAMAS.

[27]  Alin Deutsch,et al.  Verification of Hierarchical Artifact Systems , 2019, ACM Trans. Database Syst..