Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Token History Petri Nets

van Hee K., Serebrenik A., Sidorova N.

Fundamenta Informaticae

2008

Vol. 85, nr 1-4

219-234

State of the art information system commonly record events in log files, also known as audit trails. Moreover, business processes often go beyond the sole recording the events and base decisions on the events observed in the past. To model such processes we extend the basic Petri net framework with the notion of history by associating tokens with histories, adding guards evaluated on the history to the transitions and mapping arcs to expressions involving histories. Guards and arc expressions can involve data associated with the transitions.

Checking Properties of Adaptive Workflow Nets

van Hee K., Oanea O., Serebrenik A., Sidorova N., Voorhoeve M., Lomazova I.A.

Fundamenta Informaticae

2007

Vol. 79, nr 3-4

347-362

In this paper we consider adaptive workflow nets, a class of nested nets that allows more comfort and expressive power for modeling adaptability and exception handling in workflow nets. We define two important behavioural properties of adaptive workflow nets: soundness and circumspectness. Soundness means that a proper final marking (state) can be reached from any marking which is reachable from the initial marking, and no garbage will be left. Circumspectness means that the upper layer is always ready to handle any exception that can happen in a lower layer. We define a finite state abstraction for adaptive workflow nets and show that soundness and circumspectness can be verified on this abstraction.

Resource-Constrained Workflow Nets

van Hee K., Sidorova N., Voorhoeve M.

Fundamenta Informaticae

2006

Vol. 71, nr 2,3

243-257

We study concurrent processes modelled as workflow Petri nets extended with resource constrains. Resources are durable units that can be neither created nor destroyed: they are claimed during the handling procedure and then released again. Typical kinds of resources are manpower, machinery, computer memory. We define structural criteria based on traps and siphons for the correctness of workflow nets with resource constraints. We also extend the soundness notion for workflow nets to the workflow nets with resource constraints; extra conditions concern the durability of resources. We prove some properties of sound resource-constrained workflow nets