Applications of deontic logic in computer science: a concise overview
Deontic logic in computer science
Interoperable Transactions in Business Models: A Structured Approach
CAiSE ;96 Proceedings of the 8th International Conference on Advances Information System Engineering
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Complexity and clarity in conceptual modeling: comparison of mandatory and optional properties
Data & Knowledge Engineering - Special issue: Quality in conceptual modeling
Process modelling: the deontic way
APCCM '06 Proceedings of the 3rd Asia-Pacific conference on Conceptual modelling - Volume 53
Auditing Business Process Compliance
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Graph-grammars: An algebraic approach
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Declarative process modeling with business vocabulary and business rules
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems - Volume Part I
Modeling control objectives for business process compliance
BPM'07 Proceedings of the 5th international conference on Business process management
Designing compliant business processes with obligations and permissions
BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops
Ten problems of deontic logic and normative reasoning in computer science
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
| Hi-index | 0.00 |
The Business Process Model and Notation (BPMN) is maintained by the Object Management Group (OMG) and a widely-used standard for process modeling. A drawback of BPMN, however, is that modality is implicitly expressed through the structure of the process flow. All activities are implicitly mandatory and whenever something should be optional, a gateway or event is used to split the process flow and offer the possibility to execute the task or to do nothing. This requires a comprehensive understanding of the whole process to identify mandatory, optional and alternative activities. The paper addresses this issue and extends BPMN with deontic logic to explicitly highlight modality. After a detailed study of modality expressed through various BPMN elements, an approach based on path exploration is introduced to support the deontic analysis. The result is an algebraic graph transformation from BPMN to Deontic BPMN diagrams, reducing the structural complexity and allowing better readability by explicitly highlighting the deontic classification. The understandability of Deontic BPMN is studied by means of a preliminary survey.