Show simple item record

dc.contributor.authorMontali, M
dc.contributor.authorTorroni, P
dc.contributor.authorChesani, F
dc.contributor.authorMello, P
dc.contributor.authorAlberti, M
dc.contributor.authorLamma, E
dc.date.accessioned2015-08-05T09:36:37Z
dc.date.available2015-08-05T09:36:37Z
dc.date.issued2010
dc.identifier.issn0169-2968
dc.identifier.urihttp://dx.doi.org/10.3233/FI-2010-310
dc.identifier.urihttp://iospress.metapress.com/content/y534x3367487x8g5/
dc.identifier.urihttp://hdl.handle.net/10863/1234
dc.description.abstractWe discuss the static verification of declarative Business Processes. We identify four desiderata about verifiers, and propose a concrete framework which satisfies them. The framework is based on the ConDec graphical notation for modeling Business Processes, and on Abductive Logic Programming technology for verification of properties. Empirical evidence shows that our verification method seems to perform and scale better, in most cases, than other state of the art techniques (model checkers, in particular). A detailed study of our framework’s theoretical properties proves that our approach is sound and complete when applied to ConDec models that do not contain loops, and it is guaranteed to terminate when applied to models that contain loops.
dc.publisherIOS Press / Polskie Towarzystwo Matematyczne
dc.titleAbductive logic programming as an effective technology for the static verification of declarative business processes
dc.typeArticle
dc.date.updated2015-09-23T11:23:03Z
dc.journal.titleFundamenta Informaticae
dc.description.fulltextinternal


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record