The British Nationality Act as a logic program
Communications of the ACM
Transformations and decompositions of nets
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Problems concerning fairness and temporal logic for conflict-free Petri nets
Theoretical Computer Science
Free choice Petri nets
DAML-S: Web Service Description for the Semantic Web
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Implicit Places in Net Systems
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Compliance checking between business processes and business contracts
EDOC '06 Proceedings of the 10th IEEE International Enterprise Distributed Object Computing Conference
Enabling Semantic Web Services: The Web Service Modeling Ontology
Enabling Semantic Web Services: The Web Service Modeling Ontology
Integration and verification of semantic constraints in adaptive process management systems
Data & Knowledge Engineering
A static compliance-checking framework for business process models
IBM Systems Journal
Reasoning about the behavior of Semantic Web services with concurrent transaction logic
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
ER '07 Tutorials, posters, panels and industrial contributions at the 26th international conference on Conceptual modeling - Volume 83
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Auditing Business Process Compliance
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Efficient Compliance Checking Using BPMN-Q and Temporal Logic
BPM '08 Proceedings of the 6th International Conference on Business Process Management
On the update of description logic ontologies at the instance level
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Integrating description logics and action formalisms: first results
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Modeling control objectives for business process compliance
BPM'07 Proceedings of the 5th international conference on Business process management
Process mining and verification of properties: an approach based on temporal logic
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Semantic correctness in adaptive process management systems
BPM'06 Proceedings of the 4th international conference on Business Process Management
Producing compliant interactions: conformance, coverage, and interoperability
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
Optimizing Web Service Composition While Enforcing Regulations
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Visually specifying compliance rules and explaining their violations for business processes
Journal of Visual Languages and Computing
Information Systems Frontiers
Temporal deontic action logic for the verification of compliance to norms in ASP
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Law
Service Oriented Computing and Applications
How to guarantee compliance between workflows and product lifecycles?
Information Systems
Hi-index | 0.00 |
Compliance management is important in several industry sectors where there is a high incidence of regulatory control. It must be ensured that business practices, as reflected in business processes, comply with the rules. Such compliance checks are challenging due to (1) the different life cycles of rules and processes, and (2) their disparate representations. (1) requires retrospective checking of process models. To address (2), we herein devise a framework where processes are annotated to capture the semantics of task execution, and compliance is checked against a set of constraints posing restrictions on the desirable process states. Each constraint is a clause, i.e., a disjunction of literals. If a process can reach a state that falsifies all literals of one of the constraints, then that constraint is violated in that state, and indicates non-compliance. Naively, such compliance can be checked by enumerating all reachable states. Since long waiting times are undesirable, it is important to develop efficient (low-order polynomial time) algorithms that (a) perform exact compliance checking for restricted cases, or (b) perform approximate compliance checking for more general cases. Herein, we observe that methods of both kinds can be defined as a natural extension of our earlier work on semantic business process validation. We devise one method of type (a), and we devise two methods of type (b); both are based on similar restrictions to the processes, where the restrictions made by methods (b) are a subset of those made by method (a). The approximate methods each guarantee either of soundness (finding only non-compliances) or completeness (finding all non-compliances). We describe how one can trace the state evolution back to the process activities which caused the (potential) non-compliance, and hence provide the user with an error diagnosis.