Extending symmetry reduction techniques to a realistic model of computation
DOI10.1016/J.ENTCS.2007.05.029zbMATH Open1335.68135OpenAlexW2148371997MaRDI QIDQ5178995FDOQ5178995
Authors: Alastair Donaldson, Alice Miller
Publication date: 18 March 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.05.029
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
Cited In (10)
- Improving Discrete Model Representations via Symmetry Considerations
- Vector symmetry reduction
- Title not available (Why is that?)
- Correct Hardware Design and Verification Methods
- Title not available (Why is that?)
- Formal Modeling and Analysis of Timed Systems
- On the constructive orbit problem
- An adaptive prefix-assignment technique for symmetry reduction
- Symmetry reduction in infinite games with finite branching
- Local symmetry and compositional verification
Uses Software
This page was built for publication: Extending symmetry reduction techniques to a realistic model of computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178995)