Specifying and Verifying Business Processes Using PPML

  • Authors:
  • Germán Regis;Nazareno Aguirre;Tom Maibaum

  • Affiliations:
  • Departamento de Computación, FCEFQyN, Universidad Nacional de Río Cuarto and CONICET, Córdoba, Argentina;Departamento de Computación, FCEFQyN, Universidad Nacional de Río Cuarto and CONICET, Córdoba, Argentina;Department of Computing & Software, McMaster University, Hamilton, Canada L8S 4K1

  • Venue:
  • ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Product Process Modeling Language (PPML) is a formal language for the specification of business processes, which has a formal semantics based on timed transition systems. As opposed to other business process modeling languages, PPML puts an emphasis on products (not only processes), allowing the specifier to describe properties of these, and how processes affect them. This facilitates modeling of business processes, and combined with other characteristics of the language, most notably timing constraints in the form of time bounds associated with processes, makes it an expressive vehicle for modeling business processes. PPML is more a formalism than an actual modeling language, since no syntax was ever defined for the formalism. In this paper, we define a suitable syntax for PPML models, and provide a formal semantics for the extended language in terms of timed automata. The formal semantics is given as a translation from PPML into UPPAAL. This formal semantics enables us to straightforwardly employ the UPPAAL model checker in order to verify real time properties of PPML specifications. We show some of the benefits of a product-oriented language for business process modeling, the details of our translation and the results of the use of the UPPAAL model checker for PPML specifications via a simple case study, regarding a motherboard production line.