Conference Paper

Business Process Monitoring with BPath - (Short Paper).

DOI: 10.1007/978-3-642-16934-2_33 Conference: On the Move to Meaningful Internet Systems: OTM 2010 - Confederated International Conferences: CoopIS, IS, DOA and ODBASE, Hersonissos, Crete, Greece, October 25-29, 2010, Proceedings, Part I
Source: DBLP

ABSTRACT Enterprise information systems allow more automation of tasks and complex interconnections, particularly with the emergence
of new paradigms like Service Oriented Architecture (SOA). These new environments make checking correctness of systems at
design-time as well as at run-time particularly challenging. In this paper, we propose a new monitoring framework that makes
use of business protocols as a simple abstraction of business processes. We provide a monitoring language called BPath, which
is an XPath-based language for both expressing and checking temporal and hybrid logical properties at run-time, making the
execution of a business process visible by expressing and evaluating statistical queries over execution traces.

0 Bookmarks
 · 
69 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Many enterprises nowadays use business processes, based on the BPEL standard, to achieve their goals. These are complex, often distributed, processes. Monitoring the execution of such processes for interesting patterns is critical for enforcing business policies and meeting efficiency and reliability goals. BP-Mon (Business Processes Monitoring) is a novel query language for monitoring business processes, that allows users to visually define monitoring tasks and associated reports, using a simple intuitive interface, sim- ilar to those used for designing BPEL processes. We describe here the BP-Mon language and its underlying formal model. We also present the language implementation and describe our novel opti- mization techniques. An important feature of the implementation is thatBP-Mon queries are translated to BPEL processes that run on the same execution engine as the monitored processes. Our exper- iments indicate that this approach incurs very minimal overhead, hence is a practical and efficient approach to monitoring.
    Proceedings of the 33rd International Conference on Very Large Data Bases, University of Vienna, Austria, September 23-27, 2007; 01/2007
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We present a (sound and complete) tableau calculus for Quantified Hybrid Logic (QHL). QHL is an extension of orthodox quantified modal logic: as well as the usual ¿ and ¿ modalities it contains names for (and variables over) states, operators @s for asserting that a formula holds at a named state, and a binder ¿ that binds a variable to the current state. The first-order component contains equality and rigid and non-rigid designators. As far as we are aware, ours is the first tableau system for QHL.Completeness is established via a variant of the standard translation to first-order logic. More concretely, a valid QHL-sentence is translated into a valid first-order sentence in the correspondence language. As it is valid, there exists a first-order tableau proof for it. This tableau proof is then converted into a QHL tableau proof for the original sentence. In thisway we recycle a well-known result (completeness of first-order logic) instead of a well-known proof.The tableau calculus is highly flexible.We only present it for the constant domain semantics, but slight changes render it complete for varying, expanding or contracting domains. Moreover, completeness with respect to specific frame classes can be obtained simply by adding extra rules or axioms (this can be done for every first-order definable class of frames which is closed under and reflects generated subframes).
    Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2002, Copenhagen, Denmark, July 30 - August 1, 2002, Proceedings; 01/2002
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The intrinsic flexibility and dynamism of service-centric a pplications preclude their pre-release validation and demand for suitable probes to monitor their behavior at run-time. Probes must be suitably activat ed and deactivated ac- cording to the context in which the application is executed, but also according to the confidence we get on its quality. The paper supports the id ea that significant data may come from very different sources and probes must be able to accommo- date all of them. The paper presents: (1) an approach to specify monitoring directives, called mon- itoring rules, and weave them dynamically into the process they belong to; (2) a proxy-based solution to support the dynamic selection and execution of moni- toring rules at run-time; (3) a user-oriented language to in tegrate data acquisition and analysis into monitoring rules.
    Service-Oriented Computing - ICSOC 2005, Third International Conference, Amsterdam, The Netherlands, December 12-15, 2005, Proceedings; 01/2005