On-the-fly auditing of business processes
| Autor: | Hee, van, K.M., Hidders, A.J.H., Houben, G.J.P.M., Paredaens, J., Thiran, P.A.P., Jensen, K., Donatelli, S., Koutny, M. |
|---|---|
| Přispěvatelé: | Process Science |
| Jazyk: | angličtina |
| Rok vydání: | 2010 |
| Předmět: |
Computer science
Business process Programming language Business rule Artifact-centric business process model Real-time computing Business process modeling computer.software_genre Specification pattern Business domain Business Process Model and Notation Business process discovery Business rule management system Information system Business logic Semantics of Business Vocabulary and Business Rules computer |
| Zdroj: | Transactions on Petri Nets and Other Models of Concurrency IV, 144-173 STARTPAGE=144;ENDPAGE=173;TITLE=Transactions on Petri Nets and Other Models of Concurrency IV Transactions on Petri Nets and Other Models of Concurrency IV ISBN: 9783642182211 |
| Popis: | Information systems supporting business processes are usually very complex. If we have to ensure that certain business rules are enforced in a business process, it is often easier to design a separate system, called a monitor, that collects the events of the business processes and verifies whether the rules are satisfied or not. This requires a business rule language (BRL) that allows to verify business rules over finite histories. We introduce such a BRL and show that it can express many common types of business rules. We introduce two interesting properties of BRL formulas: the future stability and the past stability. The monitor should be able to verify the business rules over the complete history, which is increasing over time. Therefore we consider abstractions of the history. Actually we generate from a set of business rules a labeled transition system (with countable state space) that can be executed by the monitor if each relevant event of the business process triggers a step in the labeled transition system. As long as the monitor is able to execute a step, the business rules are not violated. We show that for a sublanguage of BRL, we can transform the labeled transition system into a colored Petri net such that verification becomes independent of the history length. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|