Efficient semantics-based compliance checking using LTL formulae and unfolding

DOI10.1155/2013/962765zbMATH Open1311.68089OpenAlexW2114689332WikidataQ59007201 ScholiaQ59007201MaRDI QIDQ364600FDOQ364600

Authors: Liang Song, Lijie Wen, Hui Kong, Jianmin Wang 

Publication date: 9 September 2013

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/962765

Recommendations

• Business process compliance using reference models of law
• Efficient full compliance checking of concurrent components for business process models
• Formal verification of complex business processes based on high-level Petri nets
• Business process verification with constraint temporal answer set programming
• Computational complexity of compliance and conformance: drawing a line between theory and practice

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of organizations, manpower planning in operations research (90B70)

Cites Work

• Title not available (Why is that?)
• Branching processes of Petri nets
• An improvement of McMillan's unfolding algorithm
• A technique of state space search based on unfolding
• Formal semantics and analysis of control flow in WS-BPEL

Cited In (3)

• Business process compliance using reference models of law
• Algorithms for tractable compliance problems
• Efficient full compliance checking of concurrent components for business process models

Uses Software

• BPEL2oWFN

This page was built for publication: Efficient semantics-based compliance checking using LTL formulae and unfolding

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