A lazy approach to symmetry reduction

DOI10.1007/S00165-009-0131-XMaRDI QIDQ613132zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Adaptive Symmetry Reduction
• Tools and Algorithms for the Construction and Analysis of Systems
• scientific article; zbMATH DE number 1796126
• scientific article; zbMATH DE number 1487862
• Regular symmetry patterns

Cites work

• scientific article; zbMATH DE number 1487862 (Why is no real title available?)
• Adaptive Symmetry Reduction
• Correct Hardware Design and Verification Methods
• FM 2005: Formal Methods
• Formal Modeling and Analysis of Timed Systems
• Lazy abstraction
• Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives
• The size of the largest antichain in the partition lattice

Cited in

(3)

• Adaptive Symmetry Reduction
• Symmetric Reductions
• Exploring structural symmetry automatically in symbolic trajectory evaluation

Describes a project that uses

Uses Software

• TopSpin
• SPIN
• CUDD
• Uppaal

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

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