pith. sign in

arxiv: 1905.12991 · v3 · pith:UK3AYU7Xnew · submitted 2019-05-30 · 💻 cs.LO

Formal Modeling and SMT-Based Parameterized Verification of Multi-Case Data-Aware BPMN

classification 💻 cs.LO
keywords verificationcatalogarray-basedbackwardbpmnclassesdata-awareimplemented
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.