A lazy approach to symmetry reduction

DOI10.1007/S00165-009-0131-XzbMath1214.68225OpenAlexW2040535771MaRDI QIDQ613132

Thomas Wahl, Vijay D'Silva

Publication date: 17 December 2010

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-009-0131-x

zbMATH Keywords

symmetrypartitionmodel checkingannotated structuresubsumption

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• TopSpin
• SPIN
• CUDD
• Uppaal

Cites Work

• Unnamed Item
• The size of the largest antichain in the partition lattice
• Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives
• Lazy abstraction
• Adaptive Symmetry Reduction
• FM 2005: Formal Methods
• Formal Modeling and Analysis of Timed Systems
• Correct Hardware Design and Verification Methods

This page was built for publication: A lazy approach to symmetry reduction