1724 search results - page 246 / 345 » Models for Concurrency |
FUIN
2002
13 years 9 months ago
2002
Abstract. This article introduces probabilistic cluster branching processes, a probabilistic unfolding semantics for untimed Petri nets, with no structural or safety assumptions, g...
IFE
2002
13 years 9 months ago
2002
In this article we introduce two new generative approaches of animated computational models. These approaches are applied in context of educational software systems for compiler de...
NETWORKS
2007
13 years 9 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
SSS
2010
Springer
13 years 8 months ago
2010
Springer
We present a distributed transactional memory (TM) scheduler called Bi-interval that optimizes the execution order of transactional operations to minimize conflicts. Bi-interval c...
BPM
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We propose a new technique to analyze the control-flow, i.e., the workflow graph of a business process model, which we call symbolic execution. We consider acyclic workfl...