Verification of Time-Aware Business Processes Using Constrained Horn Clauses

Abstract

We present a method for verifying properties of time-aware business processes, that is, business process where time constraints on the activities are explicitly taken into account. Business processes are specified using an extension of the Business Process Modeling Notation (BPMN) and durations are defined by constraints over integer numbers. The definition of the operational semantics is given by a set OpSem of constrained Horn clauses (CHCs). Our verification method consists of two steps. (Step 1) We specialize OpSem with respect to a given business process and a given temporal property to be verified, whereby getting a set of CHCs whose satisfiability is equivalent to the validity of the given property. (Step 2) We use state-of-the-art solvers for CHCs to check the satisfiability of such sets of clauses. We have implemented our verification method using the VeriMAP transformation system, and the Eldarica and Z3 solvers for CHCs.

Constructive Ontologies

“…Questions related to different approaches to the synthesis of program objects are theoretically considered in [14]: deductive, schematic and inductive synthesis of pure solutions, performed, in particular, in interaction with a man. Recent investigations in the area of logical-based program synthesis and transformations concern partial evaluation of programs [15], translation of an actor-based languages to the functional languages [16], verifying properties of time-aware business processes [17], synthesis software contracts from programs [18], synthesis of efficient generators for lambda terms [19].…”