The ComBack Method Revisited: Caching Strategies and Extension with Delayed Duplicate Detection

Authors:
Sami Evangelista;Michael Westergaard;Lars M. Kristensen
Affiliations:
Computer Science Department, Aarhus University, Denmark;Computer Science Department, Aarhus University, Denmark;Department of Computer Engineering, Bergen University College, Norway
Venue:
Transactions on Petri Nets and Other Models of Concurrency III
Year:
2009

Citing 0
Cited 4

ASAP: An Extensible Platform for State Space Analysis

PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Modeling and verification of a protocol for operational support using coloured petri nets

PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
A perspective on explicit state space exploration of coloured petri nets: past, present, and future

PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
A graphical approach to component-based and extensible model checking platforms

Transactions on Petri Nets and Other Models of Concurrency V

Quantified Score

Hi-index	0.00

Visualization

Abstract

The ComBack method is a memory reduction technique for explicit state space search algorithms. It enhances hash compaction with state reconstruction to resolve hash conflicts on-the-fly thereby ensuring full coverage of the state space. In this paper we provide two means to lower the run-time penalty induced by state reconstructions: a set of strategies to implement the caching method proposed in [20], and an extension through delayed duplicate detection that allows to group reconstructions together to save redundant work.