Plausibility Checking of Formal Business Process Specifications in Linear Temporal Logic

Plausibility Checking of Formal Business Process Specifications in Linear Temporal Logic

Abstract

Many approaches for keeping business processes in line with constraints stemming from various sources (such as laws and regulations) are based on Linear Temporal Logic (LTL). Creating LTL specifications is an error-prone task which entails the risk that the formula does not match the intention of its creator. This paper proposes a plausibility checking approach for LTL-based specifications. The proposed approach can provide confidence in an LTL formula if plausibility checking is passed. If the formula does not pass the plausibility checks, a counterexample trace and the truth values of both the LTL formula and the plausibility specification are generated and can be used as a starting point for correction.

Grafik Top
Authors
  • Czepa, Christoph
  • Tran, Huy
  • Zdun, Uwe
  • Tran, Thanh
  • Weiss, Erhard
  • Ruhsam, Christoph
Grafik Top
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Full Paper in Proceedings)
Event Title
28th International Conference on Advanced Information Systems Engineering (CAiSE'16), Forum Track
Divisions
Software Architecture
Subjects
Informatik Allgemeines
Software Engineering
Angewandte Informatik
Angewandte Informatik Sonstiges
Informatik Sonstiges
Event Location
Ljubljana, Slovenia
Event Type
Conference
Event Dates
13-17 June 2016
Date
June 2016
Export
Grafik Top