Information systems engineering: a formal approach
Information systems engineering: a formal approach
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Workflow management: models, methods, and systems
Workflow management: models, methods, and systems
Petri Nets for System Engineering: A Guide to Modeling, Verification, and Applications
Petri Nets for System Engineering: A Guide to Modeling, Verification, and Applications
Deriving Unbounded Petri Nets from Formal Languages
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
Process Discovery Using Integer Linear Programming
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Coloured Petri Nets: Modelling and Validation of Concurrent Systems
Coloured Petri Nets: Modelling and Validation of Concurrent Systems
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Hi-index | 0.00 |
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.