ACM Transactions on Programming Languages and Systems (TOPLAS)
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
An optimality proof for asynchronous recovery algorithms in distributed systems
Information Processing Letters
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Parallel and distributed discrete event simulation: algorithms and applications
WSC '93 Proceedings of the 25th conference on Winter simulation
Consistent global states of distributed systems: fundamental concepts and mechanisms
Distributed systems (2nd Ed.)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Proceedings of the 35th conference on Winter simulation: driving innovation
Towards correct distributed simulation of high-level petri nets with fine-grained partitioning
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Approximate parallel simulation of web search engines
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
| Hi-index | 0.00 |
Petri nets are commonly used for modeling of computer, communication, logistics, and manufacturing systems. Powerful grid and cluster computers allow efficient distributed simulation of such models to speed up execution. Optimistic parallel simulation techniques have been developed for different Petri net classes. Different notions of time have been proposed to detect occurring causality violations. However, global guards in timed colored Petri nets restrict state transitions based on global conditions. Furthermore those nets may contain vanishing states and transition priorities. Those properties require an extended logical time scheme and an efficient monitoring mechanism to capture global conditions over time. The paper presents an appropriate logical time scheme that guarantees correct ordering of global states in a distributed timed colored Petri net simulation. A new mirrored state mechanism is proposed to verify global conditions without limiting the optimistic simulation behavior. Some Petri net examples are used to present performance values on a cluster computer.