We propose DAB -- a data-aware extension of the BPMN de-facto standard with the ability of operating over case and persistent data (partitioned into a read-only catalog and a read-write repository), and that balances between expressiveness and the possibility of supporting parameterized verification of safety properties on top of it. In particular, we take inspiration from the literature on verification of artifact systems, and consider verification problems where safety properties are checked irrespectively of the content of the read-only catalog, possibly considering an unbounded number of active cases and tuples in the catalog and repository. Such problems are tackled using fully implemented array-based backward reachability techniques belonging to the well-established tradition of SMT model checking. We also identify relevant classes of DABs for which the backward reachability procedure implemented in the MCMT array-based model checker is sound and complete, and then further strengthen such classes to ensure termination.
- Pub Date:
- May 2019
- Computer Science - Logic in Computer Science
- This article builds upon arXiv:1906.07811, extending it in two respects. First, while arXiv:1906.07811 focuses on the verification of DABs considering a single, running case, we consider here the possibility of (unboundedly many) cases running concurrently. Second, we provide full proofs of the technical results, including those from arXiv:1906.07811 and those for this version