Efficient full compliance checking of concurrent components for business process models

MaRDI QIDQ5869642zbMATH OpenFDO

Authors Silvano Colombo Tosatto, Guido Governatori, Nick van Beest, F. Oliveri

Publication date 28 September 2022

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• Efficient semantics-based compliance checking using LTL formulae and unfolding
• Computational complexity of compliance and conformance: drawing a line between theory and practice
• Formal verification of complex business processes based on high-level Petri nets
• Probabilistic model checking of BPMN processes at runtime
• Business process verification with constraint temporal answer set programming

Cited in

(2)

• Efficient semantics-based compliance checking using LTL formulae and unfolding
• Computational complexity of compliance and conformance: drawing a line between theory and practice

This page was built for publication: Efficient full compliance checking of concurrent components for business process models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869642)