Abstract.A promising approach to managing business operations is based on business entities with lifecycles (BEL's) (a.k.a. business artifacts), i.e., key conceptual entities that are central to guiding the operations of a business, and whose content changes as they move through those operations. A BEL type includes both an information model that captures, in either materialized or virtual form, all of the business-relevant data about entities of that type, and a lifecycle model, that specifies the possible ways an entity of that type might progress through the business by responding to events and invoking services, including human activities. Most previous work on BEL's has focused on the use of lifecycle models based on variants of finite state machines. This paper introduces the Guard-StageMilestone (GSM) meta-model for lifecycles, which is an evolution of the previous work on BEL's. GSM lifecycles are substantially more declarative than the finite state machine variants, and support hierarchy and parallelism within a single entity instance. The GSM operational semantics are based on a form of EventCondition-Action (ECA) rules, and provide a basis for formal verification and reasoning. This paper provides an informal, preliminary introduction to the GSM approach, and briefly overviews selected research directions.
We study the static verification problem for data-centric business processes, specified in a variant of IBM's “business artifact” model. Artifacts are records of variables that correspond to business-relevant objects and are updated by a set of services equipped with pre- and postconditions, that implement business process tasks. The verification problem consists in statically checking whether all runs of an artifact system satisfy desirable properties expressed in a first-order extension of linear-time temporal logic. Previous work identified the class of
guarded
artifact systems and properties, for which verification is decidable. However, the results suffer an important limitation: they fail in the presence of even very simple data dependencies or arithmetic, both crucial to real-life business processes. In this article, we extend the artifact model and verification results to alleviate this limitation. We identify a practically significant class of business artifacts with data dependencies and arithmetic, for which verification is decidable. The technical machinery needed to establish the results is fundamentally different from previous work. While the worst-case complexity of verification is nonelementary, we identify various realistic restrictions yielding more palatable upper bounds.
Abstract. In this paper, we study the problem of data integration in P2P systems. Differently from the traditional setting, data integration in these systems is not based on the existence of a global view. Instead, each peer exports data in terms of its own schema, and information integration is achieved by establishing mappings among the various peer schemas. We present a framework that captures this general architecture, and then we discuss the problem of characterizing the semantics of such framework. We show that the usual approach of resorting to a first-order logic intepretation of P2P mappings, leads both to a poor modeling of the whole system, and to undecidability of query answering, even for mappings of a restricted form. This motivates the need of a new semantics for P2P system. We then present a novel proposal, based on epistemic logic, and show that not only it adequately models the interactions among peers, but it also supports decidable query answering. In particular, for the restricted form of mapping mentioned above, query answering is polynomial with respect to the size of data stored in the peers.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.