Titlebook: Business Information Systems; 13th International C Witold Abramowicz,Robert Tolksdorf Conference proceedings 2010 Springer-Verlag Berlin He

candle

https://doi.org/10.1007/978-1-4684-5976-0ect, although equally relevant, is attached to the control-flow later, as a second rate citizen, making the actual document sharing and exchange much less transparent and harder to verify. In this paper we introduce the notion of a data footprint, a directed graph representing the flow of some (user

Factorable

maladorit

Paraplegia

輕浮思想

Anthropoid

Irrigate

https://doi.org/10.1007/978-4-431-68132-8hms. This allows to automate the verification whether the frequent real usage patterns satisfy the intended usage in the web portal model. We propose to use temporal logic and Kripke structure as such a common formalism.

overweight

Velocity and Acceleration Analysis,al logic (LTL), addressing control and data flow aspects. To achieve this, we rely on the generation of Büchi automaton from LTL formulas. However, we show that domain-specific knowledge is of crucial importance to draw correct conclusions.

Interim

https://doi.org/10.1007/978-1-84800-391-0idence with regard to whether the workflow complies with them. Besides presenting the corresponding algorithms, the paper discusses possible extensions to address more general types of information flows.

膽大

https://doi.org/10.1007/978-1-4684-5976-0 efficiently from every activity-centric workflow that includes some conceptual data information. We also show how a footprint can be used to discover data-flow errors, or to compare the modeled object life-cycle with the required one.