Results 1  10
of
92
Automatic verification of datacentric business processes
 In ICDT
, 2009
"... We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". Artifacts are used to represent (real or conceptual) key business entities, including both their data schema and lifecycles. The lifecycle of an artifact type spe ..."
Abstract

Cited by 80 (25 self)
 Add to MetaCart
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". Artifacts are used to represent (real or conceptual) key business entities, including both their data schema and lifecycles. The lifecycle of an artifact type specifies the possible sequencings of services that can be applied to an artifact of this type as it progresses through the business process. The artifactcentric approach was introduced by IBM, and has been used to achieve substantial savings when performing business transformations. In this paper, artifacts carry attribute records and internal state relations (holding sets of tuples) that services can consult and update. In addition, services can access an underlying database and can introduce new values from an infinite domain, thus modeling external inputs or partially specified processes described by preandpost
A brief history of process algebra
 Theor. Comput. Sci
, 2004
"... Abstract. This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The a ..."
Abstract

Cited by 72 (1 self)
 Add to MetaCart
(Show Context)
Abstract. This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The author gives his personal views on these matters. He also considers the present situation, and states some challenges for the future.
Verification of relational datacentric dynamic systems with external services
, 2013
"... Datacentric dynamic systems are systems where both the process controlling the dynamics and the manipulation of data are equally central. We study verification of (firstorder) µcalculus variants over relational datacentric dynamic systems, where data are maintained in a relational database, and ..."
Abstract

Cited by 49 (19 self)
 Add to MetaCart
(Show Context)
Datacentric dynamic systems are systems where both the process controlling the dynamics and the manipulation of data are equally central. We study verification of (firstorder) µcalculus variants over relational datacentric dynamic systems, where data are maintained in a relational database, and the process is described in terms of atomic actions that evolve the database. Action execution may involve calls to external services, thus inserting fresh data into the system. As a result such systems are infinitestate. We show that verification is undecidable in general, and we isolate notable cases where decidability is achieved. Specifically we start by considering service calls that return values deterministically (depending only on passed parameters). We show that in a µcalculus variant that preserves knowledge of objects appeared along a run we get decidability under the assumption that the fresh data introduced along a
History effects and verification
 In APLAS’04: The Second ASIAN Symposium on Programming Languages and Systems
, 2004
"... Abstract. This paper shows how type effect systems can be combined with modelchecking techniques to produce powerful, automatically verifiable program logics for higherorder programs. The properties verified are based on the ordered sequence of events that occur during program execution—an event h ..."
Abstract

Cited by 43 (6 self)
 Add to MetaCart
(Show Context)
Abstract. This paper shows how type effect systems can be combined with modelchecking techniques to produce powerful, automatically verifiable program logics for higherorder programs. The properties verified are based on the ordered sequence of events that occur during program execution—an event history. Our type and effect systems automatically infer conservative approximations of the event histories arising at runtime, and modelchecking techniques are used to verify logical properties of these histories. Our language model is based on the λcalculus. Technical results include a powerful type inference algorithm for a polymorphic type effect system, and a method for applying known modelchecking techniques to the history effects inferred by the type inference algorithm, allowing static enforcement of history and stackbased security mechanisms. 1
Deciding DPDA Equivalence is Primitive Recursive
 IN PROCEEDINGS 29TH COLLOQIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING, NUMBER 2380 IN LECTURE NOTES IN COMPUTER SCIENCE
, 2001
"... this paper I describe a simpler decision procedure that is determinisitic and that avoids the decomposition mechanism for termination (the rule CUT in [14] and the transformation TC in [12]). Instead, there is a new and simpler analysis of termination, centred on a new combinatorial result, "th ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
(Show Context)
this paper I describe a simpler decision procedure that is determinisitic and that avoids the decomposition mechanism for termination (the rule CUT in [14] and the transformation TC in [12]). Instead, there is a new and simpler analysis of termination, centred on a new combinatorial result, "the extension theorem". One consequence is that the syntax of the starting process calculus is not extended. Another consequence is a primitive recursive upper bound on the complexity of the procedure. Section 2 introduces the DPDA problem as a bisimulation equivalence problem. Section 3 describes some features of the process calculus in more detail. Finally, Section 4 introduces the deterministic tableau proof decision procedure
Decidability of DPDA equivalence
, 1999
"... A proof of decidability of equivalence between deterministic pushdown automata is presented using a mixture of methods developed in concurrency and language theory. The technique appeals to a tableau proof system for equivalence of configurations of strict deterministic grammars. ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
(Show Context)
A proof of decidability of equivalence between deterministic pushdown automata is presented using a mixture of methods developed in concurrency and language theory. The technique appeals to a tableau proof system for equivalence of configurations of strict deterministic grammars.
Artifact systems with data dependencies and arithmetic
, 2011
"... We revisit 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 businessrelevant objects and are updated by a set of services equipped with preandpost conditions, that ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
(Show Context)
We revisit 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 businessrelevant objects and are updated by a set of services equipped with preandpost conditions, 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 firstorder extension of lineartime temporal logic. In previous work we identified the class of guarded artifact systems and properties, for which verification is decidable. However, the results suffer from an important limitation: they fail in the presence of even very simple data dependencies or arithmetic, both crucial to reallife business processes. In this paper, 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 our previous work. While the worstcase complexity of verification is nonelementary, we identify various realistic restrictions yielding more palatable upper bounds.
Roadmap of Infinite Results
, 2008
"... This paper provides a comprehensive summary of equivalence checking results for infinitestate systems. References to the relevant papers will be updated continuously according to the development in the area. The most recent version of this document is available from the webpage ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
This paper provides a comprehensive summary of equivalence checking results for infinitestate systems. References to the relevant papers will be updated continuously according to the development in the area. The most recent version of this document is available from the webpage
Description Logic Knowledge and Action Bases
, 2013
"... Description logic Knowledge and Action Bases (KAB) are a mechanism for providing both a semantically rich representation of the information on the domain of interest in terms of a description logic knowledge base and actions to change such information over time, possibly introducing new objects. We ..."
Abstract

Cited by 17 (9 self)
 Add to MetaCart
Description logic Knowledge and Action Bases (KAB) are a mechanism for providing both a semantically rich representation of the information on the domain of interest in terms of a description logic knowledge base and actions to change such information over time, possibly introducing new objects. We resort to a variant of DLLite where the unique name assumption is not enforced and where equality between objects may be asserted and inferred. Actions are specified as sets of conditional effects, where conditions are based on epistemic queries over the knowledge base (TBox and ABox), and effects are expressed in terms of new ABoxes. In this setting, we address verification of temporal properties expressed in a variant of firstorder µcalculus with quantification across states. Notably, we show decidability of verification, under a suitable restriction inspired by the notion of weak acyclicity in data exchange.