Business process verification with constraint temporal answer set programming

DOI10.1017/S1471068413000409MaRDI QIDQ5398302zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Alberto Martelli, Matteo Spiotta, Daniele Theseider Dupré, Laura Giordano

Publication date 27 February 2014

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s1471068413000409

zbMATH Keywords

answer set programmingbounded model checkingbusiness process verificationDLTLtemporal action modelsworkflow verification

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Verification of time-aware business processes using constrained Horn clauses
• Verifying business process compliance by reasoning about actions
• A rigorous methodology for specification and verification of business processes
• Verification from Declarative Specifications Using Logic Programming
• Abductive logic programming as an effective technology for the static verification of declarative business processes

Cites work

• Automatic workflow verification and generation
• Bounded LTL model checking with stable models
• Dynamic linear time temporal logic
• Handbook of philosophical logic. Volume II: Extensions of classical logic
• Reasoning about actions with Temporal Answer Sets
• Representation results for defeasible logic

Cited in

(13)

• From generating process views over inter-organizational business processes to achieving their temporal consistency
• Determining temporal agreements in cross-organizational business processes
• Verification of time-aware business processes using constrained Horn clauses
• Optimising business process discovery using answer set programming
• Abductive logic programming as an effective technology for the static verification of declarative business processes
• On-the-fly auditing of business processes
• Verifying business process compliance by reasoning about actions
• ${\cal B}$ -Tropos
• Efficient semantics-based compliance checking using LTL formulae and unfolding
• An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints
• Algorithm for formal verification of business process templates
• Compliance in business processes with incomplete information and time constraints: a general framework based on abductive reasoning
• Efficient full compliance checking of concurrent components for business process models

Describes a project that uses

Uses Software

• Clingcon

This page was built for publication: Business process verification with constraint temporal answer set programming

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