For the most recent entries see the Petri Nets Newsletter.

Towards Correct Distributed Simulation of High-Level Petri Nets with Fine-Grained Partitioning.

Knoke, Michael; Kühling, Felix; Zimmermann, Armin; Hommel, Günter

In: Jiannong Cao, Laurence T. Yang, Minyi Guo, et al. (Eds.): Lecture Notes in Computer Science, Vol. 3358: Parallel and Distributed Processing and Applications: Second International Symposium, ISPA 2004, Hong Kong, China, December 13-15, 2004, pages 64-74. Springer-Verlag, 2004.

Abstract: Powerful grid and cluster computers allow efficient distributed simulation. Optimistic simulation techniques have been developed which allow for more parallelism in the local simulations than conservative methods. However, they may require costly rollbacks in simulation time due to dependencies between model parts that cause violations of global causality. Different notions of time have been proposed to detect and remedy these situations. Logical time (or Lamport time) is used in many present-day distributed simulation algorithms. However, high-level colored Petri nets may contain global activity priorities, vanishing states, and global state dependencies. Thus virtual time is not sufficient to maintain the global chronological order of events for the optimistic simulation of this model class. The paper presents a new approach that guarantees a correct ordering of global states in a distributed Petri net simulation. A priority-enhanced vector time algorithm is used to detect causal dependencies.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography