The ComBack Method – Extending Hash Compaction with Backtracking

DOI10.1007/978-3-540-73094-1_26zbMATH Open1226.68066OpenAlexW2151373036MaRDI QIDQ3612946FDOQ3612946

Authors: Michael Westergaard, Gerth Stølting Brodal, Lars Arge, Lars M. Kristensen 

Publication date: 11 March 2009

Published in: Petri Nets and Other Models of Concurrency – ICATPN 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73094-1_26

Recommendations

• The ComBack method revisited: caching strategies and extension with delayed duplicate detection
• Validation of Stochastic Systems
• A probabilistic dynamic technique for the distributed generation of very large state spaces
• scientific article; zbMATH DE number 1069481
• Model Checking Software

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (3)

• The sweep-line state space exploration method
• The ComBack method revisited: caching strategies and extension with delayed duplicate detection
• Validation of Stochastic Systems

This page was built for publication: The ComBack Method – Extending Hash Compaction with Backtracking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612946)